mlsanityData to 14 Oct 2026

Coarse to Fine: Domain Adaptive Crowd Counting via Adversarial Scoring Network

arXiv 2107.12858 ↗First posted 27 Jul 2021cs.CV cs.MMcited by 10

Not on the map. Why?

Abstract (arXiv)

Recent deep networks have convincingly demonstrated high capability in crowd counting, which is a critical task attracting widespread attention due to its various industrial applications. Despite such progress, trained data-dependent models usually can not generalize well to unseen scenarios because of the inherent domain shift. To facilitate this issue, this paper proposes a novel adversarial scoring network (ASNet) to gradually bridge the gap across domains from coarse to fine granularity. In specific, at the coarse-grained stage, we design a dual-discriminator strategy to adapt source domain to be close to the targets from the perspectives of both global and local feature space via adversarial learning. The distributions between two domains can thus be aligned roughly. At the fine-grained stage, we explore the transferability of source characteristics by scoring how similar the source samples are to target ones from multiple levels based on generative probability derived from coarse stage. Guided by these hierarchical scores, the transferable source features are properly selected to enhance the knowledge transfer during the adaptation process. With the coarse-to-fine design, the generalization bottleneck induced from the domain discrepancy can be effectively alleviated. Three sets of migration experiments show that the proposed methods achieve state-of-the-art counting performance compared with major unsupervised methods.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 24 of its 55 references that are in the map. First posted on arXiv 27 Jul 2021.

Builds on

24 of 55 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  4. 2018CSRNet: Dilated Convolutional Neural Networks for Understanding the Highly Congested Scenescited by 267
  5. 2018Composition Loss for Counting, Density Map Estimation and Localization in Dense Crowdscited by 186
  6. 2018Context-Aware Crowd Countingcited by 150
  7. 2019Learning from Synthetic Data for Crowd Counting in the Wildcited by 148
  8. 2020Distribution Matching for Crowd Countingcited by 143
  9. 2017Switching Convolutional Neural Network for Crowd Countingcited by 93
  10. 2020Localization in the Crowd with Topological Constraintscited by 68
  11. 2017Generating High-Quality Crowd Density Maps using Contextual Pyramid CNNscited by 55
  12. 2018Where are the Blobs: Counting by Localization with Point Supervisioncited by 54
12 more
  1. 2020Cross-Modal Collaborative Representation Learning and a Large-Scale RGBT Benchmark for Crowd Countingcited by 52
  2. 2019Crowd Counting with Deep Structured Scale Integration Networkcited by 46
  3. 2018Domain Adaptation through Synthesis for Unsupervised Person Re-identificationcited by 44
  4. 2017Spatiotemporal Modeling for Crowd Counting in Videoscited by 27
  5. 2021Leveraging Self-Supervision for Cross-Domain Crowd Countingcited by 24
  6. 2020Pixel-wise Crowd Understanding via Synthetic Datacited by 23
  7. 2018Divide and Grow: Capturing Huge Diversity in Crowd Images with Incrementally Growing CNNcited by 19
  8. 2020Focus on Semantic Consistency for Cross-domain Crowd Understandingcited by 16
  9. 2017Beyond Counting: Comparisons of Density Maps for Crowd Analysis Tasks - Counting, Detection, and Trackingcited by 15
  10. 2019CODA: Counting Objects via Scale-aware Adversarial Density Adaptioncited by 10
  11. 2018An Aggregated Multicolumn Dilated Convolution Network for Perspective-Free Countingcited by 5
  12. 2019Feature-aware Adaptation and Density Alignment for Crowd Counting in Video Surveillancecited by 2

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 4; 2023: 3; 2024: 2.

10 papers.