A rank constrained continuous formulation of multi-frame multi-target tracking problem

This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable correspondences between target tracks and measurements (collected over multiple time instances) as well as handling the common tracking problems such as, track initiations and terminations, occlusions, and noisy detections. The problem is known to be NP-Hard for more than two frames. A rank constrained continuous formulation of the problem is presented that can be efficiently solved using nonlinear optimization methods. It is shown that the global and local extrema of the continuous problem respectively coincide with the maximum and the maximal solutions of the discrete counterpart. A scanning window based tracking algorithm is developed using the formulation that performs well under noisy conditions with frequent occlusions and multiple track initiations and terminations. The above claims are supported by experi...

• Type: Conference
• Year: 2008
• Where: CVPR
• Authors: Khurram Shafique, Mun Wai Lee, Niels Haering
• Keywords: Computer Vision, CVPR 2008, Data Association Algorithm, Multi-frame Data Association, Track Initiations