An efficient implementation and evaluation of Reid's multiple hypothesis tracking algorithm for visual tracking

An efficient implementation of Reid's multiple hypothesis tracking (MHT) algorithm is presented in which the the k-best hypotheses are determined in polynomial time using an algorithm due to Murty (1968). The MHT algorithm is then applied to several motion sequences. The MHT capabilities of tra...

Full description

Saved in:
Bibliographic Details
Published inPattern Recognition, 1994 12th International Conference On. Vol. 1 Vol. 1; pp. 437 - 442 vol.1
Main Authors Cox, I.J., Hingorani, S.L.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1994
Subjects
Algorithm design and analysis
Approximation algorithms
Feature extraction
Image sequences
Layout
Motion analysis
National electric code
Polynomials
Target tracking
Uncertainty
Online AccessGet full text
ISBN0818662654
9780818662652
DOI10.1109/ICPR.1994.576318

Cover

More Information
Summary:An efficient implementation of Reid's multiple hypothesis tracking (MHT) algorithm is presented in which the the k-best hypotheses are determined in polynomial time using an algorithm due to Murty (1968). The MHT algorithm is then applied to several motion sequences. The MHT capabilities of track initiation, termination and continuation are demonstrated. Continuation allows the MHT to function despite temporary occlusion of tracks. Between 50 and 150 corner features are simultaneously tracked in the image plane over a sequence of up to 60 frames. Each corner is tracked using a simple linear Kalman filter and any data association uncertainty is resolved by the MHT. Kalman filter parameter estimation is discussed and experimental results show that the algorithm is robust to errors in the motion model.
ISBN:0818662654
9780818662652
DOI:10.1109/ICPR.1994.576318