Binary Quadratic Programing for Online Tracking of Hundreds of People in Extremely Crowded Scenes

Abstract

Abstract-Multi-object tracking has been studied for decades. However, when it comes to tracking pedestrians in extremely crowded scenes, we are limited to only few works. This is an important problem which gives rise to several challenges. Pre-trained object detectors fail to localize targets in crowded sequences. This consequently limits the use of data-association based multi-target tracking methods which rely on the outcome of an object detector. Additionally, the small apparent target size makes it challenging to extract features to discriminate targets from their surroundings. Finally, the large number of targets greatly increases computational complexity which in turn makes it hard to extend existing multi-target tracking approaches to high-density crowd scenarios. In this paper, we propose a tracker that addresses the aforementioned problems and is capable of tracking hundreds of people efficiently. We formulate online crowd tracking as Binary Quadratic Programing. Our formulation employs target's individual information in the form of appearance and motion as well as contextual cues in the form of neighborhood motion, spatial proximity and grouping constraints, and solves detection and data association simultaneously. In order to solve the proposed quadratic optimization efficiently, where state-of art commercial quadratic programing solvers fail to find the answer in a reasonable amount of time, we propose to use the most recent version of the Modified Frank Wolfe algorithm, which takes advantage of SWAP-steps to speed up the optimization. We show that the proposed formulation can track hundreds of targets efficiently and improves state-of-art results by significant margins on eleven challenging high density crowd sequences.

The Basic Algorithm for the Constrained Zero-One Quadratic Programming Problem with k-diagonal Matrix and Its Application in the Power System

“…Zero-one quadratic programming, which can be divided into constrained (01CQP) and unconstrained (01UQP), is a combinatorial optimization and has practical significance. For example, it can be applied in circuit design [3], pattern recognition [4], capital budgeting [5], portfolio optimization [6], etc. Except for these well known applications, 01QP also has potential applications in the nonlinear control related fields [7][8][9][10][11].…”

A control parametrization based path planning method for the quad-rotor uavs

“…Off-line algorithms has also been intensively studied. The mathematical model based algorithms [13,3,1] and the bio-inspired algorithms [4,10,6] are such type of algorithms. The computational complexity for the off-line algorithms is normally higher than that of the online algorithms.…”

“…However, a better performance can be achieved. Mathematical model based algorithms formulate the path planning problem into mathematical programs, such as mixed-integer linear program [13], binary linear program [3] and convex program [1]. The same problem can also be solved by using the bio-inspired algorithms.…”

An Intelligent Faculty Tracking and Attendance Marking System using Machine Learning

“…By improving the accuracy of RGB-D object detection it provides an interpretable visualization scheme. Mubarak Shah et al[8], proposed Binary Quadratic Programming for the online Tracking of hundreds of people in crowded scenes. In this method, they use a tracker to detect people in crowded scenes efficiently and formulate the individual information of the target in the form of appearance, motion, neighborhood motion, pairwise spatial relationship, and pairwise group information.…”