Skip to main content
SpringerLink
Log in

Fusion Graphs: Merging Properties and Watersheds

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

Abstract

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected regions, separated by a frontier. If the frontier set cannot be reduced without merging some regions then we call it a cleft, or binary watershed. In a general graph framework, merging two regions is not straightforward. We define four classes of graphs for which we prove, thanks to the notion of cleft, that some of the difficulties for defining merging procedures are avoided. Our main result is that one of these classes is the class of graphs in which any cleft is thin. None of the usual adjacency relations on ℤ2 and ℤ3 allows a satisfying definition of merging. We introduce the perfect fusion grid on ℤn, a regular graph in which merging two neighboring regions can always be performed by removing from the frontier set all the points adjacent to both regions.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alexander, J.C., Thaler, A.I.: The boundary count of digital pictures. J. Assoc. Comput. Mach. 18, 105–112 (1971)

    MATH  MathSciNet  Google Scholar 

  2. Beineke, L.W.: On derived graphs and digraphs. In: Sachs, H., Voss, H.J., Walther, H. (eds.) Beiträge zur Graphen Theorie, pp. 17–23. Teubner, Leipzig (1968)

    Google Scholar 

  3. Berge, C.: Graphes et Hypergraphes. Dunod, Paris (1970)

    MATH  Google Scholar 

  4. Bertrand, G.: On topological watersheds. J. Math. Imaging Vis. 22(2–3), 217–230 (2005). Special issue on Mathematical Morphology

    Article  MathSciNet  Google Scholar 

  5. Bertrand, G., Malandain, G.: A new characterization of three-dimensional simple points. Pattern Recogn. Lett. 15(2), 169–175 (1994)

    Article  MATH  Google Scholar 

  6. Beucher, S., Lantuéjoul, C.: Use of watersheds in contour detection. In: Proc. Int. Workshop on Image Processing Real-Time Edge and Motion Detection/Estimation (1979)

  7. Couprie, M., Bertrand, G.: Topological grayscale watershed transform. In: SPIE Vision Geometry V Proceedings, vol. 3168, pp. 136–146 (1997)

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

    Article  MathSciNet  Google Scholar 

  9. Cousty, J., Bertrand, G., Couprie, M., Najman, L.: Fusion graphs, region merging and watersheds. In: Kuba, A., Palágyi, K., Nyúl, L.G. (eds.) Discrete Geometry for Computer Imagery. Lecture Notes in Computer Science, vol. 4245, pp. 343–354. Springer, Berlin (2006)

    Chapter  Google Scholar 

  10. Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watersheds, minimum spanning forests, and the drop of water principle. Technical Report IGM2007-01, Université de Marne-la-Vallée (2007, submitted)

  11. Cousty, J., Couprie, M., Najman, L., Bertrand, G.: Grayscale watersheds on perfect fusion graphs. In: Combinatorial Image Analysis. Lecture Notes in Computer Science, vol. 4040, pp. 60–73. Springer, Berlin (2006)

    Chapter  Google Scholar 

  12. Cousty, J., Couprie, M., Najman, L., Bertrand, G.: Weighted fusion graphs: merging properties and watersheds. Technical Report IGM2007-09, Université de Marne-la-Vallée (2007, submitted)

  13. Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vis. Graph. Image Process. 48, 357–393 (1989)

    Article  Google Scholar 

  14. Meyer, F., Beucher, S.: Morphological segmentation. J. Vis. Commun. Image Represent. 1(1), 21–46 (1990)

    Article  Google Scholar 

  15. Najman, L., Couprie, M., Bertrand, G.: Watersheds, mosaics and the emergence paradigm. Discrete Appl. Math. 147(2–3), 301–324 (2005). Special issue on DGCI

    Article  MATH  MathSciNet  Google Scholar 

  16. Pavlidis, T.: In: Structural Pattern Recognition. Springer Series in Electrophysics, vol. 1, pp. 90–123. Springer, Berlin (1977). Segmentation techniques, chaps. 4, 5

    Google Scholar 

  17. Rosenfeld, A., Kak, A.C.: Digital Picture Processing. Academic, San Diego (1982). Vol. 2, chap. 10, sect. 10.4.2.d (Region merging)

    Google Scholar 

  18. Tutte, W.T.: Graph Theory. Cambridge University Press, Cambridge (1984)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IGM, Unité Mixte de Recherche CNRS-UMLV-ESIEE UMR 8049, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, BP99, 93162, Noisy-le-Grand Cedex, France

    J. Cousty, G. Bertrand, M. Couprie & L. Najman

Authors
  1. J. Cousty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Bertrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Couprie
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. L. Najman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Couprie.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cousty, J., Bertrand, G., Couprie, M. et al. Fusion Graphs: Merging Properties and Watersheds. J Math Imaging Vis 30, 87–104 (2008). https://doi.org/10.1007/s10851-007-0047-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-007-0047-0

Keywords

Search

Navigation