Observations on K-image Expansion of Image-Mixing Augmentation for Classification

• URL: http://arxiv.org/abs/2110.04248v1
• Date: Fri, 8 Oct 2021 16:58:20 GMT
• Title: Observations on K-image Expansion of Image-Mixing Augmentation for Classification
• Authors: Joonhyun Jeong, Sungmin Cha, Youngjoon Yoo, Sangdoo Yun, Taesup Moon, and Jongwon Choi
• Abstract summary: This paper derives a new K-image mixing augmentation based on the stick-breaking process under Dirichlet prior. We show that our method can train more robust and generalized classifiers through extensive experiments and analysis on classification accuracy, a shape of a loss landscape and adversarial robustness, than the usual two-image methods.
• Score: 33.99556142456945
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Image-mixing augmentations (e.g., Mixup or CutMix), which typically mix two images, have become de-facto training tricks for image classification. Despite their huge success on image classification, the number of images to mix has not been profoundly investigated by the previous works, only showing the naive K-image expansion leads to poor performance degradation. This paper derives a new K-image mixing augmentation based on the stick-breaking process under Dirichlet prior. We show that our method can train more robust and generalized classifiers through extensive experiments and analysis on classification accuracy, a shape of a loss landscape and adversarial robustness, than the usual two-image methods. Furthermore, we show that our probabilistic model can measure the sample-wise uncertainty and can boost the efficiency for Network Architecture Search (NAS) with 7x reduced search time.

Related papers

• Enhance Image Classification via Inter-Class Image Mixup with Diffusion Model [80.61157097223058]
  A prevalent strategy to bolster image classification performance is through augmenting the training set with synthetic images generated by T2I models. In this study, we scrutinize the shortcomings of both current generative and conventional data augmentation techniques. We introduce an innovative inter-class data augmentation method known as Diff-Mix, which enriches the dataset by performing image translations between classes.
  arXiv  Detail & Related papers  (2024-03-28T17:23:45Z)
• Transferable Learned Image Compression-Resistant Adversarial Perturbations [66.46470251521947]
  Adversarial attacks can readily disrupt the image classification system, revealing the vulnerability of DNN-based recognition tasks. We introduce a new pipeline that targets image classification models that utilize learned image compressors as pre-processing modules.
  arXiv  Detail & Related papers  (2024-01-06T03:03:28Z)
• Inter-Instance Similarity Modeling for Contrastive Learning [22.56316444504397]
  We propose a novel image mix method, PatchMix, for contrastive learning in Vision Transformer (ViT) Compared to the existing sample mix methods, our PatchMix can flexibly and efficiently mix more than two images. Our proposed method significantly outperforms the previous state-of-the-art on both ImageNet-1K and CIFAR datasets.
  arXiv  Detail & Related papers  (2023-06-21T13:03:47Z)
• 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)
• Mix-up Self-Supervised Learning for Contrast-agnostic Applications [33.807005669824136]
  We present the first mix-up self-supervised learning framework for contrast-agnostic applications. We address the low variance across images based on cross-domain mix-up and build the pretext task based on image reconstruction and transparency prediction.
  arXiv  Detail & Related papers  (2022-04-02T16:58:36Z)
• Fast Hybrid Image Retargeting [0.0]
  We propose a method that quantifies and limits warping distortions with the use of content-aware cropping. Our method outperforms recent approaches, while running in a fraction of their execution time.
  arXiv  Detail & Related papers  (2022-03-25T11:46:06Z)
• Towards robustness under occlusion for face recognition [0.0]
  In this paper, we evaluate the effects of occlusions in the performance of a face recognition pipeline that uses a ResNet backbone. We designed 8 different occlusion masks which were applied to the input images. In order to increase robustness under occlusions, we followed two approaches. The first is image inpainting using the pre-trained pluralistic image completion network. The second is Cutmix, a regularization strategy consisting of mixing training images and their labels using rectangular patches.
  arXiv  Detail & Related papers  (2021-09-19T08:27:57Z)
• Ensembling with Deep Generative Views [72.70801582346344]
  generative models can synthesize "views" of artificial images that mimic real-world variations, such as changes in color or pose. Here, we investigate whether such views can be applied to real images to benefit downstream analysis tasks such as image classification. We use StyleGAN2 as the source of generative augmentations and investigate this setup on classification tasks involving facial attributes, cat faces, and cars.
  arXiv  Detail & Related papers  (2021-04-29T17:58:35Z)
• 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)
• I Am Going MAD: Maximum Discrepancy Competition for Comparing Classifiers Adaptively [135.7695909882746]
  We name the MAximum Discrepancy (MAD) competition. We adaptively sample a small test set from an arbitrarily large corpus of unlabeled images. Human labeling on the resulting model-dependent image sets reveals the relative performance of the competing classifiers.
  arXiv  Detail & Related papers  (2020-02-25T03:32:29Z)

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.