Abstract
We have generalised a class of similarity measures that are designed to address the problems associated with indexing high-dimensional feature space. The features are stored and indexed component wise. For each dimension we retrieve only those objects close the query point and then apply a local distance function to this subset. Thus we can dramatically reduce the amount of data looked at. We have evaluated these distance measures within a content-based image retrieval (CBIR) framework to determine the trade-off between the percentage of the data retrieved and the precision. Our results show that up to 90% of the data can be ignored whilst maintaining, and in some cases improving, retrieval performance.
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
Bellman, R.: Adaptive Control Processes. Princeton University Press, Princeton (1961)
Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “nearest neighbor” meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217–235. Springer, Heidelberg (1998)
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc of ACM SIGMOD Int’l Conf on Management of Data, pp. 47–57 (1984)
Weber, R., Stock, H.-J., Blott, S.: A quantative analysis and performance study for similarity search methods in high-dimensional space. In: VLDB Conf. Proc., pp. 194–205 (1998)
Nene, S., Nayar, S.: A simple algorithm for nearest neighbor search in high dimensions. IEEE Trans. Pattern Anal. Mach. Intell. 19(9), 989–1003 (1997)
Beis, J., Lowe, D.: Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: CVPR 1997: Proc of the 1997 Conf on Computer Vision and Pattern Recognition (CVPR 1997), p. 1000. IEEE Computer Society Press, Los Alamitos (1997)
Aggarwal, C., Hinneburg, A., Keim, D.: On the surprising behavior of distance metrics in high dimensional space. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 420–434. Springer, Heidelberg (2000)
Howarth, P., Rüger, S.: Fractional distance measures for content-based image retrieval. In: Losada, D.E., Fernández-Luna, J.M. (eds.) ECIR 2005. LNCS, vol. 3408, pp. 447–456. Springer, Heidelberg (2005)
Müller, W., Henrich, A.: Faster exact histogram intersection on large data collections using inverted VA-files. In: Enser, P.G.B., Kompatsiaris, Y., O’Connor, N.E., Smeaton, A., Smeulders, A.W.M. (eds.) CIVR 2004. LNCS, vol. 3115, pp. 455–463. Springer, Heidelberg (2004)
de Vries, A., Mamoulis, N., Nes, N., Kersten, M.: Efficient k-nn search on vertically decomposed data. In: Proc of the 2002 ACM SIGMOD Int’l Conf on Management of Data, pp. 322–333. ACM Press, New York (2002)
Aggarwal, C., Yu, P.: The IGrid index: reversing the dimensionality curse for similarity indexing in high dimensional space. In: Knowledge Discovery and Data Mining, pp. 119–129 (2000)
Cha, G.-H.: Bitmap indexing method for complex similarity queries with relevance feedback. In: MMDB 2003: Proc of ACM Int’l Workshop on Multimedia Databases, pp. 55–62. ACM Press, New York (2003)
Pickering, M., Rüger, S.: Evaluation of key-frame based retrieval techniques for video. Computer Vision and Image Understanding 92(1), 217–235 (2003)
Smeaton, A., Kraaij, W., Over, P.: TRECVID 2003 — An introduction. In: TRECVID 2003 Workshop, pp. 1–10 (2003)
Mitchell, T.: Machine Learning. McGraw Hill, New York (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Howarth, P., Rüger, S. (2005). Trading Precision for Speed: Localised Similarity Functions. In: Leow, WK., Lew, M.S., Chua, TS., Ma, WY., Chaisorn, L., Bakker, E.M. (eds) Image and Video Retrieval. CIVR 2005. Lecture Notes in Computer Science, vol 3568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11526346_45
Download citation
DOI: https://doi.org/10.1007/11526346_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27858-0
Online ISBN: 978-3-540-31678-7
eBook Packages: Computer ScienceComputer Science (R0)