A Strong Baseline for Crowd Counting and Unsupervised People Localization

• URL: http://arxiv.org/abs/2011.03725v1
• Date: Sat, 7 Nov 2020 08:29:03 GMT
• Title: A Strong Baseline for Crowd Counting and Unsupervised People Localization
• Authors: Liangzi Rong, Chunping Li
• Abstract summary: We explore a strong baseline for crowd counting and an unsupervised people localization algorithm based on estimated density maps. We collect different backbones and training tricks and evaluate the impact of changing them. We propose a clustering algorithm named isolated KMeans to locate the heads in density maps.
• Score: 2.690502103971799
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we explore a strong baseline for crowd counting and an unsupervised people localization algorithm based on estimated density maps. Firstly, existing methods achieve state-of-the-art performance based on different backbones and kinds of training tricks. We collect different backbones and training tricks and evaluate the impact of changing them and develop an efficient pipeline for crowd counting, which decreases MAE and RMSE significantly on multiple datasets. We also propose a clustering algorithm named isolated KMeans to locate the heads in density maps. This method can divide the density maps into subregions and find the centers under local count constraints without training any parameter and can be integrated with existing methods easily.

Related papers

• $CrowdDiff$: Multi-hypothesis Crowd Density Estimation using Diffusion Models [26.55769846846542]
  Crowd counting is a fundamental problem in crowd analysis which is typically accomplished by estimating a crowd density map and summing over the density values. We present $CrowdDiff$ that generates the crowd density map as a reverse diffusion process. In addition, owing to the nature of the diffusion model, we introduce producing multiple density maps to improve the counting performance.
  arXiv  Detail & Related papers  (2023-03-22T17:58:01Z)
• Semi-supervised Crowd Counting via Density Agency [57.3635501421658]
  We build a learnable auxiliary structure, namely the density agency to bring the recognized foreground regional features close to corresponding density sub-classes. Second, we propose a density-guided contrastive learning loss to consolidate the backbone feature extractor. Third, we build a regression head by using a transformer structure to refine the foreground features further.
  arXiv  Detail & Related papers  (2022-09-07T06:34:00Z)
• Redesigning Multi-Scale Neural Network for Crowd Counting [68.674652984003]
  We introduce a hierarchical mixture of density experts, which hierarchically merges multi-scale density maps for crowd counting. Within the hierarchical structure, an expert competition and collaboration scheme is presented to encourage contributions from all scales. Experiments show that our method achieves the state-of-the-art performance on five public datasets.
  arXiv  Detail & Related papers  (2022-08-04T21:49:29Z)
• PANet: Perspective-Aware Network with Dynamic Receptive Fields and Self-Distilling Supervision for Crowd Counting [63.84828478688975]
  We propose a novel perspective-aware approach called PANet to address the perspective problem. Based on the observation that the size of the objects varies greatly in one image due to the perspective effect, we propose the dynamic receptive fields (DRF) framework. The framework is able to adjust the receptive field by the dilated convolution parameters according to the input image, which helps the model to extract more discriminative features for each local region.
  arXiv  Detail & Related papers  (2021-10-31T04:43:05Z)
• Cascaded Residual Density Network for Crowd Counting [63.714719914701014]
  We propose a novel Cascaded Residual Density Network (CRDNet) in a coarse-to-fine approach to generate the high-quality density map for crowd counting more accurately. A novel additional local count loss is presented to refine the accuracy of crowd counting.
  arXiv  Detail & Related papers  (2021-07-29T03:07:11Z)
• Reciprocal Distance Transform Maps for Crowd Counting and People Localization in Dense Crowd [16.224760698133462]
  We propose a novel Reciprocal Distance Transform (R-DT) map for crowd counting. Compared with the density maps, the R-DT maps accurately describe the people location, without overlap between nearby heads in dense regions. We simultaneously implement crowd counting and people localization with a simple network by replacing density maps with R-DT maps.
  arXiv  Detail & Related papers  (2021-02-16T02:25:55Z)
• Learning Independent Instance Maps for Crowd Localization [44.6430092887941]
  We propose an end-to-end and straightforward framework for crowd localization, named Independent Instance Map segmentation (IIM) IIM segment crowds into independent connected components, the positions and the crowd counts are obtained. To improve the segmentation quality for different density regions, we present a differentiable Binarization Module (BM) BM brings two advantages into localization models: 1) adaptively learn a threshold map for different images to detect each instance more accurately; 2) directly train the model using loss on binary predictions and labels.
  arXiv  Detail & Related papers  (2020-12-08T02:17:19Z)
• 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)
• Recurrent Distillation based Crowd Counting [23.4315417286694]
  We propose a simple yet effective crowd counting framework that is able to achieve the state-of-the-art performance on various crowded scenes. In experiments, we demonstrate that, with our simple convolutional neural network architecture strengthened by our proposed training algorithm, our model is able to outperform or be comparable with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-06-14T01:04:52Z)
• Towards Using Count-level Weak Supervision for Crowd Counting [55.58468947486247]
  This paper studies the problem of weakly-supervised crowd counting which learns a model from only a small amount of location-level annotations (fully-supervised) but a large amount of count-level annotations (weakly-supervised) We devise a simple-yet-effective training strategy, namely Multiple Auxiliary Tasks Training (MATT), to construct regularizes for restricting the freedom of the generated density maps.
  arXiv  Detail & Related papers  (2020-02-29T02:58:36Z)

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.