Abstract
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This technique, however, suffers from combinatorial explosion, since each new measurement may potentially be associated with any of the existing tracks. Consequently, the complexity of existing MTT algorithms grows exponentially with the number of objects, rendering them inapplicable to large databases. In this paper, we investigate the feasibility of applying the MTT framework in the context of large trajectory databases. Given a history of object movements, where the corresponding object ids have been removed, our goal is to track the trajectory of every object in the database in successive timestamps. Our main contribution lies in the transition from an exponential solution to a polynomial one. We introduce a novel method that transforms the tracking problem into a min-cost max-flow problem. We then utilize well-known graph algorithms that work in polynomial time with respect to the number of objects. The experimental results indicate that the proposed methods produce high quality results that are comparable with the state-of-the-art MTT algorithms. In addition, our methods reduce significantly the computational cost and scale to a large number of objects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bar-Shalom, Y., Fortmann, T.E.: Tracking and Data Association. Academic Press, London (1988)
Blackman, S.S.: Multiple-Target Tracking with Radar Applications. Artech House (1986)
Leung, H., Hu, Z., Blanchette, M.: Evaluation of multiple radar target trackers in stressful environments. IEEE Trans. on Aerospace and Electronic Systems 35(2), 663–674 (1999)
Reid, D.B.: An algorithm for tracking multiple targets. IEEE Trans. on Automatic Control 24(6), 843–854 (1979)
Chummun, M., Kirubarajan, T., Pattipati, K., Bar-Shalom, Y.: Fast data association using multidimensional assignment with clustering. IEEE Trans. on Aerospace and Electronic Systems 37(3), 898–913 (2001)
Konstantinova, P., Nikolov, M., Semerdjiev, T.: A study of clustering applied to multiple target tracking algorithm. In: Proc. International Conference on Computer Systems and Technologies (Comp.Sys.Tech.), pp. 1–6 (2004)
Kubica, J., Moore, A.W., Connolly, A., Jedicke, R.: A multiple tree algorithm for the efficient association of asteroid observations. In: Proc. ACM International Conference on Knowledge Discovery and Data Mining (KDD), pp. 138–146 (2005)
Hoh, B., Gruteser, M.: Protecting location privacy through path confusion. In: IEEE International Conference on Security and Privacy in Communication Networks (Secure Comm), pp. 194–205 (2005)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16(1), 87–90 (1958)
Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)
Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153–180 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vyahhi, N., Bakiras, S., Kalnis, P., Ghinita, G. (2008). Tracking Moving Objects in Anonymized Trajectories. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2008. Lecture Notes in Computer Science, vol 5181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85654-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-85654-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85653-5
Online ISBN: 978-3-540-85654-2
eBook Packages: Computer ScienceComputer Science (R0)