메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 216-227

A fully automated distributed multiple-target tracking and identity management algorithm

Author keywords

[No Author keywords available]

Indexed keywords

DATA ASSOCIATION; IDENTITY MANAGEMENT; MULTIPLE TARGETS; SENSOR NETWORKS;

EID: 29744462604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (20)

References (21)
  • 5
    • 0018689571 scopus 로고
    • An algorithm for tracking multiple targets
    • December
    • Reid, D., "An algorithm for tracking multiple targets," IEEE Transaction on Automatic Control, Vol. 24, No. 6, December 1979, pp. 843-854.
    • (1979) IEEE Transaction on Automatic Control , vol.24 , Issue.6 , pp. 843-854
    • Reid, D.1
  • 6
    • 0000792126 scopus 로고
    • Distributed multitarget-multisensor tracking
    • edited by Y. Bar-Shalom, Artech House: Norwood, MA
    • Chong, C., Mori, S., and Chang, K., "Distributed Multitarget-Multisensor Tracking," Multitarget-Multisensor Tracking: Advanced Applications, edited by Y. Bar-Shalom, Artech House: Norwood, MA, 1990, pp. 247-295.
    • (1990) Multitarget-multisensor Tracking: Advanced Applications , pp. 247-295
    • Chong, C.1    Mori, S.2    Chang, K.3
  • 7
    • 14344260103 scopus 로고    scopus 로고
    • Markov chain Monte Carlo data association for general multiple-target tracking problems
    • Paradise Island, Bahamas, Dec.
    • Oh, S., Russell, S., and Sastry, S., "Markov Chain Monte Carlo Data Association for General Multiple-Target Tracking Problems," Proc. of the 43rd IEEE Conference on Decision and Control, Paradise Island, Bahamas, Dec. 2004.
    • (2004) Proc. of the 43rd IEEE Conference on Decision and Control
    • Oh, S.1    Russell, S.2    Sastry, S.3
  • 9
    • 23944431934 scopus 로고    scopus 로고
    • A Polynomial-time approximation algorithm for joint probabilistic data association
    • Portland, OR, June
    • Oh, S. and Sastry, S., "A Polynomial-Time Approximation Algorithm for Joint Probabilistic Data Association." Proc. of the American Control Conference, Portland, OR, June 2005.
    • (2005) Proc. of the American Control Conference
    • Oh, S.1    Sastry, S.2
  • 10
    • 0026890890 scopus 로고
    • Efficient gating in data association with multivariate distributed states
    • July
    • Collins, J. and Uhlmann, J., "Efficient gating in data association with multivariate distributed states," IEEE Trans. Aerospace and Electronic Systems, Vol. 28, No. 3, July 1992, pp. 909-916.
    • (1992) IEEE Trans. Aerospace and Electronic Systems , vol.28 , Issue.3 , pp. 909-916
    • Collins, J.1    Uhlmann, J.2
  • 11
    • 29744456932 scopus 로고    scopus 로고
    • Markov chain Monte Carlo data association for multiple-target tracking
    • Univ. of California, Berkeley
    • Oh, S., Russell, S., and Sastry, S., "Markov Chain Monte Carlo Data Association for Multiple-Target Tracking," Tech. Rep. UCB//ERL M05/19, Univ. of California, Berkeley, 2005.
    • (2005) Tech. Rep. , vol.UCB-ERL M05-19
    • Oh, S.1    Russell, S.2    Sastry, S.3
  • 13
    • 0002734223 scopus 로고    scopus 로고
    • The Markov chain Monte Carlo method: An approach to approximate counting and integration
    • edited by D. Hochbaum, PWS Publishing, Boston, MA
    • Jerrum, M. and Sinclair, A., "The Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration," Approximations for NP-hard Problems, edited by D. Hochbaum, PWS Publishing, Boston, MA, 1996.
    • (1996) Approximations for NP-hard Problems
    • Jerrum, M.1    Sinclair, A.2
  • 14
    • 0001974429 scopus 로고    scopus 로고
    • Markov chain concepts related to sampling algorithms
    • edited by W. Gilks, S. Richardson, and D. Spiegelhalter, Interdisciplinary Statistics Series, Chapman and Hall
    • Roberts, G., "Markov chain concepts related to sampling algorithms," Markov Chain Monte Carlo in Practice, edited by W. Gilks, S. Richardson, and D. Spiegelhalter, Interdisciplinary Statistics Series, Chapman and Hall, 1996.
    • (1996) Markov Chain Monte Carlo in Practice
    • Roberts, G.1
  • 15
    • 33244491083 scopus 로고    scopus 로고
    • A distributed algorithm for managing multi-target identities in wireless ad-hoc sensor networks
    • edited by F. Zhao and L. Guibas, Lecture Notes in Computer Science 2654, Palo Alto. CA. April
    • Shin, J., Guibas, L., and Zhao, F., "A Distributed Algorithm for Managing Multi-Target Identities in Wireless Ad-hoc Sensor Networks," Information Processing in Sensor Networks, edited by F. Zhao and L. Guibas, Lecture Notes in Computer Science 2654, Palo Alto. CA. April 2003, pp. 223-238.
    • (2003) Information Processing in Sensor Networks , pp. 223-238
    • Shin, J.1    Guibas, L.2    Zhao, F.3
  • 16
    • 49249151236 scopus 로고
    • The complexity of computing the permanent
    • Valiant, L., "The complexity of computing the permanent," Theoretical Computer Science, Vol. 8, 1979, pp. 189-201.
    • (1979) Theoretical Computer Science , vol.8 , pp. 189-201
    • Valiant, L.1
  • 17
    • 8744273807 scopus 로고    scopus 로고
    • Multiple-target tracking and identity management algorithm in clutter, with application to aircraft tracking
    • Boston, MA, June
    • Hwang, I., Balakrishnan, H., Roy, K., and Tomlin, C., "Multiple-Target Tracking and Identity Management Algorithm In clutter, with Application to Aircraft Tracking," Proceedings of the AACC American Control Conference, Boston, MA, June 2004.
    • (2004) Proceedings of the AACC American Control Conference
    • Hwang, I.1    Balakrishnan, H.2    Roy, K.3    Tomlin, C.4
  • 18
    • 0006011662 scopus 로고
    • Diagonal equivalence to matrices with prescribed row and column sums
    • Sinkhorn, R., "Diagonal equivalence to matrices with prescribed row and column sums," American Mathematical Monthly, Vol. 74, 1967, pp. 402-405.
    • (1967) American Mathematical Monthly , vol.74 , pp. 402-405
    • Sinkhorn, R.1
  • 19
    • 0002200246 scopus 로고
    • Scaling of matrices which have prescribed row sums and column sums via optimization
    • Rothblum, U. and Schneider, H., "Scaling of Matrices which Have Prescribed Row Sums and Column Sums via Optimization," Linear Algebra and Its Applications, Vol. 114/115, 1989, pp. 737-764.
    • (1989) Linear Algebra and Its Applications , vol.114-115 , pp. 737-764
    • Rothblum, U.1    Schneider, H.2
  • 20
    • 0034363964 scopus 로고    scopus 로고
    • A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
    • Linial, N., Samorodnitsky, A., and Wigderson, A., "A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents," Combinatorica, Vol. 20, 2000, pp. 545-568.
    • (2000) Combinatorica , vol.20 , pp. 545-568
    • Linial, N.1    Samorodnitsky, A.2    Wigderson, A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.