z-logo
open-access-imgOpen Access
The Multi-channel and Multi-scale Network for Crowd Counting
Author(s) -
Pengze Wang,
Wei Wu,
Youfeng Su,
Xin Li,
Duan Yong-sheng
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1650/3/032070
Subject(s) - crowds , computer science , pooling , pyramid (geometry) , feature (linguistics) , channel (broadcasting) , scale (ratio) , artificial intelligence , field (mathematics) , data mining , feature extraction , convolution (computer science) , pattern recognition (psychology) , artificial neural network , mathematics , geography , computer network , linguistics , philosophy , geometry , computer security , cartography , pure mathematics
In this paper, we propose a novel multi-channel and multi-scale network for processing crowds in crowded scenarios and improving counting accuracy. In the estimated crowd count study, different distribution groups have different contributions to the total number of crowd, and the more crowded people have stricter requirements on details. Therefore, we designed two branches in the crowd counting network: the backbone network performs feature extraction operations on the original image, which mainly obtains effective information from the global, and our branch network focuses on the crowd gathering area, which better focuses on the details of the crowd distribution. Finally, the global information is complemented with local details to obtain high-quality feature expressions. To deal with scale changes, Inspired by atrous spatial pyramid pooling structures, we introduce dilated convolution with different sampling rates in the network to expand the receptive field. We carried out a large number of experimental verifications on popular data sets, and the proposed method is superior to existing methods.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here