메뉴 건너뛰기




Volumn 16, Issue 1, 2005, Pages 14-23

A process distribution approach for multisensor data fusion systems based on geographical dataspace partitioning

Author keywords

Command and control; Data models; Distributed architectures; Sensor fusion

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; INTEGER PROGRAMMING; KALMAN FILTERING; OPTIMIZATION; TRACKING (POSITION);

EID: 13244262683     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2005.3     Document Type: Article
Times cited : (9)

References (19)
  • 2
    • 0002719797 scopus 로고
    • "The Hungarian Method for the Assignment Problem"
    • H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistical Quarterly, vol. 2, pp. 83-97, 1955.
    • (1955) Naval Research Logistical Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 3
    • 0023173192 scopus 로고
    • "A Shortest Path Algorithm for Dense and Sparse Linear Assignment Problems"
    • R. Jonker and A. Volgenant, "A Shortest Path Algorithm for Dense and Sparse Linear Assignment Problems," Computing, vol. 38, pp. 325-340, 1987.
    • (1987) Computing , vol.38 , pp. 325-340
    • Jonker, R.1    Volgenant, A.2
  • 4
    • 0018689571 scopus 로고
    • "An Algorithm for Tracking Multiple Targets"
    • Dec
    • D.B. Reid, "An Algorithm for Tracking Multiple Targets," IEEE Trans. Automatic Control, vol. 24, no. 6, Dec. 1979.
    • (1979) IEEE Trans. Automatic Control , vol.24 , Issue.6
    • Reid, D.B.1
  • 5
    • 0029221641 scopus 로고
    • "On Finding Ranked Assignments with Application to Multitarget Tracking and Motion Correspondence"
    • I.J. Cox and M.L. Miller, "On Finding Ranked Assignments with Application to Multitarget Tracking and Motion Correspondence," IEEE Trans. Aerospace and Electronic Systems, vol. 31, pp. 486-489, 1995.
    • (1995) IEEE Trans. Aerospace and Electronic Systems , vol.31 , pp. 486-489
    • Cox, I.J.1    Miller, M.L.2
  • 6
    • 0027577209 scopus 로고
    • "A Fast Method for Finding the Exact N-Best Hypotheses for Multitarget Tracking"
    • R. Danchick and G.E. Newman, "A Fast Method for Finding the Exact N-Best Hypotheses for Multitarget Tracking," IEEE Trans. Aerospace and Electronic Systems, vol. 29, pp. 555-560, 1993.
    • (1993) IEEE Trans. Aerospace and Electronic Systems , vol.29 , pp. 555-560
    • Danchick, R.1    Newman, G.E.2
  • 7
    • 0000849368 scopus 로고
    • "An Algorithm for Ranking All the Assignments in Order of Increasing Cost"
    • K.G. Murty, "An Algorithm for Ranking All the Assignments in Order of Increasing Cost," Operations Research, vol. 16, pp. 682-687, 1968.
    • (1968) Operations Research , vol.16 , pp. 682-687
    • Murty, K.G.1
  • 8
    • 0017503505 scopus 로고
    • "Application of 0-1 Integer Programming to Multitarget Tracking Problems"
    • L. Morefield, "Application of 0-1 Integer Programming to Multitarget Tracking Problems," IEEE Trans. Automatic Control, vol. 22, pp. 302-312, 1977.
    • (1977) IEEE Trans. Automatic Control , vol.22 , pp. 302-312
    • Morefield, L.1
  • 9
    • 0000070346 scopus 로고
    • "A Langrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking"
    • Aug
    • A.B. Poore and N. Rijavec, "A Langrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking," SIAM J. Optimization, vol. 3, pp. 554-563, Aug. 1993.
    • (1993) SIAM J. Optimization , vol.3 , pp. 554-563
    • Poore, A.B.1    Rijavec, N.2
  • 10
    • 0037410714 scopus 로고    scopus 로고
    • "An LP-Based Algorithm for the Data Association Problem in Multitarget Tracking"
    • P.P.A. Storms and F.C.R. Spieksma, "An LP-Based Algorithm for the Data Association Problem in Multitarget Tracking," Computers and Operations Research, vol. 30, pp. 1067-1085, 2003.
    • (2003) Computers and Operations Research , vol.30 , pp. 1067-1085
    • Storms, P.P.A.1    Spieksma, F.C.R.2
  • 13
    • 0017981037 scopus 로고
    • "An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix"
    • I.S. Duff and J.K. Reid, "An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix," ACM Trans. Math. Software vol. 4, no. 2, pp. 137-147, 1978.
    • (1978) ACM Trans. Math. Software , vol.4 , Issue.2 , pp. 137-147
    • Duff, I.S.1    Reid, J.K.2
  • 14
    • 84976733724 scopus 로고
    • "Algorithm 529: Permutations to Block Triangular Form [F1]"
    • I.S. Duff and J.K. Reid, "Algorithm 529: Permutations to Block Triangular Form [F1]," ACM Trans. Math. Software, vol. 4, no. 2, pp. 189-192, 1978.
    • (1978) ACM Trans. Math. Software , vol.4 , Issue.2 , pp. 189-192
    • Duff, I.S.1    Reid, J.K.2


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