Better Matching, Less Forgetting: A Quality-Guided Matcher for Transformer-based Incremental Object Detection
Authors: Qirui Wu, Shizhou Zhang, De Cheng, Yinghui Xing, Lingyan Ran, Dahu Shi, Peng Wang
Organizations: ASGO, School of Computer Science, Northwestern Polytechnical University, China · School of Telecommunications Engineering, Xidian University, China · CCAI, Zhejiang University, China · Hikrobot Co., Ltd.
Incremental Object Detection (IOD) aims to continuously learn new object classes without forgetting previously learned ones. A persistent challenge is catastrophic forgetting, primarily attributed to background shift in conventional detectors. While pseudo-labeling mitigates this in dense detectors, we identify a novel, distinct source of forgetting specific to DETR-like architectures: background foregrounding. This arises from the exhaustiveness constraint of the Hungarian matcher, which forcibly assigns every ground truth target to one prediction, even when predictions primarily cover background regions (i.e., low IoU). This erroneous supervision compels the model to misclassify background features as specific foreground classes, disrupting learned representations and accelerating forgetting. To address this, we propose a Quality-guided Min-Cost Max-Flow (Q-MCMF) matcher. To avoid forced assignments, Q-MCMF builds a flow graph and prunes implausible matches based on geometric quality. It then optimizes for the final matching that minimizes cost and maximizes valid assignments. This strategy eliminates harmful supervision from background foregrounding while maximizing foreground learning signals. Extensive experiments on the COCO dataset under various incremental settings demonstrate that our method consistently outperforms existing state-of-the-art approaches.
Figures & tables
Figure 1: Quantitative evidence and examples of background foregrounding:(a) shows the proportion of matches with IoU < IoU threshold of Base/New classes at the 40th epoch of 70-10 second phase. (b) shows two examples of background foregrounding.
Figure 2: Overall training pipeline of Deformable DETR with Q-MCMF matcher.
(1)
Methods
AP
AP 50
AP 75
AP S
AP M
AP L
40-40
LwF*
17.2
25.4
18.6
7.9
18.4
24.3
CL-DETR*
42.0
60.1
45.9
24.0
45.3
55.6
SDDGR*
43.0
62.1
47.1
24.9
46.9
57.0
DyQ-DETR*
42.4
60.5
45.9
23.9
46.3
56.7
RILOD
29.9
45.0
32.0
15.8
33.0
40.5
SID
34.0
51.4
36.3
18.4
38.4
44.9
Table 1: IOD results (%) on COCO 2017 under the 40-40 and 70-10 setting using protocol (1). * indicates results with exemplar replay. The best performance in each is presented in bold, and the second best is presented with underline.
(2)
Methods
AP
AP 50
AP 75
AP S
AP M
AP L
40-40
LwF*
23.9
41.5
25.0
12.0
26.4
33.0
CL-DETR*
37.5
55.1
40.3
20.9
40.8
50.7
DyQ-DETR*
39.7
57.5
43.0
21.6
42.9
53.8
iCaRL
33.4
52.0
36.0
18.0
36.4
45.5
ERD
36.0
55.2
38.7
19.5
38.7
49.0
CL-DETR
36.2
52.6
39.5
18.7
39.5
49.4
Table 2: IOD results (%) on COCO 2017 under the 40-40 and 70-10 setting using protocol (2). * indicates results with exemplar replay. The best performance in each is presented in bold, and the second best is presented with underline.
Methods
40\mbox−10×4
40\mbox−20×2
+40–50
+50–60
+60–70
+70–80
+40–60
+60–80
CF
5.8
5.7
6.3
3.3
10.7
9.4
RILOD
25.4
11.2
10.5
8.4
27.8
15.8
SID
34.6
24.1
14.6
12.6
34.0
23.8
ERD
36.4
30.8
26.2
20.7
36.7
32.4
CL-DETR*
–
–
–
28.1
–
35.3
Table 3: IOD results (%) on COCO 2017 under the 40\mbox−10×4 and 40\mbox−20×2 setting using protocol (1). * indicates the results are obtained with exemplar replay. The best performance in each is presented in bold, and the second best is presented with underline.
Figure 3: Effectiveness analysis of Q-MCMF Matcher.
Figure 4: Stability-Plasticity Balance with different α and β .
Figure 5: Effectiveness of Q-MCMF Matcher on DN-DETR and DAB-DETR under 70-10 setting.
Figure 6: t-SNE visualization of learned categories’ features after the second phase training of the 70-10 setting.
Figure 7: Zoomed in examples of matches. (a) shows examples of rejected match from base classes, (b) shows examples of rejected match from new classes, and (c) shows examples of accepted match.
Adapting Detection Transformers to Incremental Object Detection (IOD) poses a systemic challenge, as set-based optimization is inherently destabilized by sequential learning. In this work, we identify Gradient Dilution as the root cause of performance degradation, wherein optimization signals required to preserve old knowledge are progressively weakened. This phenomenon manifests as a cascading erosion of preservation gradients in magnitude, direction, and support coverage, driven by three tightly coupled factors: Signal Dispersion, where foreground gradients are overwhelmed by background noise; Assignment Drift, where stochastic query-target matching induces inconsistent gradient trajectories; and Support Attrition, where gradients from retained samples insufficiently cover the old-class feature space, weakening decision boundaries under interference from new classes. To counteract this, we propose FAS, a unified framework that Focuses, Aligns, and Sustains gradient flow throughout incremental learning. Specifically, we introduce prior-injected queries to focus discriminative signals by filtering background interference at the source. We further propose deterministic anchor distillation to align query-target assignments and enforce semantic consistency across stages under unstable matching. Finally, we devise manifold-support replay to sustain distributional support of old classes, counteracting representational erosion induced by continual updates. Extensive experiments show that FAS restores robust optimization dynamics and outperforms state-of-the-art methods, achieving over 5.0 AP improvement in the challenging 40+10x4 incremental setting.
Aoting Zhang, Dongbao Yang, Chang Liu +2
Institute of Information Engineering, Chinese Academy of Sciences · School of Cyber Security, University of Chinese Academy of Sciences · Nankai University +2
Incremental Object Detection (IOD) aims to continuously learn new object categories without forgetting previously learned ones. Recently, prompt-based methods have gained popularity for their replay-free design and parameter efficiency. However, due to prompt coupling and prompt drift, these methods often suffer from prompt degradation during continual adaptation. To address these issues, we propose a novel prompt-decoupled framework called PDP. PDP innovatively designs a dual-pool prompt decoupling paradigm, which consists of a shared pool used to capture task-general knowledge for forward transfer, and a private pool used to learn task-specific discriminative features. This paradigm explicitly separates task-general and task-specific prompts, preventing interference between prompts and mitigating prompt coupling. In addition, to counteract prompt drift resulting from inconsistent supervision where old foreground objects are treated as background in subsequent tasks, PDP introduces a Prototypical Pseudo-Label Generation (PPG) module. PPG can dynamically update the class prototype space during training and use the class prototypes to further filter valuable pseudo-labels, maintaining supervisory signal consistency throughout the incremental process. PDP achieves state-of-the-art performance on MS-COCO (with a 9.2% AP improvement) and PASCAL VOC (with a 3.3% AP improvement) benchmarks, highlighting its potential in balancing stability and plasticity. The code and dataset are released at: https://github.com/zyt95579/PDP\_IOD/tree/main
Incremental 3D object detection requires a detector to learn novel object classes while remembering previously learned ones over sequentially arriving data. Previous methods, primarily based on pseudo-labeling, perform reasonably in short-incremental stages but still suffer from severe model forgetting when dealing with long-incremental sequences. We investigate this failure and reveal a detrimental self-reinforcing cycle: data distribution shift of novel classes causes model forgetting on old classes, which further produces accumulated error in pseudo-labeling that exacerbates model degradation. To address this issue, we draw inspiration from the human learning process and propose the Learning-Dynamics-driven Memory and Review (LDMR) framework. LDMR monitors per-class detection quality at periodic training checkpoints and uses these learning-dynamics signals to drive two innovative mechanisms, namely (i) human-like intra-stage review that divides each incremental stage into multiple sub-stages' training and concentrates on remembering the most-forgotten objects, and (ii) scene-aware cross-stage memory evolution that evolves a memory bank to transfer knowledge between two consecutive stages by jointly considering scene learnability and diversity. Extensive experiments across multiple long-incremental protocols on indoor benchmarks SUN RGB-D and ScanNetV2 show that LDMR substantially mitigates the model forgetting and outperforms all baselines by a clear margin. Code is available at https://github.com/qianpeisheng/LDMR.
Peisheng Qian, Jie Xu, Xulei Yang +1
Singapore University of Technology and Design · Institute for Infocomm Research, A*STAR, Singapore