ProgRoCC: A Progressive Approach to Rough Crowd Counting

• URL: http://arxiv.org/abs/2504.13405v1
• Date: Fri, 18 Apr 2025 01:57:42 GMT
• Title: ProgRoCC: A Progressive Approach to Rough Crowd Counting
• Authors: Shengqin Jiang, Linfei Li, Haokui Zhang, Qingshan Liu, Amin Beheshti, Jian Yang, Anton van den Hengel, Quan Z. Sheng, Yuankai Qi,
• Abstract summary: We label Rough Crowd Counting that delivers better accuracy on the basis of training data that is easier to acquire.<n>We propose an approach to the rough crowd counting problem based on CLIP, termed ProgRoCC.<n>Specifically, we introduce a progressive estimation learning strategy that determines the object count through a coarse-to-fine approach.
• Score: 66.09510514180593
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As the number of individuals in a crowd grows, enumeration-based techniques become increasingly infeasible and their estimates increasingly unreliable. We propose instead an estimation-based version of the problem: we label Rough Crowd Counting that delivers better accuracy on the basis of training data that is easier to acquire. Rough crowd counting requires only rough annotations of the number of targets in an image, instead of the more traditional, and far more expensive, per-target annotations. We propose an approach to the rough crowd counting problem based on CLIP, termed ProgRoCC. Specifically, we introduce a progressive estimation learning strategy that determines the object count through a coarse-to-fine approach. This approach delivers answers quickly, outperforms the state-of-the-art in semi- and weakly-supervised crowd counting. In addition, we design a vision-language matching adapter that optimizes key-value pairs by mining effective matches of two modalities to refine the visual features, thereby improving the final performance. Extensive experimental results on three widely adopted crowd counting datasets demonstrate the effectiveness of our method.

Related papers

• Robust Zero-Shot Crowd Counting and Localization With Adaptive Resolution SAM [55.93697196726016]
  We propose a simple yet effective crowd counting method by utilizing the Segment-Everything-Everywhere Model (SEEM) We show that SEEM's performance in dense crowd scenes is limited, primarily due to the omission of many persons in high-density areas. Our proposed method achieves the best unsupervised performance in crowd counting, while also being comparable to some supervised methods.
  arXiv  Detail & Related papers  (2024-02-27T13:55:17Z)
• CrowdCLIP: Unsupervised Crowd Counting via Vision-Language Model [60.30099369475092]
  Supervised crowd counting relies heavily on costly manual labeling. We propose a novel unsupervised framework for crowd counting, named CrowdCLIP. CrowdCLIP achieves superior performance compared to previous unsupervised state-of-the-art counting methods.
  arXiv  Detail & Related papers  (2023-04-09T12:56:54Z)
• Counting in the 2020s: Binned Representations and Inclusive Performance Measures for Deep Crowd Counting Approaches [21.595568866609067]
  We modify the training pipeline to accommodate the knowledge of dataset skew. We propose a novel smoothed Bayesian binning approach to enable principled and balanced minibatch sampling. We introduce additional performance measures which are more inclusive and throw light on various comparative performance aspects of the deep networks.
  arXiv  Detail & Related papers  (2022-04-10T11:02:13Z)
• Wisdom of (Binned) Crowds: A Bayesian Stratification Paradigm for Crowd Counting [16.09823718637455]
  We analyze the performance of crowd counting approaches across standard datasets at per strata level and in aggregate. Our contributions represent a nuanced, statistically balanced and fine-grained characterization of performance for crowd counting approaches.
  arXiv  Detail & Related papers  (2021-08-19T16:50:31Z)
• Completely Self-Supervised Crowd Counting via Distribution Matching [92.09218454377395]
  We propose a complete self-supervision approach to training models for dense crowd counting. The only input required to train, apart from a large set of unlabeled crowd images, is the approximate upper limit of the crowd count. Our method dwells on the idea that natural crowds follow a power law distribution, which could be leveraged to yield error signals for backpropagation.
  arXiv  Detail & Related papers  (2020-09-14T13:20:12Z)
• Semi-Supervised Crowd Counting via Self-Training on Surrogate Tasks [50.78037828213118]
  This paper tackles the semi-supervised crowd counting problem from the perspective of feature learning. We propose a novel semi-supervised crowd counting method which is built upon two innovative components.
  arXiv  Detail & Related papers  (2020-07-07T05:30:53Z)
• Learning to Count in the Crowd from Limited Labeled Data [109.2954525909007]
  We focus on reducing the annotation efforts by learning to count in the crowd from limited number of labeled samples. Specifically, we propose a Gaussian Process-based iterative learning mechanism that involves estimation of pseudo-ground truth for the unlabeled data.
  arXiv  Detail & Related papers  (2020-07-07T04:17:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.