Greedy AutoAugment

Alireza Naghizadeh,Mohammadsajad Abavisani,Dimitris N. Metaxas

Pattern Recognition Letters（2020）

引用 12|浏览5

暂无评分

摘要

•The greedy AutoAugment is proposed to find the best augmentation policies.•It reduces the exponential growth of the number of possible trials to linear growth.•The algorithm is computationally efficient and can concatenate many sub-policies.•The greedy approach helps the algorithm to increase the accuracy of the network.

查看译文

关键词

AutoAugment,Augmentation,ANN,Neural networks,Vision,Classification

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要