Abstract
This paper presents the metric histogram, a new and efficient technique to capture the brightness feature of images, allowing faster retrieval of images based on their content. Histograms provide a fast way to chop down large subsets of images, but are difficult to be indexed in existing data access methods. The proposed metric histograms reduce the dimensionality of the feature vectors leading to faster and more flexible indexing and retrieval processes. A new metric distance function DM( ) to measure the dissimilarity between images through their metric histograms is also presented. This paper shows the improvements obtained using the metric histograms over the traditional ones, through experiments for answering similarity queries over two databases containing respectively 500 and 4,247 magnetic resonance medical images. The experiments performed showed that metric histograms are more than 10 times faster than the traditional approach of using histograms and keep the same recovering capacity.
Chapter PDF
Similar content being viewed by others
References
Guttman, A., “R-Tree: A dynamic Index Structure for Spatial Searching,” in ACM SIGMOD, Boston, MA, 1984.
Bentley, J.L., “Multidimensional Binary Search Trees Used for Associative Searching,” Comunications of the ACM, vol. 18, pp. 509–517, 1975.
Korn, F., Pagel, B.-U., Faloutsos, C., “On the ‘Dimensionality Curse’ and the ’Self-Similarity Blessing’, ” IEEE TKDE, vol. 13, pp. 96–111, 2001.
Brunelli, R. and Mich, O., “On the Use of Histograms for Image Retrieval,” in IFFE Intl. Conf. on Multimedia Computing and Systems (ICMCS), Florence, Italy, 1999.
Berman, A. and Shapiro, L.G., “Selecting Good Keys for Triangle-Inequality-Based Pruning Algorithms,” in Intl. Workshop on Content-Based Access of Image and Video Databases (CAIVD ‘88), Bombay, India, 1998.
Chavez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L., “Searching in Metric Spaces,” to appear in the ACM Computing Surveys, 2001.
Siegel, E.L. and Kolodner, R.M., Filmless Radiology. New York City, NY: Springer Verlag, 1999.
Sellis, T.K., Roussopoulos, N., Faloutsos, C., “The R+-tree: A Dynamic Index for Multidimensional Objects,” in VLDB, Brighton, England, 1987.
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B., “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,” in ACM SIGMOD, 1990.
Robinson, J.T., “The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes,” in ACM International Conference on Management of Data - SIGMOD, SIGMOD Conference 1981:, 1981.
Liao, S., Lopez, M.A., Leutenegger, S.T., “High Dimensional Similarity Search With Space Filling Curves,” in IEEE ICDE, Heidelberg, Germany, 2001.
Samet, H., “Spatial data structures in Modem Database Systems: The Object Model, Interoperability, and Beyond,”„ W. Kim, Ed.: Addison-Wesley/ACM Press, 1995, pp. 361–385.
Gaede, V. and Günther, O., “Multidimensional Access Methods, ” ACM Computing Surveys, vol. 30, pp. 170–231, 1998.
Berchtold, S., Keim, D.A., Kriegel, H.-P., “The X-tree: An Index Structure for High-dimensional data,” in VLDB, Bombay, India, 1996.
Lin, K.-I.D., Jagadish, H.V., Faloutsos, C., “The TV-Tree: An Index Structure for High-Dimensional Data,” VLDB Journal, vol. 3, pp. 517–542, 1994.
Burkhard, W.A. and Keller, R.M., “Some Approaches to Best-Match File Searching, ” CACM, vol. 16, pp. 230–236, 1973.
Ciaccia, P., Patella, M., Zezula, P., “M-tree: An efficient access method for similarity search in metric spaces,” in VLDB, Athens, Greece, 1997.
Traîna, C., Jr., Traîna, A.J.M., Seeger, B., Faloutsos, C., “Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes,” in Intl. Conf. on Extending Database Technology, Konstanz, Germany, 2000.
Santos, R.F., Filho, Traîna, A.J.M., Traîna, C., Jr., Faloutsos, C., “Similarity Search without Tears: The OMNI Family of All-purpose Access Methods,” in IEEE ICDE, Heidelberg, Germany, 2001.
Bozkaya, T. and Özsoyoglu, Z.M., “Indexing Large Metric Spaces for Similarity Search Queries, ” ACM Transactions on Database Systems (TODS), vol. 24, pp. 361–404, 1999.
Smeulders, A.W.M., Worring, M., Santini, S., Gupta, A., Jain, R., “Content-Based Image Retrieval at the End of the Early Years,” IEEE Trans. on PAMI, vol. 22, 2000.
Aslandogan, Y.A. and Yu, C.T., “Techniques and Systems for Image and Video Retrieval,” IEEE TKDE, vol. 11, pp. 56–63, 1999.
Güntzer, U., Balke, W.-T., Kiessling, W., “Optimizing Multi-Feature Queries for Image Databases,” in VLDB, Cairo - Egypt, 2000.
Flickner, M. and alli, e., “Query by Image and Video Content: The QBIC System,” IEEE Computer, vol. 28, pp. 23–32, 1995.
Pass, G., Zabih, R., Miller, J., “Comparing Images Using Color Coherence Vector,” in ACM Multimedia, Boston, MA, 1996.
Tuytelaars, T. and Gool, L.v., “Content-based Image Retrieval Based on Local Affinely Invariant Regions,” in Information and Information Systems (Visual’99), 1999.
Gimel’farb, G.L. and Jain, A.K., “On Retrieving Textured Images from an Image Database,” Pattern Recognition, vol$129, pp. 1, 461–1, 483, 1996.
Traîna, C., Jr., Traîna, A.J.M., Faloutsos, C., Seeger, B., “Fast Indexing and Visualization of Metric Datasets Using Slim-trees,” IEEE TKDE, vol. to appear, 2002.
Yamamoto, H., Iwasa, H., Yokoya, N., Takemura, H., “Content-based Similarity Retrieval of Images Based on Spatial Color Distributions,” in 10th Intl. Conference on Image Analysis and Processing, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Traina, A.J.M., Traina, C., Bueno, J.M., Azevedo-Marques, P.M. (2002). The Metric Histogram: A New and Efficient Approach for Content-Based Image Retrieval. In: Zhou, X., Pu, P. (eds) Visual and Multimedia Information Management. VDB 2002. IFIP — The International Federation for Information Processing, vol 88. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35592-4_21
Download citation
DOI: https://doi.org/10.1007/978-0-387-35592-4_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6935-7
Online ISBN: 978-0-387-35592-4
eBook Packages: Springer Book Archive