InterAug: A Tuning-Free Augmentation Policy for Data-Efficient and Robust Object Detection

被引:0
|
作者
Thopalli, Kowshik [1 ]
Devi, S. [2 ]
Thiagarajan, Jayaraman J. [1 ]
机构
[1] Lawrence Livermore Natl Lab, Livermore, CA 94550 USA
[2] SRM Inst Sci & Technol, Chennai, Tamil Nadu, India
关键词
D O I
10.1109/ICCVW60793.2023.00033
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The recent progress in developing pre-trained models, trained on large-scale datasets, has highlighted the need for robust protocols to effectively adapt them to domain-specific data, especially when there is a limited amount of available data. Data augmentations can play a critical role in enabling data-efficient fine-tuning of pre-trained object detection models. Choosing the right augmentation policy for a given dataset is challenging and relies on knowledge about task-relevant invariances. In this work, we focus on an understudied aspect of this problem - can bounding box annotations be used to design more effective augmentation policies? Through InterAug, we make a critical finding that, we can leverage the annotations to infer the effective context for each object in a scene, as opposed to manipulating the entire scene or only within the prespecified bounding boxes. Using a rigorous empirical study with multiple benchmarks and architectures, we demonstrate the efficacy of InterAug in improving robustness and handling data scarcity. Finally, InterAug can be used with any off-the-shelf policy, does not require any modification to the architecture, and significantly outperforms existing protocols. Our codes can be found at https: //github.com/kowshikthopalli/InterAug.
引用
收藏
页码:253 / 261
页数:9
相关论文
共 50 条
  • [1] TrivialAugment: Tuning-free Yet State-of-the-Art Data Augmentation
    Mueller, Samuel G.
    Hutter, Frank
    2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021), 2021, : 754 - 762
  • [2] Robust convex biclustering with a tuning-free method
    Chen, Yifan
    Lei, Chunyin
    Li, Chuanquan
    Ma, Haiqiang
    Hu, Ningyuan
    JOURNAL OF APPLIED STATISTICS, 2024,
  • [3] Rejoinder to "A Tuning-Free Robust and Efficient Approach to High-Dimensional Regression"
    Wang, Lan
    Peng, Bo
    Bradic, Jelena
    Li, Runze
    Wu, Yunan
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2020, 115 (532) : 1726 - 1729
  • [4] Discussion of "A Tuning-Free Robust and Efficient Approach to High-Dimensional Regression"
    Li, Xiudi
    Shojaie, Ali
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2020, 115 (532) : 1717 - 1719
  • [5] Comment on "A Tuning-Free Robust and Efficient Approach to High-Dimensional Regression"
    Loh, Po-Ling
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2020, 115 (532) : 1715 - 1716
  • [6] Robust On-Policy Sampling for Data-Efficient Policy Evaluation in Reinforcement Learning
    Zhong, Rujie
    Zhang, Duohan
    Schafer, Lukas
    Albrecht, Stefano V.
    Hanna, Josiah P.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [7] Reinforcement Learning for Efficient and Tuning-Free Link Adaptation
    Saxena, Vidit
    Tullberg, Hugo
    Jalden, Joakim
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (02) : 768 - 780
  • [8] Data-Efficient Augmentation for Training Neural Networks
    Liu, Tian Yu
    Mirzasoleiman, Baharan
    Advances in Neural Information Processing Systems, 2022, 35
  • [9] Data-Efficient Augmentation for Training Neural Networks
    Liu, Tian Yu
    Mirzasoleiman, Baharan
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [10] Data-Efficient Process Monitoring and Failure Detection for Robust Robotic Screwdriving
    Cheng, Xianyi
    Jia, Zhenzhong
    Mason, Matthew T.
    2019 IEEE 15TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2019, : 1705 - 1711