Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing

ISMM 2009: Mathematical Morphology and Its Application to Signal and Image Processing pp 181–192Cite as

Ultrametric Watersheds

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5720))

Abstract

We study hierachical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exists a bijection between the set of ultrametric watersheds and the set of hierarchical edge-segmentations.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barthélemy, J.P., Brucker, F., Osswald, C.: Combinatorial optimization and hierarchical classifications. 4OR: A Quarterly Journal of Operations Research 2(3), 179–219 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Najman, L.: Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation. Technical Report IGM 2009-07, Université Paris-Est, Institut Gaspard Monge (2009)

    Google Scholar 

  3. Benzécri, J.: L’Analyse des données: la Taxinomie, vol. 1. Dunod (1973)

    Google Scholar 

  4. Johnson, S.: Hierarchical clustering schemes. Psychometrika 32, 241–254 (1967)

    Article  Google Scholar 

  5. Jardine, N., Sibson, R.: Mathematical taxonomy. Wiley, Chichester (1971)

    MATH  Google Scholar 

  6. Pavlidis, T.: Hierarchies in structural pattern recognition. Proceedings of the IEEE 67(5), 737–744 (1979)

    Article  Google Scholar 

  7. Soille, P.: Constrained connectivity for hierarchical image decomposition and simplification. IEEE Trans. Pattern Anal. Mach. Intell. 30(7), 1132–1145 (2008)

    Article  Google Scholar 

  8. Najman, L., Schmitt, M.: Geodesic saliency of watershed contours and hierarchical segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 18(12), 1163–1173 (1996)

    Article  Google Scholar 

  9. Guigues, L., Cocquerez, J.P., Men, H.L.: Scale-sets image analysis. International Journal of Computer Vision 68(3), 289–317 (2006)

    Article  Google Scholar 

  10. Arbeláez, P.A., Cohen, L.D.: A metric approach to vector-valued image segmentation. International Journal of Computer Vision 69(1), 119–126 (2006)

    Article  Google Scholar 

  11. Pavlidis, T.: Structural Pattern Recognition. Springer Series in Electrophysics, vol. 1, pp. 90–123. Springer, Heidelberg (1977); segmentation techniques, ch. 4–5

    MATH  Google Scholar 

  12. Meyer, F., Beucher, S.: Morphological segmentation. Journal of Visual Communication and Image Representation 1(1), 21–46 (1990)

    Article  Google Scholar 

  13. Meyer, F.: Morphological segmentation revisited. In: Space, Structure and Randomness, pp. 315–347. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Meyer, F., Najman, L.: Segmentation, arbre de poids minimum et hiérarchies. In: Najman, L., Talbot, H. (eds.) Morphologie mathématique 1: approches déterministes, pp. 201–233. Lavoisier, Paris (2008)

    Google Scholar 

  15. Roerdink, J.B.T.M., Meijster, A.: The watershed transform: Definitions, algorithms and parallelization strategies. Fundamenta Informaticae 41(1-2), 187–228 (2001)

    MathSciNet  MATH  Google Scholar 

  16. Bertrand, G.: On topological watersheds. J. Math. Imaging Vis. 22(2-3), 217–230 (2005)

    Article  MathSciNet  Google Scholar 

  17. Najman, L., Couprie, M., Bertrand, G.: Watersheds, mosaics and the emergence paradigm. Discrete Appl. Math. 147(2-3), 301–324 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Cousty, J., Bertrand, G., Couprie, M., Najman, L.: Fusion graphs: merging properties and watersheds. J. Math. Imaging Vis. 30(1), 87–104 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Cousty, J., Najman, L., Bertrand, G., Couprie, M.: Weighted fusion graphs: merging properties and watersheds. Discrete Appl. Math. 156(15 ), 3011–3027 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  20. Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: minimum spanning forests, and the drop of water principle. IEEE Trans. Pattern Anal. Mach. Intell. (to appear, 2009)

    Google Scholar 

  21. Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  22. Kong, T., Rosenfeld, A.: Digital topology: Introduction and survey. Comput. Vision Graph. Image Process. 48(3), 357–393 (1989)

    Article  Google Scholar 

  23. Cousty, J., Najman, L., Serra, J.: Some morphological operators in graph spaces. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 149–160. Springer, Heidelberg (2009)

    Google Scholar 

  24. Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: thinnings, shortest-path forests and topological watersheds. IEEE Trans. Pattern Anal. Mach. Intell. (to appear, 2009)

    Google Scholar 

  25. Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Trans. Image Proc. 7(4), 555–570 (1998)

    Article  Google Scholar 

  26. Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Trans. Image Proc. 15(11), 3531–3539 (2006)

    Article  Google Scholar 

  27. Krasner, M.: Espaces ultramétrique. C.R. Acad. Sci. Paris 219, 433–435 (1944)

    MathSciNet  MATH  Google Scholar 

  28. Leclerc, B.: Description combinatoire des ultramétriques. Mathématique et sciences humaines 73, 5–37 (1981)

    MATH  Google Scholar 

  29. Gower, J., Ross, G.: Minimum spanning tree and single linkage cluster analysis. Appl. Stats. 18, 54–64 (1969)

    Article  MathSciNet  Google Scholar 

  30. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Mathemat. Soc. 7, 48–50 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  31. Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. J. Math. Imaging Vis. 22(2-3), 231–249 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  32. Cousty, J., Najman, L., Serra, J.: Raising in watershed lattices. In: 15th IEEE ICIP 2008, San Diego, USA, October 2008, pp. 2196–2199 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Gaspard-Monge, Equipe A3SI, Université Paris-Est, ESIEE Paris, France

    Laurent Najman

Authors
  1. Laurent Najman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computing Science, University of Groningen, P. O. Box 407, 9700, Groningen, AK, The Netherlands

    Michael H. F. Wilkinson

  2. Institute for Mathematics and Computing Science, University of Groningen, P.O. Box 800, 9700, Groningen, AK, The Netherlands

    Jos B. T. M. Roerdink

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Najman, L. (2009). Ultrametric Watersheds. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds) Mathematical Morphology and Its Application to Signal and Image Processing. ISMM 2009. Lecture Notes in Computer Science, vol 5720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03613-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03613-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03612-5

  • Online ISBN: 978-3-642-03613-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation