Abstract
Trajectories of moving objects provide fruitful information for analyzing activities of the moving objects; therefore, numerous researches have tried to obtain semantic information from the trajectories by using clustering algorithms. In order to cluster the trajectories, similarity measure of the trajectories should be defined first. Most of existing methods have utilized dynamic programming (DP) based similarity measures to cope with different lengths of trajectories. However, DP based similarity measures do not have enough discriminative power to properly cluster trajectories from the real-world environment. In this paper, an effective trajectory similarity measure is proposed, and the proposed measure is based on the geographic and semantic similarities which have a same scale. Therefore, importance of the geographic and semantic information can be easily controlled by a weighted sum of the two similarities. Through experiments on a challenging real-world dataset, the proposed measure was proved to have a better discriminative power than the existing method.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Zhang, Z., Huang, K., Tan, T.: Comparison of Similarity Measures for Trajectory Clustering in Outdoor Surveillance Scenes. In: 18th International Conference on Pattern Recognition, vol. 3, pp. 1135–1138 (2006)
Liu, H. and Schneider, M.: Similarity Measurement of Moving Object Trajectories. In: 3rd ACM SIGSPATIAL International Workshop on GeoStreaming, pp. 19–22 (2012)
Wang, H., Su, H., Zheng, Kai., Sadiq, S., Zhou, X.: An Effective Study on Trajectory Similarity Measures. In: 24th Australasian Database Conference, vol. 137, pp. 13–22 (2013)
Chen, P., Gu, J., Zhu, D., Shao, F.: A Dynamic Time Warping based Algorithm for Trajectory Matching in LBS. In: International Journal of Database Theory and Application, vol. 6, no. 3, pp. 39–48 (2013)
Bergroth, L., Hakonen, H., Raita, T.: A Survey of Longest Common Subsequence Algorithm. In: 7th International Symposium on String Processing and Information Retrieval, pp. 39–48 (2000)
Huttenlocher, D. P., Klanderman, G. A., Rucklidge, W. J.: Comparing Images Using the Hausdorff Distance. In: IEEE Transaction on Pattern Recognition and Machine Intelligence, vol. 15, no. 9, pp. 850–863 (1993)
Zivkovic, Z.: Improved Adaptive Gaussian Mixture model for Background Subtraction. In: 17th International Conference on Pattern Recognition, vol. 2, pp. 28–31 (2004)
Gonzalez, R. C., Woods, R. E.: Digital Image Processing. Pearson Education, New Jersey (2010)
Munkres, J.: Algorithms for the Assignment and Transportation Problems. In: Journal of the Society for Industrial and Applied Mathematics, vol. 5, pp. 32–38 (1957)
Dubuisson, M.-P., Jain, A. K.: A Modified Hausdorff Distance for Object Matching. In: International Conference on Pattern Recognition, pp. 566–568 (1994)
Jesorsky, O., Kirchberg, K. J., Frischholz, R. W.: Robust Face Detection Using the Hausdorff Distance. In: Third International Conference on Audio- and Video-based Biometric Person Authentication, pp. 90–95 (2001)
Frey, B. J., Dueck, D.: Clustering by Passing Messages Between Data points. In: Science, vol. 315, 972–976 (2007)
Acknowledgments
“This research was supported by the MSIP (Ministry of Science, ICT & Future Planning), Korea, under the ITRC (Information Technology Research Center) support program supervised by the NIPA (National IT Industry Promotion Agency)” (NIPA-2014-H0301-14-1018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ra, M., Lim, C., Song, Y.H., Jung, J., Kim, WY. (2015). Effective Trajectory Similarity Measure for Moving Objects in Real-World Scene. In: Kim, K. (eds) Information Science and Applications. Lecture Notes in Electrical Engineering, vol 339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46578-3_75
Download citation
DOI: https://doi.org/10.1007/978-3-662-46578-3_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46577-6
Online ISBN: 978-3-662-46578-3
eBook Packages: EngineeringEngineering (R0)