Wisdom of (Binned) Crowds: A Bayesian Stratification Paradigm for Crowd Counting

• URL: http://arxiv.org/abs/2108.08784v1
• Date: Thu, 19 Aug 2021 16:50:31 GMT
• Title: Wisdom of (Binned) Crowds: A Bayesian Stratification Paradigm for Crowd Counting
• Authors: Sravya Vardhani Shivapuja, Mansi Pradeep Khamkar, Divij Bajaj, Ganesh Ramakrishnan, Ravi Kiran Sarvadevabhatla
• Abstract summary: 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.
• Score: 16.09823718637455
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Datasets for training crowd counting deep networks are typically heavy-tailed in count distribution and exhibit discontinuities across the count range. As a result, the de facto statistical measures (MSE, MAE) exhibit large variance and tend to be unreliable indicators of performance across the count range. To address these concerns in a holistic manner, we revise processes at various stages of the standard crowd counting pipeline. To enable principled and balanced minibatch sampling, we propose a novel smoothed Bayesian sample stratification approach. We propose a novel cost function which can be readily incorporated into existing crowd counting deep networks to encourage strata-aware optimization. We analyze the performance of representative crowd counting approaches across standard datasets at per strata level and in aggregate. We analyze the performance of crowd counting approaches across standard datasets and demonstrate that our proposed modifications noticeably reduce error standard deviation. Our contributions represent a nuanced, statistically balanced and fine-grained characterization of performance for crowd counting approaches. Code, pretrained models and interactive visualizations can be viewed at our project page https://deepcount.iiit.ac.in/

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)
• 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)
• Direct Measure Matching for Crowd Counting [59.66286603624411]
  We propose a new measure-based counting approach to regress the predicted density maps to the scattered point-annotated ground truth directly. In this paper, we derive a semi-balanced form of Sinkhorn divergence, based on which a Sinkhorn counting loss is designed for measure matching.
  arXiv  Detail & Related papers  (2021-07-04T06:37:33Z)
• PSCNet: Pyramidal Scale and Global Context Guided Network for Crowd Counting [44.306790250158954]
  This paper proposes a novel crowd counting approach based on pyramidal scale module (PSM) and global context module (GCM) PSM is used to adaptively capture multi-scale information, which can identify a fine boundary of crowds with different image scales. GCM is devised with low-complexity and lightweight manner, to make the interactive information across the channels of the feature maps more efficient.
  arXiv  Detail & Related papers  (2020-12-07T11:35:56Z)
• 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)
• JHU-CROWD++: Large-Scale Crowd Counting Dataset and A Benchmark Method [92.15895515035795]
  We introduce a new large scale unconstrained crowd counting dataset (JHU-CROWD++) that contains "4,372" images with "1.51 million" annotations. We propose a novel crowd counting network that progressively generates crowd density maps via residual error estimation.
  arXiv  Detail & Related papers  (2020-04-07T14:59:35Z)

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.