Information Entropy Augmented High Density Crowd Counting Network

Information Entropy Augmented High Density Crowd Counting Network

Yu Hao, Lingzhe Wang, Ying Liu, Jiulun Fan
Copyright: © 2022 |Pages: 15
DOI: 10.4018/IJSWIS.297144
Article PDF Download
Open access articles are freely available for download

Abstract

The research proposes an innovated structure of the density map-based crowd counting network augmented by information entropy. The network comprises of a front-end network to extract features and a back-end network to generate density maps. In order to validate the assumption that the entropy can boost the accuracy of density map generation, a multi-scale entropy map extraction process is imported into the front-end network along with a fine-tuned convolutional feature extraction process, In the back-end network, extracted features are decoded into the density map with a multi-column dilated convolution network. Finally, the decoded density map can be mapped as the estimated counting number. Experimental results indicate that the devised network is capable of accurately estimating the count in extremely high crowd density. Compared to similar structured networks which don’t adapt entropy feature, the proposed network exhibits higher performance. This result proves the feature of information entropy is capable of enhancing the efficiency of density map-based crowd counting approaches.
Article Preview
Top

1. Introduction

The analysis of crowd in extremely-high density is essential to public safety. By predicting or alarming the potential hazardous incidents such as panic, casualties can be reduced or avoided. Crowd counting techniques can provide the real-time number of pedestrians within the footage, which is a crucial information to prevent stampede. The strategy of conventional computer vision-based techniques for crowd counting is to extract features such as HOG (Xu et al., 2016), contour (Dong et al., 2007; Weikert et al., 2020) and spatial-temporal information (Wang, 2019) from image patches obtained with a sliding window, and feed these features to classifiers such as SVM (Xu et al., 2016; Tu et al., 2013; Zhao et al., 2017), random forest (Li & Zhou, 2016; Pham et al., 2015) and Markov Model (Jalal et al., 2020) to determine if a pedestrian exists in the patch. Once the detection for the entire footage is completed, the total number of detected pedestrians can be obtained. The major defect of conventional approaches is the low performance on high crowd density. When the density increased to a high-level, pixel-wise information for each pedestrian decreases drastically, and more occlusions will occur. In this case, the accurate detection of individual becomes difficult. and it will cause a significant performance degradation. In order to tackle these issues, regression-based approaches attempt to fabric relations between the crowd distribution and certain global features of the entire footage, and estimate the total crowd count. Arteta et al. (2014) firstly introduced the concept of density map by convolving the pedestrian’s spatial positions in training data with a Gaussian kernel. In the training phase, extracted features and density maps are exploited to train the decoding model. In the testing phase, features are feed to the well-trained model to decode the density map, which will be used to estimate the crowd count. This technique effectively addressed the problem of occlusions in high density, and inspired the deep-learning based crowd counting techniques.

The structure of deep learning-based techniques usually comprises a front-end (feature extraction) network and a back-end (density map generation) network (Cao et al., 2018; Li et al., 2018; Liu et al., 2019; Karthika, 2021; Ranjan et al., 2018; Sindagi & Patel, 2017; Zhang et al., 2016). The front-end network extracts multi-scale features from image data, while the back-end network decodes the features into a density map. Instead of extracting patches with a sliding window, deep learning-based approaches use entire image to fulfill the end-to-end training. Therefore, the processing speed is often much faster than the conventional. Also, the counting accuracy of deep learning-based approaches outperforms the conventional in most of cases.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 1 Issue (2023)
Volume 18: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing