loading...
A Probabilistic Framework for Combining Tracking Algorithms
Washington, D.C., USA June 27-July 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.192004 IEEE Computer Society Conference ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ido Leichter, Technion - Israel Institute of Technology
Michael Lindenbaum, Technion - Israel Institute of Technology
Ehud Rivlin, Technion - Israel Institute of Technology
For the past few years researches have been investigating enhancing tracking performance by combining several different tracking algorithms. We propose an analytically justified, probabilistic framework to combine multiple tracking algorithms. The separate tracking algorithms considered output a probability distribution function of the tracked state, sequentially for each image. The algorithms may output either an explicit probability distribution function, or a sample-set of it via CONDENSATION. The proposed framework is general and allows the combination of any set of separate tracking algorithms of this kind, even on different state spaces of different dimensionality, under a few reasonable assumptions. In many of the investigated settings, our approach allows us to treat the separate tracking algorithms as "closed boxes". In other words, only the state distributions in the input and output are needed for the combination process. The suggested framework was successfully tested using various state spaces and datasets.
Citation:
Ido Leichter, Michael Lindenbaum, Ehud Rivlin, "A Probabilistic Framework for Combining Tracking Algorithms," cvpr, vol. 2, pp.445-451, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions