Skip to main content
SpringerLink
Log in

Flooding Edge Weighted Graphs

  • Conference paper
Graph-Based Representations in Pattern Recognition (GbRPR 2013)

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

Abstract

This paper characterizes floodings on edge weighted graphs. Of particular interest are the highest floodings of a graph below a ceiling function defined on the nodes. Two classes of algorithms for their construction are presented. The first are applied on the dendrogram representing the hierarchy associated to the edge weighted graph. The second consist in shortest distance algorithms on the graph itself.

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

Access this chapter

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Marcotegui, B., Beucher, S.: Fast implementation of waterfalls based on graphs. In: ISMM05: Mathematical Morphology and its Applications to Signal Processing, pp. 177–186 (2005)

    Google Scholar 

  2. Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Minimum spanning forests and the drop of water 1principle. IEEE Transactions on Pattern Analysis and Machine Intelligence 31, 1362–1374 (2009)

    Article  Google Scholar 

  3. Meyer, F.: Minimal spanning forests for morphological segmentation. In: ISMM94: Mathematical Morphology and its Applications to Signal Processing, pp. 77–84 (1994)

    Google Scholar 

  4. Meyer, F.: Flooding and segmentation. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds.) Mathematical Morphology and its Applications to Image and Signal Processing. Computational Imaging and Vision, vol. 18, pp. 189–198 (2002)

    Google Scholar 

  5. Moore, E.F.: The shortest path through a maze. In: Proc. Int. Symposium on Theory of Switching, vol. 30, pp. 285–292 (1957)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CMM-Centre de Morphologie Mathématique, Mathématiques et Systèmes, MINES ParisTech, France

    Fernand Meyer

Authors
  1. Fernand Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Pattern Recognition and Image Processing, Vienna University of Technology, Favoritenstr. 9-11, 186-3, 1040, Vienna, Austria

    Walter G. Kropatsch , Nicole M. Artner  & Yll Haxhimusa ,  & 

  2. Department of Computer Science, University of Münster, Einsteinstr. 62, 48149, Münster, Germany

    Xiaoyi Jiang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, F. (2013). Flooding Edge Weighted Graphs. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2013. Lecture Notes in Computer Science, vol 7877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38221-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38221-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38220-8

  • Online ISBN: 978-3-642-38221-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation