메뉴 건너뛰기




Volumn 43, Issue 9-10, 2006, Pages 1074-1091

Some assignment problems arising from multiple target tracking

Author keywords

Group assignment; Multi dimensional assignment; Multiple hypothesis correlation; Multiple hypothesis tracking; Target tracking

Indexed keywords

ALARM SYSTEMS; ALGORITHMS; DATA ACQUISITION; DECISION MAKING; OPTIMIZATION; REAL TIME SYSTEMS; SENSORS; VELOCITY;

EID: 33646061635     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2005.05.026     Document Type: Article
Times cited : (81)

References (49)
  • 4
    • 0031221873 scopus 로고    scopus 로고
    • A new class of Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
    • Poore A.B., and Robertson III A.J. A new class of Lagrangian relaxation based algorithm for a class of multidimensional assignment problems. Computational Optimization and Applications 8 (1997) 129-150
    • (1997) Computational Optimization and Applications , vol.8 , pp. 129-150
    • Poore, A.B.1    Robertson III, A.J.2
  • 6
    • 0028387581 scopus 로고
    • Multidimensional assignment formulation of data association problems arising from multitarget tracking and multisensor data fusion
    • Poore A.B. Multidimensional assignment formulation of data association problems arising from multitarget tracking and multisensor data fusion. Computational Optimization and Applications 3 (1994) 27-57
    • (1994) Computational Optimization and Applications , vol.3 , pp. 27-57
    • Poore, A.B.1
  • 7
    • 0035767634 scopus 로고    scopus 로고
    • A.B. Poore, S. Lu, B. Suchomel, Network MFA tracking architectures, in: O.E. Drummond (Ed.), Proceedings of SPIE Conference on Small Targets 2001, 2001
  • 13
    • 33646068214 scopus 로고    scopus 로고
    • Joint Composite Tracking Network, http://seal.gatech.edu/jctn/
  • 14
    • 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 38 (1987) 325-340
    • (1987) Computing , vol.38 , pp. 325-340
    • Jonker, R.1    Volgenant, A.2
  • 18
    • 85076155235 scopus 로고    scopus 로고
    • A.B. Poore, N. Rijavec, T. Barker, M. Munger, Data association problems posed as multidimensional assignment problems: Numerical simulations, in: O.E. Drummond (Ed.), Signal and Data Processing of Small Targets 1954 (Proceedings of the SPIE) 1993, pp. 564-573
  • 23
    • 0000151029 scopus 로고    scopus 로고
    • A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem
    • Network design: Connectivity and facilities location. Pardalos P.M., and Du D.-Z. (Eds), American Mathematical Society
    • Murphey R.A., Pardalos P.M., and Pitsoulis L.S. A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: Pardalos P.M., and Du D.-Z. (Eds). Network design: Connectivity and facilities location. DIMACS Series on Discrete Mathematics and Theoretical Computer Science vol. 40 (1998), American Mathematical Society 277-301
    • (1998) DIMACS Series on Discrete Mathematics and Theoretical Computer Science , vol.40 , pp. 277-301
    • Murphey, R.A.1    Pardalos, P.M.2    Pitsoulis, L.S.3
  • 24
    • 0035399109 scopus 로고    scopus 로고
    • A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
    • Robertson A.J. A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem. Computational Optimization and Applications 19 (2001) 145-164
    • (2001) Computational Optimization and Applications , vol.19 , pp. 145-164
    • Robertson, A.J.1
  • 25
    • 0001845827 scopus 로고    scopus 로고
    • Survey of assignment techniques for multitarget tracking
    • Bar-Shalom Y., and Blair W.D. (Eds), Artech House, Boston (Chapter 2)
    • Pattipati K.R., Popp R.L., and Kirubarajan T. Survey of assignment techniques for multitarget tracking. In: Bar-Shalom Y., and Blair W.D. (Eds). Multitarget-Multisensor Tracking: Advanced Applications vol. III (2000), Artech House, Boston 77-159 (Chapter 2)
    • (2000) Multitarget-Multisensor Tracking: Advanced Applications , vol.III , pp. 77-159
    • Pattipati, K.R.1    Popp, R.L.2    Kirubarajan, T.3
  • 29
    • 84974870225 scopus 로고
    • An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice
    • Frieze A.M., and Yadegar J. An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice. Journal of the Operational Research Society 32 (1981) 989-995
    • (1981) Journal of the Operational Research Society , vol.32 , pp. 989-995
    • Frieze, A.M.1    Yadegar, J.2
  • 30
    • 0032646928 scopus 로고    scopus 로고
    • Partial branch and bound for improved data association in multiframe processing
    • Kadar I. (Ed), SPIE
    • Poore A.B., and Yan X. Partial branch and bound for improved data association in multiframe processing. In: Kadar I. (Ed). Signal Processing, Sensor Fusion, and Target Recognition VIII vol. 3720 (April 1999), SPIE
    • (1999) Signal Processing, Sensor Fusion, and Target Recognition VIII , vol.3720
    • Poore, A.B.1    Yan, X.2
  • 31
    • 0033311441 scopus 로고    scopus 로고
    • Some algorithmic improvements in multiple-frame most probable hypothesis tracking
    • Drummond O.E. (Ed), SPIE
    • Poore A.B., and Yan X. Some algorithmic improvements in multiple-frame most probable hypothesis tracking. In: Drummond O.E. (Ed). Proceedings of SPIE no. 3809 (1999), SPIE 435-443
    • (1999) Proceedings of SPIE , vol.3809 , pp. 435-443
    • Poore, A.B.1    Yan, X.2
  • 36
    • 1842738604 scopus 로고    scopus 로고
    • Two-dimensional assignment with merged measurements using Lagrangian relaxation
    • Drummond O. (Ed), SPIE
    • Briers M., Maskell S., and Philpott M. Two-dimensional assignment with merged measurements using Lagrangian relaxation. In: Drummond O. (Ed). Proceedings of SPIE vol. 5204 (2004), SPIE
    • (2004) Proceedings of SPIE , vol.5204
    • Briers, M.1    Maskell, S.2    Philpott, M.3
  • 37
    • 33646040242 scopus 로고    scopus 로고
    • S. Gadaleta, A.B. Poore, B.J. Slocumb, Some assignment problems arising from cluster tracking, in: ORNL Workshop on Signal Processing, Communications and Chaotic Systems: A Tribute to Rabinder N. Madan, Harbor Island Conference Center, June 20, 2002
  • 39
    • 33646050148 scopus 로고    scopus 로고
    • S. DeVries, R. Vohra, Combinatorial auctions: A survey, 2000
  • 40
    • 33646018153 scopus 로고    scopus 로고
    • C. Li, K. Sycara, Algorithms for combinatorial coalition forming and payoff division in an electronic marketplace, Technical Report, Carnegie Mellon University, 2001
  • 41
    • 84879394699 scopus 로고    scopus 로고
    • 2-d measurement-to-track association for tracking closely spaced, possibly unresolved, Rayleigh targets: Idealized resolution
    • Blair W.D., Slocumb B.J., Brown G.C., and Register A.H. 2-d measurement-to-track association for tracking closely spaced, possibly unresolved, Rayleigh targets: Idealized resolution. Aerospace Conference Proceedings 4 (2002) 4.1543-4.1550
    • (2002) Aerospace Conference Proceedings , vol.4
    • Blair, W.D.1    Slocumb, B.J.2    Brown, G.C.3    Register, A.H.4
  • 42
    • 84901425865 scopus 로고    scopus 로고
    • H. Chen, T. Kirubarajan, Y. Bar-Shalom, Tracking of spawning targets with multiple finite resolution sensors, in: Proceedings International Conference on Information Fusion, FUSION 2002, Annapolis, MD, July 2002, 2002, pp. 1511-1518
  • 43
    • 1842789022 scopus 로고    scopus 로고
    • Pixel-cluster decomposition tracking for multiple IR-sensor surveillance
    • Signal and Data Processing of Small Targets
    • Gadaleta S., Poore A., and Slocumb B. Pixel-cluster decomposition tracking for multiple IR-sensor surveillance. Signal and Data Processing of Small Targets. SPIE vol. 5204 (2003) 270-282
    • (2003) SPIE , vol.5204 , pp. 270-282
    • Gadaleta, S.1    Poore, A.2    Slocumb, B.3
  • 45
    • 0000849368 scopus 로고
    • An algorithm for ranking all the assignments in order of increasing cost
    • Murty K. An algorithm for ranking all the assignments in order of increasing cost. Operations Research 16 (1968) 682-687
    • (1968) Operations Research , vol.16 , pp. 682-687
    • Murty, K.1
  • 47
    • 33646075257 scopus 로고    scopus 로고
    • A.B. Poore, S. Gadaleta, B.J. Slocumb, Multiple hypothesis correlation in track-to-track fusion management, in: Handbook of Modelling for Discrete Optimization, Kluwer International Series in Operations Research and Management Science, Kluwer (in press)
  • 49
    • 33646061477 scopus 로고    scopus 로고
    • B.J. Slocumb, Data segmentation/centroid processing with tracker feedback for tracking closely spaced objects, Technical Report, Numerica Corporation, 2003


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