Abstract
Handling queries over images is an interesting issue emerging recently in information systems. One of the most challenging problems on that work is how to process the image rotation efficiently since the query image and the ones stored in the database were typically not taken from the same angles. In this paper, an approach that employs time series representation of images is introduced. Subsequently, Fourier Transform technique can be performed to achieve the invariant rotation between images. Moreover, the data can be compressed efficiently on that representation when working on huge amount of data.
The major contribution on this work is the proposal of VPC + -tree, extended from VPC-tree, a well-known structure supporting indexing and retrieving compressed objects. The VPC + -tree not only supports faster and more accurate retrieval, but it also achieves the almost ideal ratio of disc access. It is a remarkable contribution in the field of time series data processing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fu, A., Chan, P., Cheung, Y.-L., Moon, Y.S.: Dynamic VP-tree Indexing for N-Nearest Neighbor Search Given Pair-Wise Distances. The VLDB Journal (2000)
Adamek, T., O’Connor, N.E.: A multi-scale representation method for non-rigid shapes with a single closed contour. IEEE Circuits Syst. Video Technol. 14(5), 742–753 (2004)
Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Journal of Knowledge and Information Systems 3(3), 263–286 (2001)
Keogh, E., Wei, L., Xi, X., Lee, S., Vlachos, M.: LB Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures. VLDB (2006)
Yankov, D., Keogh, E., Wei, L., Xi, X., Hodges, W.: Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces. In: SIAM International Conference on Data Mining (2007)
Hjaltason, G.R., Samet, H.: Index-Driven Similarity Search in Metric Spaces. ACM Transactions on Database Systems 28(4), 517–580 (2003)
Keogh, E.: (2006), www.cs.ucr.edu/~eamonn/shape/shape.html
Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: a survey and empirical demonstration. In: Proc. of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Alberta, Canada, pp. 102–111 (2002)
Wei, L., Keogh, E., Xi, X., Yoder, M.: Efficiently finding unusual shapes in large image databases. Data Mining and Knowledge Discovery 17(3), 343–376 (2006)
O’Brien, M., Lyman, R.: Resolving phylogeny: Evolutionary archaeology’s fundamental issue. In: Essential Tensions in Archaeological Method and Theory, pp. 115–125 (2003)
Vlachos, M., Vagena, Z., Yu, P.S., Athitsos, V.: Rotation invariant indexing of shapes and line drawings. In: Proceedings of ACM Conference on Information and Knowledge Management (CIKM), pp. 131–138 (2005)
Xi, X., Keogh, E., Wei, L., Mafra-Neto, A.: Finding Motifs in Database of Shapes. In: SIAM International Conference on Data Mining (2007)
Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, Tex.), pp. 311–321. ACM, New York (1993)
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
Doi, T.C., Tho, Q.T., Anh, D.T. (2012). Efficient Handling of 2D Image Queries Using VPC + -tree. In: Sombattheera, C., Loi, N.K., Wankar, R., Quan, T. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2012. Lecture Notes in Computer Science(), vol 7694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35455-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-35455-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35454-0
Online ISBN: 978-3-642-35455-7
eBook Packages: Computer ScienceComputer Science (R0)