Skip to main content
Log in

A New Indexing Scheme for Content-Based Image Retrieval

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

We propose a new efficient indexing scheme, called the HG-tree, to support content-based retrieval in image databases. Image content is represented by a point in a multidimensional feature space. The types of queries considered are the range query and the nearest-neighbor query, both in a multidimensional space. Our goals are twofold: increasing the storage utilization and decreasing the area covered by the directory regions of the index tree. The high storage utilization and the small directory area reduce the number of nodes that have to be touched during the query processing. The first goal is achieved by suppressing node splitting if possible, and when splitting is necessary, converting two nodes into three. This is done by proposing a good ordering on the directory nodes. The second goal is achieved by maintaining the area occupied by the directory region as small as possible. This is done by introducing the smallest interval that encloses all regions of the lower nodes. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off to some extent. We present the design of our indexing scheme and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed index tree with the buddy-tree, which is one of the most successful point indexing schemes for a multidimensional space. The results show the superiority of our method.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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. of ACM SIGMOD Int. Conf. on Management of Data, 1990, pp. 322–331.

  2. T. Bially, “Space-filling curves: Their generation and their application to bandwidth reduction,” IEEE Trans. Information Theory, pp. 658–664, Nov. 1969.

  3. A.R. Butz, “Alternative algorithm for Hilbert's space-filling curve,” IEEE Trans. Computers, pp. 424–426, April 1971.

  4. D. Comer, “The ubiquitous B-tree,” ACM Computing Surveys, Vol. 11, No. 2, pp. 121–137, 1979.

    Google Scholar 

  5. C. Faloutsos, “Gray codes for partial match and range queries,” IEEE Trans. Software Engineering, Vol. 14, No. 10, pp. 1381–1393, 1988.

    Google Scholar 

  6. C. Faloutsos and S. Roseman, “Fractals for secondary key retrieval,” in Proc. of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989, pp. 247–252.

  7. C. Faloutsos and I. Kamel, “Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension,” in Proc. of SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994, pp. 4–13.

  8. M. Freeston, “The BANG file: A new kind of grid file,” Proc. of ACM SIGMOD Int. Conf. on Management of Data, 1987, pp. 260–269.

  9. M. Freeston, “A general solution of the n-dimensional B-tree problem,” in Proc. of ACM SIGMOD Int. Conf. on Management of Data, 1995, pp. 80–91.

  10. Y. Gong, H.J. Zhang, H.C. Chuan, and M. Sakauchi, “An image database system with content capturing and fast image indexing abilities,” in Proc. of the IEEE Int. Conf. on Multimedia Computing and Systems, 1994, pp. 121–130.

  11. A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1984, pp. 47–57.

  12. D. Hilbert, “Uber die stetige abbildung einer linie auf ein flachenstuck,” Math. Annalen, Vol. 38, 1891.

  13. H.V. Jagadish, “Linear clustering of objects with multiple attributes,” in Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1990, pp. 332–342.

  14. I. Kamel and C. Faloutsos, “Hilbert R-tree: An improved R-tree using fractals,” in Proc. of the 20th VLDB Conf., 1994, pp. 500–509.

  15. A. Kumar, “G-tree: A new data structure for organizing multidimensional data,” IEEE Trans. Knowledge and Data Engineering, Vol. 6, No. 2, pp. 341–347, 1994.

    Google Scholar 

  16. D.B. Lomet and B. Salzberg, “The hB-tree: A robust multi-attribute indexing method,” ACM Trans. Database Systems, Vol. 15, No. 4, pp. 625–658, 1990.

    Google Scholar 

  17. R. Mehrotra and J.E. Gary, “Similar-shape retrieval in shape data management,” IEEE Computer, pp. 57–62, Sept. 1995.

  18. W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, and G. Taubin, “The QBIC project: Querying images by content using color, texture, and shape,” in Proc. of the SPIE Conf. on Storage and Retrieval for Image and Video Databases, 1993, pp. 173–187.

  19. J. Nievergelt, H. Hinterberger, and K.C. Sevcik, “The grid file: An adaptable, symmetric multikey file structure,” ACM Trans. Database Systems, Vol. 9, No. 1, pp. 38–71, 1984.

    Google Scholar 

  20. J.A. Orenstein and T.H. Merrett, “A class of data structures for associative searching,” in Proc. of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984, pp. 181–190.

  21. E.J. Otoo, “Balanced multidimensional extendible hash tree,” in Proc. of the 5th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1986, pp. 100–113.

  22. B.-W. Pagel, H.-W. Six, H. Toben, and P. Widmayer, “Towards an analysis of range query performance in spatial data structures,” in Proc. of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993, pp. 214–221.

  23. G. Peano, “Sur une courbe qui remplit toute une aire plane,” Math. Annalen, Vol. 36, pp. 157–160, 1890.

    Google Scholar 

  24. E.G.M. Petrakis and C. Faloutsos, “Similar searching in large image databases,” Technical Report CS-TR-3388, University of Maryland, 1994.

  25. J.T. Robinson, “The K-D-B-tree: A search structure for large multidimensional dynamic indexes,” in Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1981, pp. 10–18.

  26. A.L. Rosenberg and L. Snyder, “Time-and space-optimality in B-trees,” ACM Trans. Database Systems, Vol. 6, No. 1, pp. 174–183, 1981.

    Google Scholar 

  27. N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest neighbor queries,” in Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1995, pp. 71–79.

  28. B. Seeger and H.-P. Kriegel, “The buddy-tree: An efficient and robust access method for spatial database systems,” in Proc. of the 16th VLDB Conf., 1990, pp. 590–601.

  29. K.-Y. Whang, S.-W. Kim, and G. Wiederhold, “Dynamic maintenance of data distribution for selectivity estimation,” VLDB Journal, Vol. 3, No. 1, pp. 29–51, 1994.

    Google Scholar 

  30. J.K. Wu, Y.H. Ang, P. Lam, H.H. Loh, and A.D. Narasimhalu, “Inference and retrieval of facial images,” Multimedia Systems, Vol. 2, No. 1, pp. 1–14, 1994.

    Google Scholar 

  31. J.K. Wu, A.D. Narasimhalu, B.M. Mehtre, C.P. Lam, and Y.J. Gao, “CORE: A content-based retrieval engine for multimedia information systems,” Multimedia Systems, Vol. 3, No. 1, pp. 25–41, 1995.

    Google Scholar 

  32. Q. Yang, A. Vellaikal, and S. Dao, “MB+-tree: A new index structure for multimedia databases,” in Proc. of the Int. Workshop on MultiMedia Database, 1995, pp. 151–158.

  33. H.J. Zhang and D. Zhong, “A scheme for visual feature based image indexing,” in Proc. IS&T/SPIE Conf. on Storage and Retrieval for Image and Video Databases III, 1995, pp. 36–46.

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cha, GH., Chung, CW. A New Indexing Scheme for Content-Based Image Retrieval. Multimedia Tools and Applications 6, 263–288 (1998). https://doi.org/10.1023/A:1009608331551

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009608331551

Navigation