메뉴 건너뛰기




Volumn 153, Issue 1, 2006, Pages 13-22

Reformulating Reid's MHT method with generalised Murty K-best ranked linear assignment algorithm

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; LINEAR SYSTEMS; MATRIX ALGEBRA; REAL TIME SYSTEMS; SENSORS; SURVEILLANCE RADAR;

EID: 32644436703     PISSN: 13502395     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-rsn:20050041     Document Type: Article
Times cited : (55)

References (10)
  • 1
    • 0018689571 scopus 로고
    • An algorithm for tracking multiple targets
    • Reid, D.B.: ' An algorithm for tracking multiple targets ', IEEE Trans. Autom. Control, 1979, AC-24, p. 843-854
    • (1979) IEEE Trans. Autom. Control , vol.AC-24 , pp. 843-854
    • Reid, D.B.1
  • 2
    • 0017503505 scopus 로고
    • Application of 0-1 integer programming for multitarget tracking problems
    • Morefield, C.L.: ' Application of 0-1 integer programming for multitarget tracking problems ', IEEE Trans. Autom. Control, 1977, AC-22, p. 302-311
    • (1977) IEEE Trans. Autom. Control , vol.AC-22 , pp. 302-311
    • Morefield, C.L.1
  • 4
    • 0027577209 scopus 로고
    • A fast method for finding the exact N-best hypotheses for multitarget tracking
    • Danchick, R., and Newnam, G.E.: ' A fast method for finding the exact N-best hypotheses for multitarget tracking ', IEEE Trans. Aerosp. Electron. Syst., 1993, 29, (2), p. 555-560
    • (1993) IEEE Trans. Aerosp. Electron. Syst. , vol.29 , Issue.2 , pp. 555-560
    • Danchick, R.1    Newnam, G.E.2
  • 5
    • 0029221641 scopus 로고
    • On finding ranked assignments with application to multitarget tracking and motion correspondence
    • Cox, I., and Miller, M.: ' On finding ranked assignments with application to multitarget tracking and motion correspondence ', IEEE Trans. Aerosp. Electron. Syst., 1995, 32, (1), p. 486-489
    • (1995) IEEE Trans. Aerosp. Electron. Syst. , vol.32 , Issue.1 , pp. 486-489
    • Cox, I.1    Miller, M.2
  • 6
    • 0000849368 scopus 로고
    • An algorithm for ranking all the assignments in order of increasing cost
    • Murty, K.G.: ' An algorithm for ranking all the assignments in order of increasing cost ', Oper. Res., 1968, 16, p. 682-687
    • (1968) Oper. Res. , vol.16 , pp. 682-687
    • Murty, K.G.1
  • 7
  • 8
    • 0023173192 scopus 로고
    • A shortest augmenting path algorithm for dense and sparse linear assignment problems
    • Jonker, R., and Volgenant, A.: ' A shortest augmenting path algorithm for dense and sparse linear assignment problems ', Computing, 1987, 38, p. 325-340
    • (1987) Computing , vol.38 , pp. 325-340
    • Jonker, R.1    Volgenant, A.2
  • 9
    • 0030733627 scopus 로고    scopus 로고
    • A com-parison of two algorithms for determining ranked assignments with applications to multitarget tracking and motion correspondence
    • Cox, I., Miller, M., Danchick, R., and Newnam, G.E.: ' A com-parison of two algorithms for determining ranked assignments with applications to multitarget tracking and motion correspondence ', IEEE Trans. Aerosp. Electron. Syst., 1997, 33, (1), p. 295-300
    • (1997) IEEE Trans. Aerosp. Electron. Syst. , vol.33 , Issue.1 , pp. 295-300
    • Cox, I.1    Miller, M.2    Danchick, R.3    Newnam, G.E.4
  • 10
    • 0026890890 scopus 로고
    • Efficient gating in data association with multivariate distributed states
    • Collins, J.B., and Uhlmann, J.K.: ' Efficient gating in data association with multivariate distributed states ', IEEE Trans. Aerosp. Electron. Syst., 1992, 28, (3), p. 909-916
    • (1992) IEEE Trans. Aerosp. Electron. Syst. , vol.28 , Issue.3 , pp. 909-916
    • Collins, J.B.1    Uhlmann, J.K.2


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