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 条
  • [21] Decentralized Data-Efficient Quickest Change Detection
    Banerjee, Taposh
    Veeravalli, Venugopal V.
    Tartakovsky, Alexander
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2587 - +
  • [22] Data-Efficient and Interpretable Tabular Anomaly Detection
    Chang, Chun-Hao
    Yoon, Jinsung
    Arik, Sercan O.
    Udell, Madeleine
    Pfister, Tomas
    PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023, 2023, : 190 - 201
  • [23] DATA-EFFICIENT MINIMAX QUICKEST CHANGE DETECTION
    Banerjee, Taposh
    Veeravalli, Venugopal V.
    2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2012, : 3937 - 3940
  • [24] Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery
    Zhang, Junhui
    Yan, Jingkai
    Wright, John
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021,
  • [25] Efficient Tuning-Free l1-Regression of Nonnegative Compressible Signals
    Petersen, Hendrik Bernd
    Bah, Bubacarr
    Jung, Peter
    FRONTIERS IN APPLIED MATHEMATICS AND STATISTICS, 2021, 7
  • [26] Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learning
    Thomas, Philip S.
    Brunskill, Emma
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 48, 2016, 48
  • [27] Robust and Tuning-Free Sparse Linear Regression via Square-Root Slope
    Minsker, Stanislav
    Ndaoud, Mohamed
    Wang, Lang
    SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2024, 6 (02): : 428 - 453
  • [28] Data-efficient learning of object-centric grasp preferences
    Fleytoux, Yoann
    Ma, Anji
    Ivaldi, Serena
    Mouret, Jean-Baptiste
    2022 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA 2022, 2022, : 6337 - 6343
  • [29] Data Augmentation for Object Detection: A Review
    Kaur, Parvinder
    Khehra, Baljit Singh
    Mavi, Er Bhupinder Singh
    2021 IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS (MWSCAS), 2021, : 537 - 543
  • [30] Efficient Data Augmentation Policy for Electrocardiograms
    Lee, Byeong Tak
    Jo, Yong-Yeon
    Lim, Seon-Yu
    Song, Youngjae
    Kwon, Joon-myoung
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 4153 - 4157