Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
527197 | Image and Vision Computing | 2010 | 12 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Cédric Allène, Jean-Yves Audibert, Michel Couprie, Renaud Keriven,