A Fast Distance Between Histograms (original) (raw)

Abstract

In this paper we present a new method for comparing histograms. Its main advantage is that it takes less time than previous methods.

The present distances between histograms are defined on a structure called signature, which is a lossless representation of histograms. Moreover, the type of the elements of the sets that the histograms represent are ordinal, nominal and modulo.

We show that the computational cost of these distances is O(_z_′) for the ordinal and nominal types and O(z ′2) for the modulo one, where _z_′ is the number of non-empty bins of the histograms. In the literature, the computational cost of the algorithms presented depends on the number of bins in the histograms. In most applications, the histograms are sparse, so considering only the non-empty bins dramatically reduces the time needed for comparison.

The distances we present in this paper are experimentally validated on image retrieval and the positioning of mobile robots through image recognition.

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. Kamarainen, J.-K., Kyrki, V., Llonen, J., Kälviäinen, H.: Improving similarity measures of histograms using smoothing projections. Pattern Recognition Letters 24, 2009–2019 (2003)
    Article Google Scholar
  4. Jou, F.-D., Fan, K.-C., Chang, Y.-L.: Efficient matching of large-size histograms. Pattern Recognition Letters 25, 277–286 (2004)
    Article Google Scholar
  5. Hafner, J., Sawhney, J.S., Equitz, W., Flicker, M., Niblack, W.: Efficient Colour Histogram Indexing for Quadratic Form Distance Functions. Trans. On Pattern Analysis and Machine Intelligence 17(7), 729–735 (1995)
    Article Google Scholar
  6. Morovic, J., Shaw, J., Sun, P.-L.: A fast, non-iterative and exact histogram matching algorithm. Pattern Recognition Letters 23, 127–135 (2002)
    Article MATH Google Scholar
  7. Serratosa, F., Sanfeliu, A.: Signatures versus Histograms: Definitions, Distances and Algorithms, Submitted to Pattern recognition (2005)
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Dept. d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira I Virgili, Spain
    Francesc Serratosa
  2. Institut de Robòtica i Informàtica Industrial, Universitat Politècnica de Catalunya, Spain
    Alberto Sanfeliu

Authors

  1. Francesc Serratosa
  2. Alberto Sanfeliu

Editor information

Editors and Affiliations

  1. Dept. System Engineering and Automation, Universitat Politècnica de Catalunya (UPC) Barcelona, Spain
    Alberto Sanfeliu
  2. Pattern Recognition Group, ICIMAF, Havana, Cuba
    Manuel Lazo Cortés

Rights and permissions

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Serratosa, F., Sanfeliu, A. (2005). A Fast Distance Between Histograms. In: Sanfeliu, A., Cortés, M.L. (eds) Progress in Pattern Recognition, Image Analysis and Applications. CIARP 2005. Lecture Notes in Computer Science, vol 3773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11578079\_105

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