# Mask-aware networks for crowd counting

arXiv: https://arxiv.org/abs/1901.00039 · HTML: https://mlsanity.com/paper/1901.00039/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Dec 2018.

## Built on by (most cited first, 6 of 6)

- [Forget Less, Count Better: A Domain-Incremental Self-Distillation Learning Benchmark for Lifelong Crowd Counting](https://mlsanity.com/paper/2205.03307/) (2022)
- [Counting Varying Density Crowds Through Density Guided Adaptive Selection CNN and Transformer Estimation](https://mlsanity.com/paper/2206.10075/) (2022)
- [Semi-Supervised Crowd Counting with Contextual Modeling: Facilitating Holistic Understanding of Crowd Scenes](https://mlsanity.com/paper/2310.10352/) (2023)
- [Scale-Aware Network with Regional and Semantic Attentions for Crowd Counting under Cluttered Background](https://mlsanity.com/paper/2101.01479/) (2021)
- [A Unified Object Counting Network with Object Occupation Prior](https://mlsanity.com/paper/2212.14193/) (2022)
- [Dense Point-to-Mask Optimization with Reinforced Point Selection for Crowd Instance Segmentation](https://mlsanity.com/paper/2604.01742/) (2026)

## Abstract (arXiv)

Crowd counting problem aims to count the number of objects within an image or a frame in the videos and is usually solved by estimating the density map generated from the object location annotations. The values in the density map, by nature, take two possible states: zero indicating no object around, a non-zero value indicating the existence of objects and the value denoting the local object density. In contrast to traditional methods which do not differentiate the density prediction of these two states, we propose to use a dedicated network branch to predict the object/non-object mask and then combine its prediction with the input image to produce the density map. Our rationale is that the mask prediction could be better modeled as a binary segmentation problem and the difficulty of estimating the density could be reduced if the mask is known. A key to the proposed scheme is the strategy of incorporating the mask prediction into the density map estimator. To this end, we study five possible solutions, and via analysis and experimental validation we identify the most effective one. Through extensive experiments on five public datasets, we demonstrate the superior performance of the proposed approach over the baselines and show that our network could achieve the state-of-the-art performance.
