Abstract

Crowd counting is a task of intelligent applications, and its operation efficiency is very important. However, in order to obtain a better counting performance, most of the existing works often design larger and more complex network structures, which will result in them occupying considerable memory, time and other resources at runtime, seriously limiting their deployment scope and making it difficult to be widely used in practical scenarios. In this paper, in order to overcome the above problems, we propose an effective lightweight encoding-decoding crowd counting network, named Lw-Count. Specifically, in the encoding process, we design an efficient and lightweight convolution module (ELCM), which extracts the crowd features in the network through a refined ghost block to reduce the network parameters and computing cost, and solves the problem of inaccurate counting caused by uneven crowd distribution through spatial group normalization (SGN). In the decoding process, we design a scale regression module (SRM) to reduce the error details and chessboard effect caused by linear interpolation and deconvolution. In addition, we design a new loss function, which enhances the spatial correlation of the density map and the sensitivity of the crowd through a regional normalized cross-correlation loss and counting loss, to ensure the counting accuracy. Extensive experiments on five mainstream datasets demonstrate that Lw-Count achieves an optimal trade-off between counting performance and running speed compared with other methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call