A polynomial-time approximation algorithm for joint probabilistic data association

Proceedings of the American Control Conference

Volumn 2, Issue , 2005, Pages 1283-1288

  Oh, Songhwai ^a   Sastry, Shankar ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DATA ASSOCIATION PROBLEMS; JOINT PROBABILISTIC DATA ASSOACIATION (JPDA); POLYNOMIAL TIME;

DATA REDUCTION; MARKOV PROCESSES; MONTE CARLO METHODS; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBLEM SOLVING;

ALGORITHMS;

EID: 23944431934     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. I. Cox, "A review of statistical data association techniques for motion correspondence," International Journal of Computer Vision, vol. 10, no. 1, pp. 53-66, 1993.
2. F. Dellaert, S. Seitz, C. Thorpe, and S. Thrun, "EM, MCMC, and chain flipping for structure from motion with unknown correspondence," Machine Learning, special issue on Markov chain Monte Carlo methods, vol. 50, pp. 45-71, 2003.
3. Y. Bar-Shalom and T. Fortmann, Tracking and Data Association. San Diego, CA: Mathematics in Science and Engineering Series 179 Academic Press, 1988.
4. J. Collins and J. Uhlmann, "Efficient gating in data association with multivariate distributed states," IEEE Trans. Aerospace and Electronic Systems, vol. 28, no. 3, 1992.
5. L. Valiant, "The complexity of computing the permanent," Theoretical Computer Science, vol. 8, pp. 189-201, 1979.
6. R. Fitzgerald, "Development of practical PDA logic for multipltarget tracking by microprocessor," in Multitarget-Multisensor Tracking: Advanced Applications, Y. Bar-Shalom, Ed. Artech House: Norwood, MA, 1990.
7. T. Huang and S. J. Russell, "Object identification in a Bayesian context," in Proc. of the Fifteenth International Joint Conference on Artificial Intelligence, 1997, pp. 1276-1283.
8. N. Bergman and A. Doucet, "Markov chain Monte Carlo data association for target tracking," in Proc. of IEEE Int. Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2000.
9. H. Pasula, S. J. Russell, M. Ostland, and Y. Ritov, "Tracking many objects with many sensors," in Proc. IJCAI-99, Stockholm, 1999.
10. S. Cong, L. Hong, and D. Wicker, "Markov-chain Monte-Carlo approach for association probability evaluation," IEE Proceedings of Control, Theory and Applications, vol. 151, no. 2, pp. 185-193, March 2004.
11. S. Oh, S. Russell, and S. Sastry, "Markov chain Monte Carlo data association for general multiple-target tracking problems," in Proc. of the 43rd IEEE Conference on Decision and Control, Paradise Island, Bahamas, Dec. 2004.
12. D. Reid, "An algorithm for tracking multiple targets," IEEE Transaction on Automatic Control, vol. 24, no. 6, pp. 843-854, December 1979.
13. S. Oh, L. Schenato, and S. Sastry, "A hierarchical multiple-target tracking algorithm for sensor networks," in Proc. of the International Conference on Robotics and Automation, Barcelona, Spain, April 2005.
14. D. Schulz, W. Burgard, D. Fox, and A. Cremers, "Tracking multiple moving targets with a mobile robot using particle filters and statistical data association," in Proc. of the IEEE International Conference on Robotics and Automution (ICRA), 2001.
15. I. Beichl and F. Sullivan, "The Metropolis algorithm," Computing in Science and Engineering, vol. 2, no. 1, pp. 65-69, 2000.
16. M. Jerrum and A. Sinclair, "The Markov chain Monte Carlo method: An approach to approximate counting and integration," in Approximations for NP-hard Problems, D. Hochbaum, Ed. PWS Publishing, Boston, MA, 1996.
17. G. Roberts, "Markov chain concepts related to sampling algorithms," in Markov Chain Monte Carlo in Practice, ser Interdisciplinary Statistics Series, W. Gilks, S. Richardson, and D. Spiegelhalter, Eds. Chapman and Hall, 1996.
18. P. Diaconis and D. Stroock, "Geometric bounds for eigenvalues of Markov chains," Annals of Applied Probability, vol. 1, pp. 36-61, 1991.