An efficient implementation of reid's multiple hypothesis tracking algorithm and its evaluation for the purpose of visual tracking.
IEEE Transactions on Pattern Analysis and Machine Intelligence
An sfficient implementation of Reid's multiple hypothesis tracking (MHT) algorithm is presented in which the k-tiesl hypotheses are determined in polynomial time using an algorithm due to Murty . The MHT algorithm is then applied to several motion sequences. The MHT capabilities of track initiation, termination, and continuation are demonstrated together with the latter's capability to provide low level support of temporary occlusion of tracks. Between 50 and 150 corner features are simultaneously tracked in the image plane over a sequence of up to 51 frames. Each corner is tracked using a simple linear Kaiman filter and any data association uncertainty is resolved by the MHT. Kaiman filter parameter estimation is discussed, and experimental results show that the algorithm is robust to errors in the motion model. An investigation of the performance of the algorithm as a function of look-ahead (tree depth) indicates that high accuracy can be obtained for tree depths as shallow as three. Experimental results suggest that a real-time MHT solution to the motion correspondence problem is possible for certain classes of scenes. ©1996 IEEE.
|Title:||An efficient implementation of reid's multiple hypothesis tracking algorithm and its evaluation for the purpose of visual tracking|
|Keywords:||Data association, tracking, Motion correspondence, Multiple hypothesis tracking, Ranked bipartite graph matching, Visual tracking|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science
UCL > School of BEAMS > Faculty of Engineering Science > Computer Science
Archive Staff Only