Exploring Scale Shift in Crowd Localization under the Context of Domain Generalization
Juncheng Wang, Lei Shang, Ziqi Liu, Wang Lu, Xixu Hu, Zhe Hu, Jindong Wang, Shujun Wang
TL;DR
This work investigates how head-scale distribution shifts hinder crowd localization under domain generalization, introducing ScaleBench to quantify scale-shift effects and Catto to mitigate them. ScaleBench uses patch-level, scale-aware domain partitions and reproduces 20 DG methods, revealing that many DG approaches struggle with scale shifts in dense crowds. The authors formalize scale shift as a mixed diversity and correlation domain shift and prove its impact via Theorem SSAD, then propose Catto to disentangle semantic and scale features with semantic hooks, scale-elimination via image interpolation, and invariant learning. Empirical results show Catto achieving state-of-the-art DG performance on ScaleBench and yield four practical insights for future scale-shift research in crowd localization and beyond.
Abstract
Crowd localization plays a crucial role in visual scene understanding towards predicting each pedestrian location in a crowd, thus being applicable to various downstream tasks. However, existing approaches suffer from significant performance degradation due to discrepancies in head scale distributions (scale shift) between training and testing data, a challenge known as domain generalization (DG). This paper aims to comprehend the nature of scale shift within the context of domain generalization for crowd localization models. To this end, we address four critical questions: (i) How does scale shift influence crowd localization in a DG scenario? (ii) How can we quantify this influence? (iii) What causes this influence? (iv) How to mitigate the influence? Initially, we conduct a systematic examination of how crowd localization performance varies with different levels of scale shift. Then, we establish a benchmark, ScaleBench, and reproduce 20 advanced DG algorithms to quantify the influence. Through extensive experiments, we demonstrate the limitations of existing algorithms and underscore the importance and complexity of scale shift, a topic that remains insufficiently explored. To deepen our understanding, we provide a rigorous theoretical analysis on scale shift. Building on these insights, we further propose an effective algorithm called Causal Feature Decomposition and Anisotropic Processing (Catto) to mitigate the influence of scale shift in DG settings. Later, we also provide extensive analytical experiments, revealing four significant insights for future research. Our results emphasize the importance of this novel and applicable research direction, which we term Scale Shift Domain Generalization.
