Abstract
Most indexing structures for high-dimensional vectors used in multimedia retrieval today rely on determining the importance of each vector component at indexing time in order to create the index. However for Histogram Intersection and other important distance measures this is not possible because the importance of vector components depends on the query. We present an indexing structure inspired by VA-file and Inverted file that does not need to determine the importance at indexing time in order to perform well. Instead, our structure adapts to the importance of vector components at query processing time.
Success of this approach is demonstrated in experiments on feature data extracted from a large image collection.
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
Böhm, K., Milvoncic, M., Schek, H.-J., Weber, R.: Fast Evaluation Techniques for Complex Similarity Queries. In: Proc. Intl. Conf. on VLDB (2001)
de Vries, P., Mamoulis, N., Nes, N., Kersten, M.L.: Efficient k-NN Search on Vertically Decomposed Data. In: Proc. SIGMOD, Madison, WI, USA (June 2002)
Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: Vector approximation based indexing for non-uniform high dimensional data sets. In: CIKM: ACM Intl. Conf. on Information and Knowledge Management, McLean, VA, USA (2000)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Yormark, B. (ed.) SIGMOD 1984, Proc. of Annual Meeting, Boston, MA (1984)
Ortega, M., Rui, Y., Chakrabarti, K., Porkaew, K., Mehrotra, S., Huang, T.S.: Supporting ranked boolean similarity queries in MARS. IEEE Transactions on Knowledge and Data Engineering 10(6) (December 1998)
Squire, D.M., Müller, H., Müller, W.: Improving response time by search pruning in a content-based image retrieval system, using inverted file techniques. In: IEEE Workshop on Content-based Access of Image and Video Libraries (CBAIVL 1999), Fort Collins, CO, USA (1999)
Tesic, J., Manjunath, B.S.: Nearest Neighbor Search for Relevance Feedback. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), Madison, WI, USA, June 2003, vol. 2 (2003)
Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. Intl. Conf. on VLDB, New York, USA (1998)
Wu, P., Manjunath, B., Chandrasekaran, S.: An Adaptive Index Structure for High-dimensional Similarity Search. In: Shum, H.-Y., Liao, M., Chang, S.-F. (eds.) PCM 2001. LNCS, vol. 2195, p. 71. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, W., Henrich, A. (2004). Faster Exact Histogram Intersection on Large Data Collections Using Inverted VA-Files. In: Enser, P., Kompatsiaris, Y., O’Connor, N.E., Smeaton, A.F., Smeulders, A.W.M. (eds) Image and Video Retrieval. CIVR 2004. Lecture Notes in Computer Science, vol 3115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27814-6_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-27814-6_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22539-3
Online ISBN: 978-3-540-27814-6
eBook Packages: Springer Book Archive