Reciprocal Distance Transform Maps for Crowd Counting and People Localization in Dense Crowd

• URL: http://arxiv.org/abs/2102.07925v1
• Date: Tue, 16 Feb 2021 02:25:55 GMT
• Title: Reciprocal Distance Transform Maps for Crowd Counting and People Localization in Dense Crowd
• Authors: Dingkang Liang, Wei Xu, Yingying Zhu, Yu Zhou
• Abstract summary: 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.
• Score: 16.224760698133462
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we propose a novel map for dense crowd counting and people localization. Most crowd counting methods utilize convolution neural networks (CNN) to regress a density map, achieving significant progress recently. However, these regression-based methods are often unable to provide a precise location for each people, attributed to two crucial reasons: 1) the density map consists of a series of blurry Gaussian blobs, 2) severe overlaps exist in the dense region of the density map. To tackle this issue, 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. Extensive experiments demonstrate that the proposed method outperforms state-of-the-art localization-based methods in crowd counting and people localization tasks, achieving very competitive performance compared with the regression-based methods in counting tasks. In addition, the proposed method achieves a good generalization performance under cross dataset validation, which further verifies the effectiveness of the R-DT map. The code and models are available at https://github.com/dk-liang/RDTM.

Related papers

• Diffusion-based Data Augmentation for Object Counting Problems [62.63346162144445]
  We develop a pipeline that utilizes a diffusion model to generate extensive training data. We are the first to generate images conditioned on a location dot map with a diffusion model. Our proposed counting loss for the diffusion model effectively minimizes the discrepancies between the location dot map and the crowd images generated.
  arXiv  Detail & Related papers  (2024-01-25T07:28:22Z)
• $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)
• 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)
• Rethinking Spatial Invariance of Convolutional Networks for Object Counting [119.83017534355842]
  We try to use locally connected Gaussian kernels to replace the original convolution filter to estimate the spatial position in the density map. Inspired by previous work, we propose a low-rank approximation accompanied with translation invariance to favorably implement the approximation of massive Gaussian convolution. Our methods significantly outperform other state-of-the-art methods and achieve promising learning of the spatial position of objects.
  arXiv  Detail & Related papers  (2022-06-10T17:51:25Z)
• LDC-Net: A Unified Framework for Localization, Detection and Counting in Dense Crowds [103.8635206945196]
  The rapid development in visual crowd analysis shows a trend to count people by positioning or even detecting, rather than simply summing a density map. Some recent work on crowd localization and detection has two limitations: 1) The typical detection methods can not handle the dense crowds and a large variation in scale; 2) The density map methods suffer from performance deficiency in position and box prediction, especially in high density or large-size crowds.
  arXiv  Detail & Related papers  (2021-10-10T07:55:44Z)
• 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)
• A Strong Baseline for Crowd Counting and Unsupervised People Localization [2.690502103971799]
  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.
  arXiv  Detail & Related papers  (2020-11-07T08:29:03Z)
• Adaptive Mixture Regression Network with Local Counting Map for Crowd Counting [16.816382549827214]
  We introduce a new target, named local counting map (LCM), to obtain more accurate results than density map based approaches. We also propose an adaptive mixture regression framework with three modules in a coarse-to-fine manner to further improve the precision of the crowd estimation.
  arXiv  Detail & Related papers  (2020-05-12T13:54:05Z)
• 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.