Watershed Segmentation with Chamfer Metric

  • Vasily Goncharenko
  • Alexander Tuzikov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4245)


Watershed transformation is introduced as a computation in image graph of a path forest with minimal modified topographic distance in (ℝ + )2. Two algorithms are presented for image segmentation that use a metric defined by a unit neighborhood as well as a chamfer (a,b)-metric. The algorithms use ordered queues to propagate over image pixels simulating the process of flooding. Presented algorithms can be applied to gray-scale images where objects have noticeable boundaries.


Short Path Voronoi Cell Gradient Image Catchment Basin Contour Detection 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Beucher, S., Lantuéjoul, C.: Use of Watersheds in Contour Detection. In: International Workshop on Image Processing, CCETT/IRISA, pp. 2.1–2.12 (1979)Google Scholar
  2. 2.
    Beucher, S.: The Watershed Transformation Applied to Image Segmentation. In: Conference on Signal and Image Processing in Microscopy and Microanalysis, pp. 299–314 (1991)Google Scholar
  3. 3.
    Vincent, L., Soille, P.: Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations. IEEE Trans. Pattern Analysis and Machine Intelligence 13, 583–598 (1991)CrossRefGoogle Scholar
  4. 4.
    Beucher, S., Meyer, F., Dougherty, E.R. (eds.): The Morphological Approach to Segmentation: the Watershed Transformation. Mathematical Morphology in Image Processing, pp. 433–481. Marcel Dekker, New York (1993)Google Scholar
  5. 5.
    Lotufo, R., Falcao, A.: The Ordered Queue and the Optimality of the Watershed Approaches. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds.) Mathematical Morphology and Its Applications to Image and Signal Processing, vol. 18, Kluwer Academic Publishers, Boston (2000)Google Scholar
  6. 6.
    Roerdink, J.B.T.M., Meijster, A.: The Watershed Transform: Definitions, Algorithms and Parallelization Strategies. Fundamenta Informaticae 41, 187–228 (2000)MATHMathSciNetGoogle Scholar
  7. 7.
    Couprie, M., Bertrand, G.: Topological Grayscale Watershed Transformation. In: SPIE Vision Geometry V Proceedings, vol. 3168, pp. 136–146 (1997)Google Scholar
  8. 8.
    Meyer, F.: Topographic Distance and Watershed Lines. Signal Processing 38, 113–125 (1994)MATHCrossRefGoogle Scholar
  9. 9.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)MATHGoogle Scholar
  10. 10.
    Moore, E.: The Shortest Path Through a Maze. In: Proceedings of an International Symposium on the Theory of Switching, Part II, pp. 285–292. Harvard University Press, Cambridge (1959)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vasily Goncharenko
    • 1
  • Alexander Tuzikov
    • 2
  1. 1.National Center of Information Resources and Technologies, National Academy of Sciences of BelarusMinskBelarus
  2. 2.United Institute of Informatics Problems, National Academy of Sciences of BelarusMinskBelarus

Personalised recommendations