Few-shot Knowledge Transfer for Fine-grained Cartoon Face Generation

• URL: http://arxiv.org/abs/2007.13332v1
• Date: Mon, 27 Jul 2020 07:13:10 GMT
• Title: Few-shot Knowledge Transfer for Fine-grained Cartoon Face Generation
• Authors: Nan Zhuang and Cheng Yang
• Abstract summary: We propose a two-stage training process to generate cartoon faces for various groups. First, a basic translation model for the basic group (which consists of sufficient data) is trained. Then, given new samples of other groups, we extend the basic model by creating group-specific branches for each new group.
• Score: 11.951522183013811
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we are interested in generating fine-grained cartoon faces for various groups. We assume that one of these groups consists of sufficient training data while the others only contain few samples. Although the cartoon faces of these groups share similar style, the appearances in various groups could still have some specific characteristics, which makes them differ from each other. A major challenge of this task is how to transfer knowledge among groups and learn group-specific characteristics with only few samples. In order to solve this problem, we propose a two-stage training process. First, a basic translation model for the basic group (which consists of sufficient data) is trained. Then, given new samples of other groups, we extend the basic model by creating group-specific branches for each new group. Group-specific branches are updated directly to capture specific appearances for each group while the remaining group-shared parameters are updated indirectly to maintain the distribution of intermediate feature space. In this manner, our approach is capable to generate high-quality cartoon faces for various groups.

Related papers

• Random Wins All: Rethinking Grouping Strategies for Vision Tokens [42.61073068532527]
  A representative approach involves grouping tokens, performing self-attention calculations within each group, or pooling the tokens within each group into a single token.<n>We propose the random grouping strategy, which involves a simple and fast random grouping strategy for vision tokens.
  arXiv  Detail & Related papers  (2026-02-28T05:59:25Z)
• GroupCoOp: Group-robust Fine-tuning via Group Prompt Learning [57.888537648437115]
  Group Context Optimization (GroupCoOp) is a simple and effective debiased fine-tuning algorithm.<n>It enhances the group robustness of fine-tuned vision-language models (VLMs)<n>GroupCoOp achieved the best results on five benchmarks across five CLIP architectures.
  arXiv  Detail & Related papers  (2025-09-28T09:54:30Z)
• Prompt-Guided Relational Reasoning for Social Behavior Understanding with Vision Foundation Models [8.36651942320007]
  Group Activity Detection (GAD) involves recognizing social groups and their collective behaviors in videos.<n>Vision Foundation Models (VFMs), like DinoV2, offer excellent features, but are pretrained primarily on object-centric data.<n>We introduce Prompt-driven Group Activity Detection (ProGraD) -- a method that bridges this gap through 1) learnable group prompts to guide the VFM attention toward social configurations.
  arXiv  Detail & Related papers  (2025-08-11T13:59:22Z)
• The Research of Group Re-identification from Multiple Cameras [0.4955551943523977]
  Group re-identification is very challenging since it is not only interfered by view-point and human pose variations in the traditional re-identification tasks. This paper introduces a novel approach which leverages the multi-granularity information inside groups to facilitate group re-identification.
  arXiv  Detail & Related papers  (2024-07-19T18:28:13Z)
• Outlier-Robust Group Inference via Gradient Space Clustering [50.87474101594732]
  Existing methods can improve the worst-group performance, but they require group annotations, which are often expensive and sometimes infeasible to obtain. We address the problem of learning group annotations in the presence of outliers by clustering the data in the space of gradients of the model parameters. We show that data in the gradient space has a simpler structure while preserving information about minority groups and outliers, making it suitable for standard clustering methods like DBSCAN.
  arXiv  Detail & Related papers  (2022-10-13T06:04:43Z)
• Multiple Fairness and Cardinality constraints for Students-Topics Grouping Problem [14.051419173519308]
  Group work is a prevalent activity in educational settings, where students are often divided into topic-specific groups based on their preferences. We introduce the multi-fair capacitated (MFC) grouping problem that fairly partitions students into non-overlapping groups. We propose two approaches: a method and a knapsack-based method to obtain the grouping.
  arXiv  Detail & Related papers  (2022-06-20T17:06:10Z)
• AggNet: Learning to Aggregate Faces for Group Membership Verification [20.15673797674449]
  In some face recognition applications, we are interested to verify whether an individual is a member of a group, without revealing their identity. Some existing methods, propose a mechanism for quantizing precomputed face descriptors into discrete embeddings and aggregating them into one group representation. We propose a deep architecture that jointly learns face descriptors and the aggregation mechanism for better end-to-end performances.
  arXiv  Detail & Related papers  (2022-06-17T10:48:34Z)
• Mugs: A Multi-Granular Self-Supervised Learning Framework [114.34858365121725]
  We propose an effective MUlti-Granular Self-supervised learning (Mugs) framework to explicitly learn multi-granular visual features. Mugs has three complementary granular supervisions: 1) an instance discrimination supervision (IDS), 2) a novel local-group discrimination supervision (LGDS), and 3) a group discrimination supervision (GDS)
  arXiv  Detail & Related papers  (2022-03-27T23:42:05Z)
• Fair Group-Shared Representations with Normalizing Flows [68.29997072804537]
  We develop a fair representation learning algorithm which is able to map individuals belonging to different groups in a single group. We show experimentally that our methodology is competitive with other fair representation learning algorithms.
  arXiv  Detail & Related papers  (2022-01-17T10:49:49Z)
• Towards Group Robustness in the presence of Partial Group Labels [61.33713547766866]
  spurious correlations between input samples and the target labels wrongly direct the neural network predictions. We propose an algorithm that optimize for the worst-off group assignments from a constraint set. We show improvements in the minority group's performance while preserving overall aggregate accuracy across groups.
  arXiv  Detail & Related papers  (2022-01-10T22:04:48Z)
• BARACK: Partially Supervised Group Robustness With Guarantees [29.427365308680717]
  We propose BARACK, a framework to improve worst-group performance on neural networks. We train a model to predict the missing group labels for the training data, and then use these predicted group labels in a robust optimization objective. Empirically, our method outperforms the baselines that do not use group information, even when only 1-33% of points have group labels.
  arXiv  Detail & Related papers  (2021-12-31T23:05:21Z)
• Learning Multi-Attention Context Graph for Group-Based Re-Identification [214.84551361855443]
  Learning to re-identify or retrieve a group of people across non-overlapped camera systems has important applications in video surveillance. In this work, we consider employing context information for identifying groups of people, i.e., group re-id. We propose a novel unified framework based on graph neural networks to simultaneously address the group-based re-id tasks.
  arXiv  Detail & Related papers  (2021-04-29T09:57:47Z)
• Few-Shot Learning with Intra-Class Knowledge Transfer [100.87659529592223]
  We consider the few-shot classification task with an unbalanced dataset. Recent works have proposed to solve this task by augmenting the training data of the few-shot classes using generative models. We propose to leverage the intra-class knowledge from the neighbor many-shot classes with the intuition that neighbor classes share similar statistical information.
  arXiv  Detail & Related papers  (2020-08-22T18:15:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.