Abstract
The most frequently occurring problem in image retrieval is find-the-similar-image, which in general is finding the nearest neighbor. From the literature, it is well known that k-d trees are efficient methods of finding nearest neighbors in high dimensional spaces. In this paper we survey the relevant k-d tree literature, and adapt the most promising solution to the problem of image retrieval by finding the best parameters for the bucket size and threshold. We also test the system on the Corel Studio photo database of 18,724 images and measure the user response times and retrieval accuracy.
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
J.H. Friedman, J.L. Bentley, and R.A. Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software, 3(3), p. 209–226, Sep. 1977
J.L. Bentley, K-d Trees for Semidymamic point sets, in Proc. 6th Ann. ACM Sympos. Comput. Geom., p. 187–197, 1990
D.A. White and R. Jain, Algorithms and Strategies for Similarity Retrieval, Visual Computing Laboratory, University of California, San Diego, 1996
D.A. White and R. Jain, Similarity Indexing: Algorithms and Performance, Visual Computing Laboratory, University of California, San Diego, 1997
S. Arya, Nearest Neighbor Searching and Applications, PhD thesis, Computer Vision Laboratory, University of Maryland, College Park, 1995
S. Arya, D. Mount, An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions, in Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, p.573–582, 1994
R.C. Gonzalez and R.E. Woods, Digital Image Processing, Addison-Wesley, 1992
R. Egas, Benchmarking of Visual Query Algorithms, Internal Report 97-06, Computer Science Dept., Leiden University, 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Egas, R., Huijsmans, N., Lew, M., Sebe, N. (1999). Adapting k-d Trees to Visual Retrieval. In: Huijsmans, D.P., Smeulders, A.W.M. (eds) Visual Information and Information Systems. VISUAL 1999. Lecture Notes in Computer Science, vol 1614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48762-X_66
Download citation
DOI: https://doi.org/10.1007/3-540-48762-X_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66079-8
Online ISBN: 978-3-540-48762-3
eBook Packages: Springer Book Archive