Some links between extremum spanning forests, watersheds and min-cuts

Cédric Allène , Jean-Yves Audibert (1) , Michel Couprie (1) , Renaud Keriven (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

Minimum cuts, extremum spanning forests and watersheds have been used as the basis for powerful image segmentation procedures. In this paper, we present some results about the links which exist between these different approaches. Especially, we show that extremum spanning forests are particular cases of watersheds from arbitrary markers and that min-cuts coincide with extremum spanning forests for some particular weight functions.

Domaines: Informatique et langage [cs.CL]

Cédric Allène, Jean-Yves Audibert, Michel Couprie, Renaud Keriven. Some links between extremum spanning forests, watersheds and min-cuts. Image and Vision Computing, 2010, 28 (10), pp.1460-1471. ⟨10.1016/j.imavis.2009.06.017⟩. ⟨hal-00622507⟩