Bibliography

1

P. Smith and G. Buechler, ``A branching algorithm for discriminating and tracking multiple objects,'' Trans. on Automatic Control 20, pp. 101-104, Feb 1975.

2

C. Morefield, ``Application of 0-1 integer programming to multitarget tracking problems,'' Trans. on Automatic Control 22, pp. 302-312, June 1977.

3

R. A. Singer, R. G. Sea, and K. M. Housewright, ``Derivation and evaluation of improved tracking filters for use in dense multitarget environments,'' IEEE Trans. on Info. Theory 20, pp. 423-432, July 1974.

4

D. B. Reid, ``An algorithm for tracking multiple targets,'' Trans. on Automatic Control AC-24, pp. 843-854, Dec 1979.

5

Y. Bar-Shalom and E. Tse, ``Tracking in a cluttered environment with probabilistic data association,'' Automatica 11, pp. 451-460, Sept 1975.

6

K.-C. Chang and Y. Bar-Shalom, ``Joint probabilistic data association for multitarget tracking with possibly unresolved measurements and maneuvers,'' IEEE Trans. on Automatic Control 29, pp. 585-594, July 1984.

7

K. Buckley, A. Vaddiraju, and R. Perry, ``A new pruning/merging algorithm for MHT multitarget tracking,'' Radar-2000 , May 2000.

8

B. Radich and K. Buckley, ``Single-snapshot DOA estimation and source number detection,'' Signal Processing Letters 4, pp. 109-111, Apr 1997.

9

J. K. Wolf, A. M. Viterbi, and G. S. Dixon, ``Finding the best set of K paths through a trellis with application to multitarget tracking,'' Trans. on Aerospace and Elect. Sys. 25, pp. 287-296, Mar 1989.

10

N. Seshadri and C. Sundberg, ``List Viterbi decoding algorithms with applications,'' IEEE Trans. on Communications 42, pp. 313-323, Feb/Mar/Apr 1994.

11

R. Danchick and G. Newnam, ``A fast method for finding the exact N-best hypotheses for multitarget tracking,'' Trans. on Aerospace and Elect. Sys. 29, pp. 555-560, Apr 1993.

12

R. Karp, ``An algorithm to solve the m x n assignment problem in expected time O(mn log n),'' Networks 10, pp. 143-152, 1980.