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 条
  • [41] Meta-tuning Loss Functions and Data Augmentation for Few-shot Object Detection
    Demirel, Berkan
    Baran, Orhun Bugra
    Cinbis, Ramazan Gokberk
    2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, CVPR, 2023, : 7339 - 7349
  • [42] Data-efficient Hindsight Off-policy Option Learning
    Wulfmeier, Markus
    Rao, Dushyant
    Hafner, Roland
    Lampe, Thomas
    Abdolmaleki, Abbas
    Hertweck, Tim
    Neunert, Michael
    Tirumala, Dhruva
    Siegel, Noah
    Heess, Nicolas
    Riedmiller, Martin
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [43] Data-Efficient Quickest Change Detection in Sensor Networks
    Banerjee, Taposh
    Veeravalli, Venugopal V.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (14) : 3727 - 3735
  • [44] Learning Data-Efficient Hierarchical Features for Robotic Graspable Object Recognition
    Wang, Zhichao
    Wang, Bin
    Guo, Chuangqiang
    Li, Zhiqi
    Liu, Yang
    Liu, Hong
    2017 IEEE INTERNATIONAL CONFERENCE ON ADVANCED INTELLIGENT MECHATRONICS (AIM), 2017, : 590 - 595
  • [45] Efficient Fine Tuning for Fashion Object Detection
    Ma, Benjiang
    Xu, Wenjin
    SENSORS, 2023, 23 (13)
  • [46] Perspective Transformation Data Augmentation for Object Detection
    Wang, Ke
    Fang, Bin
    Qian, Jiye
    Yang, Su
    Zhou, Xin
    Zhou, Jie
    IEEE ACCESS, 2020, 8 : 4935 - 4943
  • [47] Medical image segmentation data augmentation method based on channel weight and data-efficient features
    Wu X.
    Tao C.
    Li Z.
    Zhang J.
    Sun Q.
    Han X.
    Chen Y.
    Shengwu Yixue Gongchengxue Zazhi/Journal of Biomedical Engineering, 2024, 41 (02): : 220 - 227
  • [48] Object Detection in Artworks Using Data Augmentation
    Jeon, Hyeong-Ju
    Jung, Soonchul
    Choi, Yoon-Seok
    Kim, Jae Woo
    Kim, Jin Seo
    11TH INTERNATIONAL CONFERENCE ON ICT CONVERGENCE: DATA, NETWORK, AND AI IN THE AGE OF UNTACT (ICTC 2020), 2020, : 1312 - 1314
  • [49] ADA: Adversarial Data Augmentation for Object Detection
    Behpour, Sima
    Kitani, Kris M.
    Ziebart, Brian D.
    2019 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV), 2019, : 1243 - 1252
  • [50] Multiexpert Adversarial Regularization for Robust and Data-Efficient Deep Supervised Learning
    Gholami, Behnam
    Liu, Qingfeng
    El-Khamy, Mostafa
    Lee, Jungwon
    IEEE ACCESS, 2022, 10 : 85080 - 85094