An adaptive block-based matching algorithm for crowd motion sequences

Abstract

For crowd analytics and surveillance systems, motion estimation is an essential first step. Lots of crowd motion estimation algorithms have been presented in the last years comprising pedestrian motion. However, algorithms based on optical flow and background subtraction have numerous limitations such as the complexity of the computation in the presence of high dense crowd and sudden motion changes. Therefore, a novel estimation algorithm is proposed to measure the motion of crowd with less computational complexity and satisfy the real time requirements. The proposed algorithm is based on block-based matching, particle advection, and social force model. By the block-based matching, the motion is estimated in each frame, and the corresponding motion field is created. The particle advection process provides more information about the behavior of pedestrians groups, their tracked trajectories and the boundary of each group segment. Relying on the social force model, a predicted direction of the motion vectors (MV) could be measured significantly. Subsequently, the block-based technique is combined with the social force model to obtain the accurate motion vector with the less possible number of search points. The experimental results indicate that the proposed method achieves high performance by reducing the search points, particularly when many collision situations or obstacles exist in the scenes. Considering the reduction in the computational complexity, the quality of degradation is very low. In all cases, average PSNR degradation of the proposed algorithm is only 0.09.