메뉴 건너뛰기




Volumn 4728, Issue , 2002, Pages 461-469

An explicit pattern matching assignment algorithm

Author keywords

Assignment algorithm pattern matching object map GNN JVC gnpl

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; ERROR ANALYSIS; MATRIX ALGEBRA; RADAR TRACKING;

EID: 0036458472     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.478526     Document Type: Conference Paper
Times cited : (52)

References (8)
  • 1
    • 0002136098 scopus 로고
    • The auction algorithm for assignment and other network flow problems: A tutorial
    • Bertsekas, D.P., "The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial,", Interfaces, Vol. 20, pp. 133-149, 1990.
    • (1990) Interfaces , vol.20 , pp. 133-149
    • Bertsekas, D.P.1
  • 3
    • 34548767261 scopus 로고
    • Track association using correction for bias and missing data
    • Signal and Data Processing of Small Targets 1994, O.E. Drummond Editor
    • Blackman, S.S. and N.D. Banh, "Track Association Using Correction for Bias and Missing Data,", Signal and Data Processing of Small Targets 1994, O.E. Drummond Editor, Proc. SPIE Vol. 2235, pp. 529-539, 1994.
    • (1994) Proc. SPIE , vol.2235 , pp. 529-539
    • Blackman, S.S.1    Banh, N.D.2
  • 4
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Dijkstra, E., "A note on two problems in connexion with graphs," Numerische Mathematik 1, pp 269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 5
    • 0002245504 scopus 로고
    • Comparison of 2-D assignment algorithms for rectangular, floating point cost matrices
    • Dec.
    • Drummond, O.E., D.A. Castanon, and M.S. Bellovin, "Comparison of 2-D Assignment Algorithms for Rectangular, Floating Point Cost Matrices,", Proc. of SDI Panels on Tracking, No. 4, pp.81-97, Dec. 1990.
    • (1990) Proc. of SDI Panels on Tracking , Issue.4 , pp. 81-97
    • Drummond, O.E.1    Castanon, D.A.2    Bellovin, M.S.3
  • 6
    • 0023173192 scopus 로고
    • A shortest augmenting path algorithms for dense and sparse linear assignment problems
    • Jonker, R. and A. Volgenant, "A Shortest Augmenting Path Algorithms for Dense and Sparse Linear Assignment Problems", Computing, Vol. 39, pp. 325-340, 1987.
    • (1987) Computing , vol.39 , pp. 325-340
    • Jonker, R.1    Volgenant, A.2
  • 7
    • 0027625715 scopus 로고
    • Local and remote track file registration using minimum description length
    • July
    • Kenefic, R.J., "Local and Remote Track File Registration Using Minimum Description Length," IEEE Trans. on Aerospace and Electronic Systems, Vol. AES-29, No. 3, July 1993, pp. 651-655.
    • (1993) IEEE Trans. on Aerospace and Electronic Systems , vol.AES-29 , Issue.3 , pp. 651-655
    • Kenefic, R.J.1
  • 8
    • 0033713909 scopus 로고    scopus 로고
    • Performance comparison of 2-D assignment algorithms for assigning truth objects to measured tracks
    • Signal and Data Processing of Small Targets 2000, O.E. Drummond Editor
    • Levedahl, M., "Performance Comparison of 2-D Assignment Algorithms for Assigning Truth Objects to Measured Tracks, "Signal and Data Processing of Small Targets 2000, O.E. Drummond Editor, Proc. SPIE Vol 4048, pp 380-389, 2000.
    • (2000) Proc. SPIE , vol.4048 , pp. 380-389
    • Levedahl, M.1


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