Abstract
Most high-dimensional indexing structures proposed for similarity query in content-based image retrieval (CBIR) systems are tree-structured. The quality of a high-dimensional tree-structured index is mainly determined by its insertion algorithm. Our approach focuses on an important phase in insertion, that is, the tree descending phase, when the tree is explored to find a host node to accommodate the vector to be inserted. We propose to integrate a heuristic algorithm in tree descending in order to find a better host node and thus improve the quality of the resulting index. A heuristic criteria for child selection has been developed, which takes into account both the similarity-based distance and the radius-increasing of the potential host node. Our approach has been implemented and tested on an image database. Our experiments show that the proposed approach can improve the quality of high-dimensional indices without much run-time overhead.
This is a preview of subscription content, log in via an institution to check access.
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
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. 1990 ACM-SIGMOD Int. Conf. Management of Data, pages 322–331, Atlantic City, NJ, June 1990.
S. Berchtold, D. Keim, and H. Kriegel. The X-tree: an index structure for high-dimensional data. In Proc. 22nd VLDB, pages 28–39, Mumbai, India,, 1996.
P. Ciaccia, M. Patella, and P. Zezula. M-tree: an efficient access method for similarity search in metric spaces. In Proc. 23rd VLDB, pages 426–435, Athens, Greece, 1997.
J. H. Friedman, J. H. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. In ACM Trans. on Mathematical Software, pages 209–226, Vol. 3, Sept. 1977.
V. Gudivada and V. Raghavan. Content-based image retrieval systems. In IEEE Computer, pages 18–22, Vol 28, No. 9, 1995.
A. Guttman. R-tree: A dynamic index structure for spatial searching. In Proc. 1984 ACM-SIGMOD Int. Conf. Management of Data, June 1984.
M.-K. Hu. Pattern recognition by moment invariants. Proc. IRE, 49, Sept. 1961.
N. Katayama and S. Satoh. The SR-tree: an indexing structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 369–380, Tucson, Arizona, 1997.
P. Kelly, T. Cannon, and D. Hush. Query by image example: the CANDID approach. In Proc. Storage and Retrieval for Image and Video Databases III, pages 238–248, SPIE Vol. 2420, 1995.
R. Kurniawati, J. Jin, and J. Shepherd. The SS+-tree: an improved indexing structure for similarity searches in a high-dimensional feature space. In Proc., pages 110–120, SPIE Vol. 3022, 1997.
W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, and C. Taubin. The QBIC project: Querying images by content using color, texture, and shape. In Proc. Storage and Retrieval for Image and Video Databases, pages 173–187, SPIE Vol. 1908, 1993.
D. White and R. Jain. Similarity indexing with the SS-tree. In Proc. 12th IEEE Int. Conf. on Data Engineering, pages 516–523, New Orleans, Louisiana, 1996.
D. White and R. Jain. Algorithms and strategies for similarity retrieval. In Technical Report, Department of Computer Science and Engineering, University of California, San Diego, 1997.
P. Winston. Artificial Intelligence (2nd Ed.). Addison-Wesley, 1984.
C. T. Zahn and R. Z. Roskies. Fourier descriptors for plane closed curves. IEEE Trans. on Computers, 21:269–281, March 1972.
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
Fu, Y., Teng, JC. (1999). Improving High-Dimensional Indexing with Heuristics for Content-Based Image Retrieval. In: Agouris, P., Stefanidis, A. (eds) Integrated Spatial Databases. ISD 1999. Lecture Notes in Computer Science, vol 1737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46621-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-46621-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66931-9
Online ISBN: 978-3-540-46621-5
eBook Packages: Springer Book Archive