PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Some links between min-cuts, optimal spanning forests and watersheds
Cedric Allene, Jean-Yves Audibert, Michel Couprie, Jean Cousty and Renaud Keriven
In: ISMM 2007, 10-13 Oct 2007, Bresil.

Abstract

Different optimal structures: minimum cuts, minimum spanning forests and shortest-path forests, have been used as the basis for powerful image segmentation procedures. The well-known notion of watershed also falls into this category. In this paper, we present some new results about the links which exist between these different approaches. Especially, we show that min-cuts coincide with watersheds for some particular weight functions.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Machine Vision
Theory & Algorithms
ID Code:3157
Deposited By:Jean-Yves Audibert
Deposited On:29 December 2007