Skip to main content

Trading Precision for Speed: Localised Similarity Functions

  • Conference paper
Image and Video Retrieval (CIVR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3568))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellman, R.: Adaptive Control Processes. Princeton University Press, Princeton (1961)

    MATH  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. 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)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Pickering, M., Rüger, S.: Evaluation of key-frame based retrieval techniques for video. Computer Vision and Image Understanding 92(1), 217–235 (2003)

    Article  Google Scholar 

  14. Smeaton, A., Kraaij, W., Over, P.: TRECVID 2003 — An introduction. In: TRECVID 2003 Workshop, pp. 1–10 (2003)

    Google Scholar 

  15. Mitchell, T.: Machine Learning. McGraw Hill, New York (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics