Skip to main content
SpringerLink
Log in

Fast Approximate Nearest-Neighbor Queries in Metric Feature Spaces by Buoy Indexing

  • Conference paper
  • First Online:
Recent Advances in Visual Information Systems (VISUAL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2314))

Included in the following conference series:

Abstract

An indexing scheme for solving the problem of nearest neighbor queries in generic metric feature spaces for content-based retrieval is proposed aiming to break the “dimensionality curse”. The basis for the proposed method is the partitioning of the feature dataset into a fixed number of clusters that are represented by single buoys. Upon submission of a query request, only a small number of clusters whose buoys are close to the query object are considered for the approximate query result, cutting down the amount of data to be processed effectively. Results from extensive experimentation concerning the retrieval accuracy are given. The influence of control parameters is investigated with respect to the tradeoff between retrieval accuracy and query execution time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions. Journal of the ACM. 45 6 (1998) 891–923

    Article  MATH  MathSciNet  Google Scholar 

  2. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R *-tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. of the ACM SIGMOD Int’l Conf. on Management of Data. Atlantic City, NJ, USA. (1990) 322–332.

    Google Scholar 

  3. Bow, S.T.: Pattern Recognition and Image Preprocessing. Marcel Dekker, Inc. (1992).

    Google Scholar 

  4. Chiueh, T.: Content-Based Image Indexing. Proc. of the 20th Int’l Conf. on Very Large Databases. Santiago, Chile. (1994) 582–593.

    Google Scholar 

  5. Ciaccia, P. and Patella, M. and Zezula P.: M-tree: an Efficient Access Method for Similarity Search in Metric Spaces. Proc. of the 23rd Int’l Conf. on Very Large Databases. Athens, Greece. (1997) 426–435.

    Google Scholar 

  6. Faloutsos, C., Lin, K.I.: FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. Proc. of the ACM SIGMOD Conf. San Jose, CA, USA. (1995) 163–174.

    Google Scholar 

  7. Guttman, A.: R-tree: A Dynamic Indexing Structure for Spatial Searching. Proc. of the ACM SIGMOD Int’l Conf. on Management of Data. Boston, MA, USA. (1984) 47–57.

    Google Scholar 

  8. Ng, R., Sedighian, A.: Evaluating Multi-dimensional Indexing Structures for Images Transformed by Principal Component Analysis. Proc. SPIE Vol. 2670. (1996) 50–61.

    Google Scholar 

  9. Pestov, V.: On the Geometry of Similarity Search: Dimensionality Curse and Concentration of Measure. Information Processing Letters. 73 1–2 (2000) 47–51.

    Article  MathSciNet  Google Scholar 

  10. Sellis, T., Roussopoulos, N., Faloutsos, C.: The R +-tree: A Dynamic Index for Multidimensional Objects. Proc. 13rd Int’l Conf. on Very Large Data Bases. Brighton, England. (1987) 507–518.

    Google Scholar 

  11. Stoffel, K., Belkoniene, A.: Parallel k/h-Means Clustering for Large Data Sets. Proc. of the 5th EUROPAR Conf. on Parallel Processing. Toulouse, France. (1999) 1451–1454.

    Google Scholar 

  12. Vleugels, J., Veltkamp, R.C.: Efficient Image Retrieval through Vantage Objects. Proc. of the 3rd Int’l Conf. onVisual Information Systems. Amsterdam, The Netherlands. (1999) 575–584.

    Google Scholar 

  13. Volmer, S.: Tracing Images in Large Databases by Comparison of Wavelet Fingerprints. Proc. of the 2nd Int’l Conf. on Visual Information Systems. La Jolla, CA, USA. (1997) 163–172.

    Google Scholar 

  14. White, D.A., Jain, R.: Similarity Indexing:Algorithms and Performance. Proc. SPIE Vol. 2670. (1996) 65–72.

    Google Scholar 

  15. Yoshitaka, A., Ichikawa, T.:A Survey on Content-Based Retrieval for Multimedia Databases. IEEE Transactions on Knowlegde and Data Engineering. 11 1 (1999) 81–93.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fraunhofer Institute for Computer Graphics, Fraunhoferstr. 5, 64283, Darmstadt, Germany

    Stephan Volmer

Authors
  1. Stephan Volmer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Knowledge Systems Institute, 3420 Main Street, 60076, Skokie, IL, USA

    Shi-Kuo Chang

  2. Dept. of Comp. Science & Information Engineering, National Chiao Tung University, 1001 Ta HsuehRoad, Hsin Chu, Taiwan

    Zen Chen  & Suh-Yin Lee  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Volmer, S. (2002). Fast Approximate Nearest-Neighbor Queries in Metric Feature Spaces by Buoy Indexing. In: Chang, SK., Chen, Z., Lee, SY. (eds) Recent Advances in Visual Information Systems. VISUAL 2002. Lecture Notes in Computer Science, vol 2314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45925-1_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45925-1_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43358-3

  • Online ISBN: 978-3-540-45925-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation