Year: 2007
Type: conference-paper
Abstract: Dierent 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 dierent approaches.Especially, we show that min-cuts coincide with watersheds for some particular weight functions.
Source: HAL
Institution: Laboratoire d'Informatique Gaspard-Monge
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2597248654
