.png){kind=icon}
Return
Greedy AutoAugment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2020.08.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A major problem in data augmentation is to ensure that the generated new samples cover the search space. This is a challenging problem and requires exploration for data augmentation policies to ensure their effectiveness in covering the search space. In this paper, we propose Greedy AutoAugment as a highly efficient search algorithm to find the best augmentation policies. We use a greedy approach to reduce the exponential growth of the number of possible trials to linear growth. The Greedy Search also helps us to lead the search towards the sub-policies with better results, which eventually helps to increase the accuracy. The proposed method can be used as a reliable addition to the current artifitial neural networks. Our experiments on four datasets (Tiny ImageNet, CIFAR-10, CIFAR-100, and SVHN) show that Greedy AutoAugment provides better accuracy, while using 360 times fewer computational resources. Published by Elsevier B.V.
Keywords:
AutoAugment
Augmentation
ANN
Neural networks
Vision
Classification
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
.png){kind=icon}
