메뉴 건너뛰기




Volumn 3163, Issue , 1997, Pages 278-289

Random sets in data fusion problems

Author keywords

Assignment problems; Choquet's capacity functional; Data fusion; Multi target multi sensor tracking; Multiple object state estimation; Point processes; Random sets

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; OPTICAL CORRELATION; OPTICAL SENSORS; TRACKING (POSITION);

EID: 0031288782     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.279524     Document Type: Conference Paper
Times cited : (6)

References (25)
  • 22
    • 0023173192 scopus 로고
    • A shortest augmenting path algorithm for dense and sparse linear assignment algorithms
    • (1987) Computing , vol.38 , Issue.4 , pp. 325-340
    • Jonker, R.1    Volgenant, A.2


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