Redesigning Multi-Scale Neural Network for Crowd Counting

TL;DR

This paper presents a novel hierarchical multi-scale neural network for crowd counting that effectively merges multi-scale density maps using density experts, pixel-wise gating, and a relative local counting loss, achieving state-of-the-art results.

Contribution

The work introduces a hierarchical mixture of density experts with pixel-wise soft gating and a relative local counting loss for improved crowd counting accuracy.

Findings

Achieves state-of-the-art performance on five public datasets.

Effectively handles perspective distortions and crowd variations.

Outperforms previous multi-scale methods in accuracy.

Abstract

Perspective distortions and crowd variations make crowd counting a challenging task in computer vision. To tackle it, many previous works have used multi-scale architecture in deep neural networks (DNNs). Multi-scale branches can be either directly merged (e.g. by concatenation) or merged through the guidance of proxies (e.g. attentions) in the DNNs. Despite their prevalence, these combination methods are not sophisticated enough to deal with the per-pixel performance discrepancy over multi-scale density maps. In this work, we redesign the multi-scale neural network by introducing 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; pixel-wise soft gating nets are introduced to provide pixel-wise soft weights for scale combinations in different hierarchies. The network is optimized using both the crowd density map and the local counting map, where the latter is obtained by local integration on the former. Optimizing both can be problematic because of their potential conflicts. We introduce a new relative local counting loss based on relative count differences among hard-predicted local regions in an image, which proves to be complementary to the conventional absolute error loss on the density map. Experiments show that our method achieves the state-of-the-art performance on five public datasets, i.e. ShanghaiTech, UCF_CC_50, JHU-CROWD++, NWPU-Crowd and Trancos.