Skip to main content

Multiple Target Tracking

  • Reference work entry
Encyclopedia of GIS
  • 149 Accesses

Definition

The problem of associating a set of anonymous position observations with sets of prior observations to construct the traces of several moving objects or targets. More precisely, given n t position observations at time t and previous observations n t−1 , n t−2 , …, n tm , construct a set of traces, where each trace only contains the position observations from a single moving object. In a variation of the problem the number of actual moving objects may be greater than each n since objects may disappear and emerge during the observation interval.

Main Text

Multiple hypothesis tracking is one representative algorithm proposed by Reid [2] in 1979 to solve this problem. This algorithm uses a linear Kalman model to represent the movement behavior of each object and to filter observation noise. The algorithm operates in three steps. First it predicts a new system state (which includes predicted positions of each object based on the prior trajectory). Then it generates hypotheses...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Civilis, A., Pakalnis, S.: Techniques for efficient road-network-based tracking of moving objects. IEEE Trans. Knowl. Data Eng. 17(5), 698–712 (2005) Senior Member‐Christian S. Jensen

    Google Scholar 

  2. Reid, D.: An algorithm for tracking multiple targets. IEEE Trans. Autom. Control 24(6), 843–854 (1979)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Hoh, B., Gruteser, M. (2008). Multiple Target Tracking. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_850

Download citation

Publish with us

Policies and ethics