mlsanityData to 13 Oct 2026

Bi-level Alignment for Cross-Domain Crowd Counting

arXiv 2205.05844 ↗First posted 12 May 2022cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

Recently, crowd density estimation has received increasing attention. The main challenge for this task is to achieve high-quality manual annotations on a large amount of training data. To avoid reliance on such annotations, previous works apply unsupervised domain adaptation (UDA) techniques by transferring knowledge learned from easily accessible synthetic data to real-world datasets. However, current state-of-the-art methods either rely on external data for training an auxiliary task or apply an expensive coarse-to-fine estimation. In this work, we aim to develop a new adversarial learning based method, which is simple and efficient to apply. To reduce the domain gap between the synthetic and real data, we design a bi-level alignment framework (BLA) consisting of (1) task-driven data alignment and (2) fine-grained feature alignment. In contrast to previous domain augmentation methods, we introduce AutoML to search for an optimal transform on source, which well serves for the downstream task. On the other hand, we do fine-grained alignment for foreground and background separately to alleviate the alignment difficulty. We evaluate our approach on five real-world crowd counting benchmarks, where we outperform existing approaches by a large margin. Also, our approach is simple, easy to implement and efficient to apply. The code is publicly available at https://github.com/Yankeegsj/BLA.

Key facts. Cited by 8 papers in the map (data through 13 Oct 2026). Builds on 25 of its 34 references that are in the map. First posted on arXiv 12 May 2022.

Builds on

25 of 34 references.

References · 25

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,321
  2. 2017Arbitrary Style Transfer in Real-time with Adaptive Instance Normalizationcited by 2,005
  3. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,909
  4. 2017Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real Worldcited by 1,411
  5. 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,079
  6. 2020FDA: Fourier Domain Adaptation for Semantic Segmentationcited by 540
  7. 2017Progressive Neural Architecture Searchcited by 485
  8. 2021A Fourier-based Framework for Domain Generalizationcited by 288
  9. 2018CSRNet: Dilated Convolutional Neural Networks for Understanding the Highly Congested Scenescited by 267
  10. 2019Domain Randomization and Pyramid Consistency: Simulation-to-Real Generalization without Accessing Target Domain Datacited by 245
  11. 2018Composition Loss for Counting, Density Map Estimation and Localization in Dense Crowdscited by 186
  12. 2018Neural Architecture Optimizationcited by 164
13 more
  1. 2021FSDR: Frequency Space Domain Randomization for Domain Generalizationcited by 163
  2. 2019Learning from Synthetic Data for Crowd Counting in the Wildcited by 148
  3. 2019AutoGAN: Neural Architecture Search for Generative Adversarial Networkscited by 94
  4. 2021LightTrack: Finding Lightweight Neural Networks for Object Tracking via One-Shot Architecture Searchcited by 82
  5. 2020NAS-Count: Counting-by-Density with Neural Architecture Searchcited by 36
  6. 2019PCC Net: Perspective Crowd Counting via Spatial Convolutional Networkcited by 33
  7. 2020Learning to Count in the Crowd from Limited Labeled Datacited by 27
  8. 2020Pixel-wise Crowd Understanding via Synthetic Datacited by 23
  9. 2020Focus on Semantic Consistency for Cross-domain Crowd Understandingcited by 16
  10. 2021One-Shot Neural Ensemble Architecture Search by Diversity-Guided Search Space Shrinkingcited by 12
  11. 2019CODA: Counting Objects via Scale-aware Adversarial Density Adaptioncited by 10
  12. 2020AutoHAS: Efficient Hyperparameter and Architecture Searchcited by 8
  13. 2019Inverse Attention Guided Deep Crowd Counting Networkcited by 3

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 4; 2026: 1.

8 papers.