Bridge Past and Future: Overcoming Information Asymmetry in Incremental Object Detection
Qijie Mo, Yipeng Gao, Shenghao Fu, Junkai Yan, Ancong Wu, Wei-Shi Zheng
TL;DR
This work tackles information asymmetry in incremental object detection (IOD), where images can contain objects from past, present, and future categories, causing forgetting and inconsistent learning. It introduces Bridge Past and Future (BPF) to align supervision across stages by leveraging pseudo labels from the past and by excluding probable future objects from negative samples, and Distillation with Future (DwF) which uses two teachers (the old model and an intermediate current-model expert) to distill knowledge across all categories in a class-aware manner. The approach is evaluated in memory-free settings on PASCAL VOC and MS COCO, where BPF + DwF outperforms state-of-the-art methods across multiple single- and multi-step incremental scenarios, with significant gains on old-class detection and competitive gains on new-class learning. The results demonstrate the practical impact of incorporating future and past information into the training loop, enabling more robust continual adaptation for object detection without storing historical data. All mathematical expressions related to the method are presented within $...$ delimiters to preserve precision.
Abstract
In incremental object detection, knowledge distillation has been proven to be an effective way to alleviate catastrophic forgetting. However, previous works focused on preserving the knowledge of old models, ignoring that images could simultaneously contain categories from past, present, and future stages. The co-occurrence of objects makes the optimization objectives inconsistent across different stages since the definition for foreground objects differs across various stages, which limits the model's performance greatly. To overcome this problem, we propose a method called ``Bridge Past and Future'' (BPF), which aligns models across stages, ensuring consistent optimization directions. In addition, we propose a novel Distillation with Future (DwF) loss, fully leveraging the background probability to mitigate the forgetting of old classes while ensuring a high level of adaptability in learning new classes. Extensive experiments are conducted on both Pascal VOC and MS COCO benchmarks. Without memory, BPF outperforms current state-of-the-art methods under various settings. The code is available at https://github.com/iSEE-Laboratory/BPF.
