메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 6-11

Robust approaches for the data association problem

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; NUMERICAL ANALYSIS; PROBLEM SOLVING; TARGETS;

EID: 33847144663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIF.2005.1591918     Document Type: Conference Paper
Times cited : (8)

References (19)
  • 1
    • 0026821150 scopus 로고
    • A new relaxation algorithm and passive sensor data association
    • K. R. Pattipati, S. Deb, Y. Bar-Shalom, and R. Washburn, "A new relaxation algorithm and passive sensor data association," IEEE Trans. Automat. Contr., vol. 37, no. 2, pp. 198-213, 1992.
    • (1992) IEEE Trans. Automat. Contr , vol.37 , Issue.2 , pp. 198-213
    • Pattipati, K.R.1    Deb, S.2    Bar-Shalom, Y.3    Washburn, R.4
  • 2
    • 0031119192 scopus 로고    scopus 로고
    • A generalized s-d assignment algorithm for multisensor-multitarget state estimation
    • S. Deb, M. Yeddanapudi, K. Pattipati, and Y. Bar-Shalom, "A generalized s-d assignment algorithm for multisensor-multitarget state estimation," IEEE Trans. Aerosp. Electron. Syst., vol. 33, no. 2, pp. 523-537, 1997.
    • (1997) IEEE Trans. Aerosp. Electron. Syst , vol.33 , Issue.2 , pp. 523-537
    • Deb, S.1    Yeddanapudi, M.2    Pattipati, K.3    Bar-Shalom, Y.4
  • 3
    • 0035399109 scopus 로고    scopus 로고
    • A set of greedy rounding randomized adaptative local search procedure (grasp) implementation for the multidimensional assignment problem
    • R. Robertson, "A set of greedy rounding randomized adaptative local search procedure (grasp) implementation for the multidimensional assignment problem," Computational Optimization and Applications, vol. 19, pp. 145-164, 2001.
    • (2001) Computational Optimization and Applications , vol.19 , pp. 145-164
    • Robertson, R.1
  • 4
    • 0031208864 scopus 로고    scopus 로고
    • A genetic algorithm based multi-dimensional data association algorithm for multi-sensor multi-target tracking
    • M. Basseville, "A genetic algorithm based multi-dimensional data association algorithm for multi-sensor multi-target tracking," Mathematical and Computer Modelling, vol. 26, no. 4, pp. 57-69, 1997.
    • (1997) Mathematical and Computer Modelling , vol.26 , Issue.4 , pp. 57-69
    • Basseville, M.1
  • 5
    • 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, no. 7, pp. 1067-1085, 2003.
    • (2003) Computers and Operations Research , vol.30 , Issue.7 , pp. 1067-1085
    • Storms, P.P.A.1    Spieksma, F.C.R.2
  • 7
    • 0026890890 scopus 로고
    • Efficient gating in data association with multivariate distributed states
    • J. B. Collins and J. K. Uhlmann, "Efficient gating in data association with multivariate distributed states," IEEE Trans. Aerosp. Electron. Syst., vol. 28, no. 3, pp. 909-916, 1992.
    • (1992) IEEE Trans. Aerosp. Electron. Syst , vol.28 , Issue.3 , pp. 909-916
    • Collins, J.B.1    Uhlmann, J.K.2
  • 10
    • 0035425675 scopus 로고    scopus 로고
    • The robust spanning tree problem with interval data
    • H. Yaman, O. E. Karajan, and M. C. Pinar, "The robust spanning tree problem with interval data," Operations Research Letters, vol. 29, pp. 31-40, 2001.
    • (2001) Operations Research Letters , vol.29 , pp. 31-40
    • Yaman, H.1    Karajan, O.E.2    Pinar, M.C.3
  • 13
    • 0018986069 scopus 로고
    • Necessary conditions for min-max problems and algorithms by relaxation procedure
    • K. Shimizu and E. Aiyoshi, "Necessary conditions for min-max problems and algorithms by relaxation procedure," IEEE Trans. Automat. Contr., vol. 25, pp. 62-66, 1980.
    • (1980) IEEE Trans. Automat. Contr , vol.25 , pp. 62-66
    • Shimizu, K.1    Aiyoshi, E.2
  • 14
    • 0040973455 scopus 로고
    • Minimax regret solution to linear programming problems with interval objective function
    • M. Inuiguchi and M. Sakawa, "Minimax regret solution to linear programming problems with interval objective function," European Journal of Operational Research, vol. 86, pp. 526-536, 1995.
    • (1995) European Journal of Operational Research , vol.86 , pp. 526-536
    • Inuiguchi, M.1    Sakawa, M.2
  • 15
    • 0344339140 scopus 로고    scopus 로고
    • A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
    • M. E. Mausser and M. Laguna, "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, vol. 117, pp. 157-174, 1998.
    • (1998) European Journal of Operational Research , vol.117 , pp. 157-174
    • Mausser, M.E.1    Laguna, M.2
  • 16
    • 0035030463 scopus 로고    scopus 로고
    • m-best s-d assignment algorithm with application to multitarget tracking
    • R. Popp, K. R. Pattipati, and Y. Bar-Shalom, "m-best s-d assignment algorithm with application to multitarget tracking," IEEE Trans. Automat. Contr., vol. 37, no. 1, pp. 22-37, 2001.
    • (2001) IEEE Trans. Automat. Contr , vol.37 , Issue.1 , pp. 22-37
    • Popp, R.1    Pattipati, K.R.2    Bar-Shalom, Y.3
  • 17
    • 0000849368 scopus 로고
    • An algorithm for ranking all assignments in order of increasing cost
    • K. Murty, "An algorithm for ranking all assignments in order of increasing cost," Operations Research, vol. 16, pp. 682-687, 1968.
    • (1968) Operations Research , vol.16 , pp. 682-687
    • Murty, K.1
  • 19
    • 0024925404 scopus 로고
    • Distance measures for signal processing and pattern recognitition
    • M. Basseville, "Distance measures for signal processing and pattern recognitition," Signal Processing, vol. 18, pp. 349-369, 1989.
    • (1989) Signal Processing , vol.18 , pp. 349-369
    • Basseville, M.1


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