메뉴 건너뛰기




Volumn 6699, Issue , 2007, Pages

Computationally efficient assignment-based algorithms for data association for tracking with angle-only sensors

Author keywords

Assignment technique; Auction algorithm; Data association; Multitarget multisensor tracking; Passive sensor tracking

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING; SENSOR DATA FUSION;

EID: 42149084535     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.734360     Document Type: Conference Paper
Times cited : (5)

References (15)
  • 8
    • 0023173192 scopus 로고
    • A shortest augmenting path algorithm for dense and sparse linear assignment problems
    • R. Jonker and A. Volgenant, "A shortest augmenting path algorithm for dense and sparse linear assignment problems", J. Computing, Vol. 38, pp. 325 340, 1987.
    • (1987) J. Computing , vol.38 , pp. 325-340
    • Jonker, R.1    Volgenant, A.2
  • 11
    • 0001845827 scopus 로고    scopus 로고
    • Survey of assignment techniques for multitarget tracking
    • Y. Bar-Shalom and W. D. Blair, eds, Artech House, Boston, MA, USA
    • K. R. Pattipati, R. L. Popp, and T. Kirubarajan, "Survey of assignment techniques for multitarget tracking", Multisensor-Multitarget Tracking: Applications and Advances, Vol. 3(Y. Bar-Shalom and W. D. Blair, eds.), Artech House, Boston, MA, USA, 2000.
    • (2000) Multisensor-Multitarget Tracking: Applications and Advances , vol.3
    • Pattipati, K.R.1    Popp, R.L.2    Kirubarajan, T.3
  • 12
    • 0000937639 scopus 로고
    • The multidimensional assignment problem
    • W. P. Pierskall, "The multidimensional assignment problem", Operations Research, Vol. 16, pp. 422-431, 1968..
    • (1968) Operations Research , vol.16 , pp. 422-431
    • Pierskall, W.P.1
  • 13
    • 0000070346 scopus 로고
    • A Lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking
    • Aug
    • A. B. Poore and N. Rijavec, "A Lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking", SIAM J. Optimization, Vol. 3, pp. 544-563, Aug. 1993.
    • (1993) SIAM J. Optimization , vol.3 , pp. 544-563
    • Poore, A.B.1    Rijavec, N.2
  • 14
    • 0031645109 scopus 로고    scopus 로고
    • R. L. Popp, K. R. Pattipati, Y. Bar-Shalom, and R. R. Gassner, An adaptive m-best SD assignment algorithm and parallelization for multitarget tracking, Proc. IEEE Aerospace Conf, 5, pp. 71 84, Snowmass at Aspen, Colorado, 1998.
    • R. L. Popp, K. R. Pattipati, Y. Bar-Shalom, and R. R. Gassner, "An adaptive m-best SD assignment algorithm and parallelization for multitarget tracking", Proc. IEEE Aerospace Conf, Vol. 5, pp. 71 84, Snowmass at Aspen, Colorado, 1998.
  • 15
    • 0003359612 scopus 로고    scopus 로고
    • The unscented Kalman filter
    • S. Haykin, ed, pp, Wiley & Sons, New York, NY, USA, Oct
    • E. A. Wan and R. van der Merwe, "The unscented Kalman filter", in Kalman Filtering and Neural Networks, (S. Haykin, ed.), pp. 1210 1217, Wiley & Sons, New York, NY, USA, Oct. 2001.
    • (2001) Kalman Filtering and Neural Networks , pp. 1210-1217
    • Wan, E.A.1    van der Merwe, R.2


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