A New Morphological Measure of Histogram Bimodality

  • Miguel Angel Cataño
  • Joan Climent
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7441)


The presence of multiple modes in a histogram gives important information about data distribution for a great amount of different applications. The dip test has been the most common statistical measure used for this purpose.

Histograms of oriented gradients (HOGs) with a high bimodality have shown to be very useful to detect highly robust keypoints. However, the dip test presents serious disadvantages when dealing with such histograms. In this paper we describe the drawbacks of the dip test for determining HOGs bimodality, and present a new bimodality test, based on mathematical morphology, that overcomes them.


Keypoint detection Bimodality test Histograms of Oriented Gradients Mathematical Morphology Dynamics 


  1. 1.
    Bertrand, G.: On the dynamics. Image Vision Comput. 25(4), 447–454 (2007)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Cataño, M.A., Climent, J.: Keypoint detection based on the unimodality test of hOGs. In: Bebis, G. (ed.) ISVC 2012, Part I. LNCS, vol. 7431, pp. 189–198. Springer, Heidelberg (2012)Google Scholar
  3. 3.
    Dalal, N., Triggs, B.: Histograms of Oriented Gradients for Human Detection. In: IEEE Conference on CVPR , vol. 1, pp. 886–893 (2005)Google Scholar
  4. 4.
    Grimaud, M.: New measure of contrast: the dynamics. Image Algebra and Morphological Image Processing III 1769(1), 292–305 (1992)Google Scholar
  5. 5.
    Hartigan, J.A., Hartigan, P.M.: The Dip Test of Unimodality. Ann. Stat. 13(1), 70–84 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Hartigan, P.M.: Algorithm as 217: Computation of the dip statistic to test for unimodality. J. Roy. Stat. Soc. C-App. 34(3), 320–325 (1985)Google Scholar
  7. 7.
    Jones, R.: Connected filtering and segmentation using component trees. Comput. Vis. Image Und. 75(3), 215–228 (1999)CrossRefGoogle Scholar
  8. 8.
    Lowe, D.G.: Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)CrossRefGoogle Scholar
  9. 9.
    Mattes, J., Richard, M., Demongeot, J.: Tree Representation for Image Matching and Object Recognition. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 298–312. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  10. 10.
    Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE T. Image Process. 15(11), 3531–3539 (2006)CrossRefGoogle Scholar
  11. 11.
    Porikli, F.: Integral histogram: A fast way to extract histograms in cartesian spaces. In: IEEE Computer Vision and Pattern Recognition (CVPR), pp. 829–836 (2005)Google Scholar
  12. 12.
    Salembier, P., Oliveras, A., Garrido, L.: Antiextensive connected operators for image and sequence processing. IEEE T. Image Process. 7(4), 555–570 (1998)CrossRefGoogle Scholar
  13. 13.
    Schmid, C., Mohr, R., Bauckhage, C.: Comparing and Evaluating Interest Points. In: ICCV, pp. 230–235 (1998)Google Scholar
  14. 14.
    Silva, A.G., de Alencar Lotufo, R.: Efficient computation of new extinction values from extended component tree. Pattern Recogn. Lett. 32(1), 79–90 (2011)CrossRefGoogle Scholar
  15. 15.
    Vincent, L., Soille, P.: Watersheds in digital spaces: An efficient algorithm based on immersion simulations. IEEE T. Pattern Anal. 13(6), 583–598 (1991)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Miguel Angel Cataño
    • 1
    • 2
  • Joan Climent
    • 1
    • 2
  1. 1.Pontificia Universidad Católica del PerúPerú
  2. 2.Barcelona Tech (UPC)Spain

Personalised recommendations