pith. sign in

arxiv: 1801.02929 · v2 · pith:OH47SRSYnew · submitted 2018-01-09 · 💻 cs.LG · cs.CV· stat.ML

Data Augmentation by Pairing Samples for Images Classification

classification 💻 cs.LG cs.CVstat.ML
keywords datatrainingimagetechniqueaugmentationclassificationsamplestasks
0
0 comments X
read the original abstract

Data augmentation is a widely used technique in many machine learning tasks, such as image classification, to virtually enlarge the training dataset size and avoid overfitting. Traditional data augmentation techniques for image classification tasks create new samples from the original training data by, for example, flipping, distorting, adding a small amount of noise to, or cropping a patch from an original image. In this paper, we introduce a simple but surprisingly effective data augmentation technique for image classification tasks. With our technique, named SamplePairing, we synthesize a new sample from one image by overlaying another image randomly chosen from the training data (i.e., taking an average of two images for each pixel). By using two images randomly selected from the training set, we can generate $N^2$ new samples from $N$ training samples. This simple data augmentation technique significantly improved classification accuracy for all the tested datasets; for example, the top-1 error rate was reduced from 33.5% to 29.0% for the ILSVRC 2012 dataset with GoogLeNet and from 8.22% to 6.93% in the CIFAR-10 dataset. We also show that our SamplePairing technique largely improved accuracy when the number of samples in the training set was very small. Therefore, our technique is more valuable for tasks with a limited amount of training data, such as medical imaging tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Data Interpolating Prediction: Alternative Interpretation of Mixup

    cs.LG 2019-06 unverdicted novelty 6.0

    Introduces DIP that encapsulates sample mixing inside the hypothesis class to reduce Rademacher complexity and improve generalization over standard Mixup.

  2. DP-CDA: An Algorithm for Enhanced Privacy Preservation in Dataset Synthesis Through Randomized Mixing

    stat.ML 2024-11 unverdicted novelty 5.0

    DP-CDA generates synthetic data via class-specific randomized mixing to claim stronger privacy guarantees and higher predictive utility than prior data-publishing methods under equivalent privacy budgets.