CrowdMAC: Masked Crowd Density Completion for Robust Crowd Density Forecasting

• URL: http://arxiv.org/abs/2407.14725v2
• Date: Tue, 26 Nov 2024 11:36:34 GMT
• Title: CrowdMAC: Masked Crowd Density Completion for Robust Crowd Density Forecasting
• Authors: Ryo Fujii, Ryo Hachiuma, Hideo Saito,
• Abstract summary: A crowd density forecasting task aims to predict how the crowd density map will change in the future from observed past crowd density maps. Past crowd density maps are often incomplete due to the miss-detection of pedestrians. This paper presents a MAsked crowd density Completion framework for crowd density forecasting (CrowdMAC) CrowdMAC is simultaneously trained to forecast future crowd density maps from partially masked past crowd density maps.
• Score: 10.332817296500533
• License:
• Abstract: A crowd density forecasting task aims to predict how the crowd density map will change in the future from observed past crowd density maps. However, the past crowd density maps are often incomplete due to the miss-detection of pedestrians, and it is crucial to develop a robust crowd density forecasting model against the miss-detection. This paper presents a MAsked crowd density Completion framework for crowd density forecasting (CrowdMAC), which is simultaneously trained to forecast future crowd density maps from partially masked past crowd density maps (i.e., forecasting maps from past maps with miss-detection) while reconstructing the masked observation maps (i.e., imputing past maps with miss-detection). Additionally, we propose Temporal-Density-aware Masking (TDM), which non-uniformly masks tokens in the observed crowd density map, considering the sparsity of the crowd density maps and the informativeness of the subsequent frames for the forecasting task. Moreover, we introduce multi-task masking to enhance training efficiency. In the experiments, CrowdMAC achieves state-of-the-art performance on seven large-scale datasets, including SDD, ETH-UCY, inD, JRDB, VSCrowd, FDST, and croHD. We also demonstrate the robustness of the proposed method against both synthetic and realistic miss-detections.

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)
• HDNet: A Hierarchically Decoupled Network for Crowd Counting [11.530565995318696]
  We propose a Hierarchically Decoupled Network (HDNet) to solve the above two problems within a unified framework. HDNet achieves state-of-the-art performance on several popular counting benchmarks.
  arXiv  Detail & Related papers  (2022-12-12T06:01:26Z)
• 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)
• 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)
• Coarse- and Fine-grained Attention Network with Background-aware Loss for Crowd Density Map Estimation [2.690502103971799]
  CFANet is a novel method for generating high-quality crowd density maps and people count estimation. We devise a from-coarse-to-fine progressive attention mechanism by integrating Crowd Region Recognizer (CRR) and Density Level Estimator (DLE) branch. Our method can not only outperform previous state-of-the-art methods in terms of count accuracy but also improve the image quality of density maps as well as reduce the false recognition ratio.
  arXiv  Detail & Related papers  (2020-11-07T08:05:54Z)
• Tracking-by-Counting: Using Network Flows on Crowd Density Maps for Tracking Multiple Targets [96.98888948518815]
  State-of-the-art multi-object tracking(MOT) methods follow the tracking-by-detection paradigm. We propose a new MOT paradigm, tracking-by-counting, tailored for crowded scenes.
  arXiv  Detail & Related papers  (2020-07-18T19:51:53Z)
• 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)
• PDANet: Pyramid Density-aware Attention Net for Accurate Crowd Counting [7.02081613648832]
  Crowd counting remains an open real-world problem due to the vast scale variations in crowd density within the interested area. We propose a novel Pyramid Density-Aware Attention-based network, abbreviated as PDANet, that leverages the attention, pyramid scale feature and two branch decoder modules for density-aware crowd counting.
  arXiv  Detail & Related papers  (2020-01-16T04:26:05Z)

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.