Open AccessCrowd counting considering network flow constraints in videos
Author(s) -
Gao Liqing,
Wang Yanzhang,
Ye Xin,
Wang Jian
Publication year - 2018
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2016.0994
Subject(s) - computer science , flow (mathematics) , flow network , artificial intelligence , computer vision , computer network , mathematical optimization , mathematics , geometry
The growth of the number of people in the monitoring scene may increase the probability of security threat, which makes crowd counting more and more important. Most of the existing approaches estimate the number of pedestrians within one frame, which results in inconsistent predictions in terms of time. This study, for the first time, introduces a quadratic programming (QP) model with the network flow constraints to improve the accuracy of crowd counting. Firstly, the foreground of each frame is segmented into groups, each of which contains several pedestrians. Then, a regression‐based map is developed in accordance with the relationship between low‐level features of each group and the number of people in it. Secondly, a directed graph is constructed to simulate constraints on people's flow, whose vertices represent groups of each frame and arcs represent people moving from one group to another. Finally, by solving a QP problem with network flow constraints in the directed graph, the authors obtain consistency in people counting. The experimental results show that the proposed method can reduce the crowd counting errors and improve the accuracy. Moreover, this method can also be applied to any ultramodern group‐based regression counting approach to get improvements.