Abstract
The existing multi-dimensional index structures are not adequate for indexing higher-dimensional data sets. Although conceptually they can be extended to higher dimensionalities, they usually require time and space that grow exponentially with the dimensionality. In this paper, we analyze the existing index structures and derive some requirements of an index structure for content-based image retrieval. We also propose a new structure, called CIR(Content-based Image Retrieval)-tree, for indexing large amounts of point data in high dimensional space that satisfies the requirements. In order to justify the performance of the proposed structure, we compare the proposed structure with the existing index structures in the various environments. We show through experiments that our proposed structure outperforms the existing structures in terms of retrieval time and storage 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
W. E. Mackay and G. Davenport., “Virtual video editing in interactive multimedia applications,” Communications of the ACM, 32:802–810, July 1989.
Myron Flickner and et. al., “Query by Image and Video Content: The QBIC System.” IEEE Computer, 28(9), 1995.
Charles E. Jacobs, Adam Finkelstein, David H. Salesin., “Fast Multiresolution Image Query.” Proceedings of the 1995 ACM SIGGRAPH, New York, 1995.
W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, G. Taubin., “The QBIC project: Querying image by content using color, texture and shape.” Proceedings SPIE Storage and Retrieval for Image and Video Databases, pages 173–187, February 1993.
Y. Alp Aslandogan, chuck Their, Clement T. Yu, Chengwen Liu, Krishnakumar R. Nair, “Design, Implementation and Evaluation of SCORE(a System for Content based Retrieval of pictures),” Proceedings of 11th international conference of Data Engineering, 1995, pp280–287.
P. M. Kelly, T. M. Cannon and D. R. Hush., “Query by image example: the CANDID approach.,” Proc. SPIE Storage and Retrieval for Image and Video Database III, 2420:238–248, 1995.
C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, W. Equiz., “Efficient and Effective Querying by Image Content,” Journal of Intelligent Information System (JIIS), 3(3):231–262, July 1994.
J. K. Wu, A. Desai Narasimhalu, B. M. Mehtre, C. P. Lam, Y. J. Gao., “CORE: a content-based retrieval engine for multimedia systems.,” ACM Multimedia Systems, 3:25–41, 1995.
N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles ”, ACM SIGMOD, pp.322–331, May 1990.
K.I. Lin, H. Jagadish, and C. Faloutsos, “The TV-tree: An Index Structure for High Dimensional Data”, VLDB Journal, Vol. 3, pp.517–542, 1994.
D. A. White and R. Jain, “Similarity Indexing with the SS-tree,” In Proc. 12th Intl. Conf. On Data Engineering, New Orleans, pp.516–523, 1996.
D.A. White and R. Jain, “Similarity Indexing: Algorithms and Performance,” In Proc. of the SPIE: Storage and Retrieval for Image and Video Databases IV, Vol. 2670, pp.62–75, 1996.
S. Berchtold, D. A. Keim, H-P. Kriegel, “The X-tree:An Index Structure for High-Dimensional Data,” Proceedings of the 22nd VLDB Conference, Bombay, India, 1996
B. Furht, S.W. Smoliar, H. Zhang, “Video and Image Processing in Multimedia Systems,” Kluwer Academic Publishers, 1994.
Lomet. D., “A Review of Recent Work on Multi-attribute Access Methods,” ACM SIGMOD RECORD, Vol. 21, No. 3, pp. 56–63, Sept. 1992.
M. J. Swain and D. H. Ballard., “Color indexing. International Journal of Computer vision,” 7(1): 11–32, 1991.
Y. Gong et al., “An image database system with content capturing and fast image indexing abilities.,” In Proceedings of the International Conference on Multimedia Computing and Systems, pages 121–130, Boston, MA, May 1994. IEEE.
J. T. Robinson, “The K-D-B-Tree: A Search Structure for Large Multidemensional Dynamic Indexes,” ACM SIGMOD, pp. 10–18, Apr. 1981.1. Baldonado, M., Chang, C.-C.K., Gravano, L., Paepcke, A.: The Stanford Digital Library Metadata Architecture. Int. J. Digit. Libr. 1 (1997) 108–121
Guttman A., “R-trees: A Dynamic Index Structure for spatial Searching” Proc. 7th Int. Conf. on Data Engineering, 1991, pp.520–527.
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
Yoo, J.S., Shin, M.K., Lee, S.H., Choi, K.S., Cho, K.H., Hur, D.Y. (1999). An Efficient Index Structure for High Dimensional Image Data. In: Nishio, S., Kishino, F. (eds) Advanced Multimedia Content Processing. AMCP 1998. Lecture Notes in Computer Science, vol 1554. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48962-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-48962-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65762-0
Online ISBN: 978-3-540-48962-7
eBook Packages: Springer Book Archive