SuperMix: Supervising the Mixing Data Augmentation
- URL: http://arxiv.org/abs/2003.05034v2
- Date: Fri, 10 Dec 2021 18:49:00 GMT
- Title: SuperMix: Supervising the Mixing Data Augmentation
- Abstract summary: SuperMix is designed to obtain mixed images rich in visual features and complying with realistic image priors.
We validate the effectiveness of SuperMix through extensive evaluations and ablation studies on two tasks of object classification and knowledge distillation.
- Score: 36.264540916051125
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper presents a supervised mixing augmentation method termed SuperMix,
which exploits the salient regions within input images to construct mixed
training samples. SuperMix is designed to obtain mixed images rich in visual
features and complying with realistic image priors. To enhance the efficiency
of the algorithm, we develop a variant of the Newton iterative method,
$65\times$ faster than gradient descent on this problem. We validate the
effectiveness of SuperMix through extensive evaluations and ablation studies on
two tasks of object classification and knowledge distillation. On the
classification task, SuperMix provides comparable performance to the advanced
augmentation methods, such as AutoAugment and RandAugment. In particular,
combining SuperMix with RandAugment achieves 78.2\% top-1 accuracy on ImageNet
with ResNet50. On the distillation task, solely classifying images mixed using
the teacher's knowledge achieves comparable performance to the state-of-the-art
distillation methods. Furthermore, on average, incorporating mixed images into
the distillation objective improves the performance by 3.4\% and 3.1\% on
CIFAR-100 and ImageNet, respectively. {\it The code is available at
https://github.com/alldbi/SuperMix}.
Related papers
- Adaptive Mix for Semi-Supervised Medical Image Segmentation [22.69909762038458]
We propose an Adaptive Mix algorithm (AdaMix) for image mix-up in a self-paced learning manner.
We develop three frameworks with our AdaMix, i.e., AdaMix-ST, AdaMix-MT, and AdaMix-CT, for semi-supervised medical image segmentation.
arXiv Detail & Related papers (2024-07-31T13:19:39Z) - SUMix: Mixup with Semantic and Uncertain Information [41.99721365685618]
Mixup data augmentation approaches have been applied for various tasks of deep learning.
We propose a novel approach named SUMix to learn the mixing ratio as well as the uncertainty for the mixed samples during the training process.
arXiv Detail & Related papers (2024-07-10T16:25:26Z) - Adversarial AutoMixup [50.1874436169571]
We propose AdAutomixup, an adversarial automatic mixup augmentation approach.
It generates challenging samples to train a robust classifier for image classification.
Our approach outperforms the state of the art in various classification scenarios.
arXiv Detail & Related papers (2023-12-19T08:55:00Z) - GuidedMixup: An Efficient Mixup Strategy Guided by Saliency Maps [6.396288020763144]
We propose GuidedMixup, which aims to retain the salient regions in mixup images with low computational overhead.
We develop an efficient pairing algorithm that pursues to minimize the conflict of salient regions of paired images.
Experiments on several datasets demonstrate that GuidedMixup provides a good trade-off between augmentation overhead and generalization performance.
arXiv Detail & Related papers (2023-06-29T00:55:51Z) - SMMix: Self-Motivated Image Mixing for Vision Transformers [65.809376136455]
CutMix is a vital augmentation strategy that determines the performance and generalization ability of vision transformers (ViTs)
Existing CutMix variants tackle this problem by generating more consistent mixed images or more precise mixed labels.
We propose an efficient and effective Self-Motivated image Mixing method (SMMix) which motivates both image and label enhancement by the model under training itself.
arXiv Detail & Related papers (2022-12-26T00:19:39Z) - A Simple Data Mixing Prior for Improving Self-Supervised Learning [52.28244748245043]
We propose SDMP, short for $textbfS$imple $textbfD$ata $textbfM$ixing $textbfP$rior.
Our experiments verify that the proposed SDMP enables data mixing to help a set of self-supervised learning frameworks achieve better accuracy and out-of-distribution robustness.
arXiv Detail & Related papers (2022-06-15T17:40:56Z) - CropMix: Sampling a Rich Input Distribution via Multi-Scale Cropping [97.05377757299672]
We present a simple method, CropMix, for producing a rich input distribution from the original dataset distribution.
CropMix can be seamlessly applied to virtually any training recipe and neural network architecture performing classification tasks.
We show that CropMix is of benefit to both contrastive learning and masked image modeling towards more powerful representations.
arXiv Detail & Related papers (2022-05-31T16:57:28Z) - ResizeMix: Mixing Data with Preserved Object Information and True Labels [57.00554495298033]
We study the importance of the saliency information for mixing data, and find that the saliency information is not so necessary for promoting the augmentation performance.
We propose a more effective but very easily implemented method, namely ResizeMix.
arXiv Detail & Related papers (2020-12-21T03:43:13Z) - SnapMix: Semantically Proportional Mixing for Augmenting Fine-grained
Data [124.95585891086894]
Proposal is called Semantically Proportional Mixing (SnapMix)
It exploits class activation map (CAM) to lessen the label noise in augmenting fine-grained data.
Our method consistently outperforms existing mixed-based approaches.
arXiv Detail & Related papers (2020-12-09T03:37:30Z) - StackMix: A complementary Mix algorithm [26.99020412895196]
StackMix: Each input is presented as a concatenation of two images, and the label is the mean of the two one-hot labels.
We show significant gains across a variety of benchmarks are achieved by combining StackMix with existing Mix augmentation.
arXiv Detail & Related papers (2020-11-25T10:15:24Z)
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.