An Efficient Distance Between Multi-dimensional Histograms for Comparing Images (original) (raw)

Abstract

The aim of this paper is to present an efficient distance between n-dimensional histograms. Some image classification or image retrieval techniques use the distance between histograms as a first step of the classification process. For this reason, some algorithms that find the distance between histograms have been proposed in the literature. Nevertheless, most of this research has been applied on one-dimensional histograms due to the computation of a distance between multi-dimensional histograms is very expensive. In this paper, we present an efficient method to compare multi-dimensional histograms in O(2z), where z represents the number of bins. Results show a huge reduction of the time consuming with no recognition-ratio reduction.

Chapter PDF

Similar content being viewed by others

References

  1. Cha, S.-H., Srihari, S.N.: On measuring the distance between histograms. Pattern Recognition 35, 1355–1370 (2002)
    Article MATH Google Scholar
  2. Rubner, Y., Tomasi, C., Guibas, L.J.: A Metric for Distributions with Applications to Image Databases. International Journal of Computer Vision 40(2), 99–121 (2000)
    Article MATH Google Scholar
  3. Numerical Recipes in C: The Art of Scientific Computing, ISBN 0-521-43108-5
    Google Scholar
  4. Russell, E.J.: Extension of Dantzig’s algorithm to finding an initial near-optimal basis for the transportation problem. Operations Research 17, 187–191 (1969)
    Article MATH Google Scholar
  5. Serratosa, F., Sanfeliu, A.: Signatures versus Histograms: Definitions, Distances and Algorithms. Pattern Recognition 39(5), 921–934 (2006)
    Article MATH Google Scholar
  6. Jou, F.-D., Fan, K.-Ch., Chang, Y.-L.: Efficient matching of large-size histograms. Pattern Recognition Letters 25, 277–286 (2004)
    Article Google Scholar
  7. http://www1.cs.columbia.edu/CAVE/research/softlib/coil-100.html

Download references

Author information

Authors and Affiliations

  1. Dept. d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Spain
    Francesc Serratosa & Gerard Sanromà

Authors

  1. Francesc Serratosa
  2. Gerard Sanromà

Editor information

Editors and Affiliations

  1. Hong Kong University of Science and Technology,
    Dit-Yan Yeung
  2. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China
    James T. Kwok
  3. Instituto de Telecomunicações, Instituto Superior Técnico, Lisbon, Portugal
    Ana Fred
  4. Department of Electrical and Electronic Engineering, University of Cagliari, Piazza d’Armi, 09123, Cagliari, Italy
    Fabio Roli
  5. Faculty of Electrical Engineering, Mathematics and Computer Science, Information and Communication Theory Group, Delft University of Technology, Delft, The Netherlands
    Dick de Ridder

Rights and permissions

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Serratosa, F., Sanromà, G. (2006). An Efficient Distance Between Multi-dimensional Histograms for Comparing Images. In: Yeung, DY., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2006. Lecture Notes in Computer Science, vol 4109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11815921\_45

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us