Skip to main content
Log in

Uniquely-Determined Thinning of the Tie-Zone Watershed Based on Label Frequency

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

There are many watershed transform algorithms in literature but most of them do not exactly correspond to their respective definition. The solution given by such algorithms depends on their implementation. Others fit with their definition which allows multiple solutions. The solution chosen by such algorithms depends on their implementation too. It is the case of the watershed by image foresting transform that consists in building a forest of trees with minimum path-costs. The recently introduced tie-zone watershed (TZW) has the advantage of not depending on arbitrary implementation choices: it provides a unique and, thereby, unbiased solution. Indeed, the TZW considers all possible solutions of the watershed transform and keeps only the common parts of them as catchment basins whereas parts that differ form a tie zone disputed by many solutions. Although the TZW insures the uniqueness of the solution, it does not prevent from possible large tie zones, sometimes unwanted in segmentation applications. This paper presents a special thinning of the tie zone that leads to a unique solution. Observing all the possible solutions of the watershed by image foresting transform, one can deduce the frequency of the labels associated with each pixel. The thinning consists in assigning the most frequent label while preserving the segmented region connectivity. We demonstrate that the label frequency can be computed both from an immersion-like recursive formula and the proposed fragmented drop paradigm. Finally, we propose an algorithm under the IFT framework that computes the TZW, the label frequency and the thinning simultaneously and without explicit calculation of all the watershed solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Audigier and R. Lotufo, “Tie-zone watershed, bottlenecks andsegmentation robustness analysis,” in XVIII BrazilianSymposium on Computer Graphics and Image Processing(SIBGRAPI'05), IEEE Press: Natal, Brazil, October 2005, pp. 55–62.

    Google Scholar 

  2. R. Audigier, R. Lotufo, and M. Couprie, “The tie-zone watershed:Definition, algorithm and applications,” in Proceedings ofIEEE International Conference on Image Processing (ICIP'05), Genova, Italy, September 2005, Vol. 2, pp. 654–657

    Google Scholar 

  3. C. Berge, Théorie des Graphes et ses Applications,Dunod: Paris, France, 1958

    Google Scholar 

  4. G. Bertrand, “On topological watersheds,” Journal ofMathematical Imaging and Vision, Vol. 22, Nos. 2–3, pp. 217–230,May 2005. Special issue on Mathematical Morphology

    Article  MathSciNet  Google Scholar 

  5. S. Beucher and Ch. Lantuéjoul, “Use of watersheds in contourdetection,” in International Workshop on Image Processing,Real-Time Edge and Motion Detection/Estimation, Rennes: France,1979

    Google Scholar 

  6. S. Beucher and F. Meyer, “The morphological approach tosegmentation: The watershed transform,” in MathematicalMorphology in Image Processing, E.R. Dougherty (Ed.), Marcel Dekker, Inc.: New York (NY), USA,1993, chapter 12, pp. 433–481

    Google Scholar 

  7. A. Bieniek, H. Burkhardt, H. Marschner, M. Nölle, andG. Schreiber, “A parallel watershed algorithmm” in Proceedings of 10th Scandinavian Conference on Image Analysis(SCIA'97), Lappeenranta: Finland, June 1997, pp. 237–244

    Google Scholar 

  8. A. Bieniek and A. Moga, “A connected component approach to thewatershed segmentation,” in Mathematical Morphology and itsApplications to Image and Signal Processing, H.J.A.M. Heijmans and J.B.T.M. Roerdink (Eds.), Kluwer Acad.,Dordrecht: The Netherlands, 1998, pp. 215–222

    Google Scholar 

  9. A. Bieniek and A. Moga, “An efficient watershed algorithm basedon connected components,” Pattern Recognition, Vol. 33, No.6, pp. 907–916, June 2000

    Article  Google Scholar 

  10. M. Couprie and G. Bertrand, “Topological grayscale watershedtransformation,” in SPIE Vision Geometry V Proceedings, 1997, Vol. 3168, pp. 136–146.

    Google Scholar 

  11. M. Couprie, L. Najman, and G. Bertrand, “Algorithms for thetopological watershed,” in Proceedings of the 12thInternational Conference on Discrete Geometry for Computer Imagery(DGCI 2005), Pascal Lienhardt, Eric Andres, andGuillaume Damiand (Eds.), Poitiers: France, January2005, Vol. 3429, pp. 172–182

    Google Scholar 

  12. M. Couprie, L. Najman, and G. Bertrand, “Quasi-linear algorithmsfor the topological watershed,” Journal of MathematicalImaging and Vision, Vol. 22, Nos. 2–3, pp. 231–249, May 2005.Special issue on Mathematical Morphology

    Article  MathSciNet  Google Scholar 

  13. E.W. Dijkstra, “A note on two problems in connexion withgraphs,” Numerische Mathematik, 1959

  14. A.X. Falcão, B.S. da Cunha, and R.A. Lotufo, “Design ofconnected operators using the image foresting transform,” SPIE on Medical Imaging, Vol. 4322, pp. 468–479, February 2001

    Google Scholar 

  15. A.X. Falcão, J. Stolfi, and R.A. Lotufo, “The imageforesting transform: Theory, algorithms, and applications,” IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol.26, No. 1, pp. 19–29, January 2004

    Article  Google Scholar 

  16. M. Grimaud, “A new measure of contrast: the dynamics,” in Image Algebra and Morphological Image Processing III, E. Dougherty, J. Serra, and P. Gader (Eds.), SPIE:San Diego, CA, USA, 1992, Vol. 1769, pp. 292–305

    Google Scholar 

  17. R.A. Lotufo and A.X. Falcão, “The ordered queue and theoptimality of the watershed approaches,” in 5thInternational Symposium on Mathematical Morphology, Kluwer Academic: Palo Alto (CA), USA, June 2000, pp. 341–350

    Google Scholar 

  18. R.A. Lotufo, A.X. Falcão, and F.A. Zampirolli,“IFT-watershed from gray-scale marker,” in Proceedings ofthe 15th Brazilian Symposium on Computer Graphics and ImageProcessing, Fortaleza (CE): Brazil, IEEE Computer Society, October 2002, pp. 146–152

    Google Scholar 

  19. A. Meijster and J.B.T.M. Roerdink, “A disjoint set algorithm forthe watershed transform,” in Proceedings of IX EuropeanSignal Processing Conference (EUSIPCO′98), IEEEComputer Society: Rhodes, Greece, September 1998, pp. 1665–1668

    Google Scholar 

  20. F. Meyer, “Topographic distance and watershed lines,” Signal Processing, No. 38, pp. 113–125, 1994

  21. F. Meyer, “The dynamics of minima and contours,” in Mathematical Morphology and its Application to Image and SignalProcessing (3rd), P. Maragos, R.W. Schafer, and M.A. Butt (Eds.),Computational Imaging and Vision, Kluwer AcademicPublishers: Boston, 1996, pp. 329–336

    Google Scholar 

  22. F. Meyer and S. Beucher, “Morphological segmentation,” Journal of Visual Communication and Image Representation, Vol. 1,No. 1, pp. 21–46, 1990

    Article  Google Scholar 

  23. L. Najman and M. Couprie, “Watershed algorithms and contrastpreservation,” in Discrete geometry for computer imagery,Vol. 2886 of Lecture Notes in Computer Science, Springer,2003, pp. 62–71

    Article  Google Scholar 

  24. L. Najman, M. Couprie, and G. Bertrand, “Watersheds, mosaics andthe emergence paradigm,” Discrete Applied Mathematics, Vol.147, Nos. 2–3, pp. 301–324, April 2005. Special issue on DGCI

    MATH  MathSciNet  Google Scholar 

  25. L. Najman and M. Schmitt, “Watershed of a continuous function,”Signal Process., Vol. 38, No. 1, pp. 99–112, 1994

    Article  Google Scholar 

  26. F. Prêteux, “On a distance function approach for gray-levelmathematical morphology,” in Mathematical Morphology inImage Processing, E.R. Dougherty (Ed.), chapter 10, Marcel Dekker, Inc.: New York (NY), USA, 1993, pp. 323–349.

    Google Scholar 

  27. J.B.T.M. Roerdink and A. Meijster, “The watershed transform:Definitions, algorithms and parallelization strategies,” Fundamenta Informaticae, Vol. 41, Nos. 1–2, pp. 187–228, January2000. Special issue on mathematical morphology

    MATH  MathSciNet  Google Scholar 

  28. L. Vincent and P. Soille, “Watersheds in digital spaces: Anefficient algorithm based on immersion simulations,” IEEETrans. on Pattern Analysis and Machine Intelligence, Vol. 13, No.6, pp. 583–598, 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Romaric Audigier.

Additional information

Romaric Audigier received the Electrical Engineering Diploma from Institut National des Sciences Appliquées (INSA) of Lyon, France, in 2001, the M.Sc. degree in Images and Systems from École Doctorale EEA of Lyon, in 2001, and the M.Sc. degree in Electrical Engineering from the State University of Campinas (UNICAMP), SP, Brazil, in 2004. Since 2004, he has been a Ph.D. student in the Department of Computer Engineering and Industrial Automation at the State University of Campinas (UNICAMP), SP, Brazil. His research interests include image processing and analysis, mathematical morphology, image segmentation, medical imaging and volume visualization.

Roberto Lotufo obtained the Electronic Engineering Diploma from Instituto Tecnologico de Aeronautica, Brazil, in 1978, the M.Sc. degree from the University of Campinas, UNICAMP, Brazil, in 1981, and the Ph.D. degree from the University of Bristol, U.K., in 1990, in Electrical Engineering. He is a full professor at the School of Electrical and Computer Engineering, University of Campinas (UNICAMP), Brazil, where he has worked for since 1981. His principal interests are in the areas of Image Processing and Analysis, Mathematical Morphology, Image Segmentation and Medical Imaging. He is one of the main architects of two morphological toolboxes: MMach for Khoros, and SDC Morphology Toolbox for MATLAB. He is the executive director of Inova Unicamp, the agency for innovation at Unicamp, since 2004. Prof. Lotufo has published over 50 refereed international journal and full conference papers.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Audigier, R., Lotufo , R. Uniquely-Determined Thinning of the Tie-Zone Watershed Based on Label Frequency. J Math Imaging Vis 27, 157–173 (2007). https://doi.org/10.1007/s10851-007-0780-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-007-0780-4

Keywords

Navigation