Abstract
Computing the rotation-invariant distance between image time-series is a time-consuming process in boundary image matching since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the triangular inequality. We first present the notion of self rotation distance and formally show that the self rotation distance with the triangular inequality produces a tight lower bound and prunes many unnecessary distance computations. Experimental results show that our self rotation distance-based algorithm significantly outperforms the existing algorithm by up to one or two orders of magnitude.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Databases. In: Proc. the 4th Int’l Conf. on Foundations of Data Organization and Algorithms, Chicago, Illinois, pp. 69–84 (October 1993)
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp. 419–429 (May 1994)
Keogh, E.: Exact Indexing of Dynamic Time Warping. In: Proc. the 28th Int’l Conf. on Very Large Data Bases, Hong Kong, pp. 406–417 (August 2002)
Kim, B.-S., Moon, Y.-S., Kim, J.: Noise Control Boundary Image Matching Using Time-Series Moving Average Transform. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol. 5181, pp. 362–375. Springer, Heidelberg (2008)
Keogh, E.J., Wei, L., Xi, X., Vlachos, M., Lee, S.-H., Protopapas, P.: Supporting Exact Indexing of Arbitrarily Rotated Shapes and Periodic Time Series under Euclidean and Warping Distance Measures. The VLDB Journal 18(3), 611–630 (2009)
Han, W.-S., Lee, J., Moon, Y.-S., Jiang, H.: Ranked Subsequence Matching in Time-Series Databases. In: Proc. the 33rd Int’l Conf. on Very Large Data Bases, Vienna, Austria, pp. 423–434 (September 2007)
Pratt, W.K.: Digital Image Processing, 4th edn. Eastman Kodak Company, Rochester (2007)
Kim, S.-P., Moon, Y.-S., Hong, S.-K.: An Envelope-Based Approach to Rotation-Invariant Boundary Image Matching. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 382–393. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moon, YS., Kim, SP., Kim, J. (2012). Fast Computation of Rotation-Invariant Distances for Image Time-Series Data. In: Lee, G., Howard, D., Kang, J.J., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2012. Lecture Notes in Computer Science, vol 7425. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32645-5_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-32645-5_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32644-8
Online ISBN: 978-3-642-32645-5
eBook Packages: Computer ScienceComputer Science (R0)