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

Authors:
Cédric Allène;Jean-Yves Audibert;Michel Couprie;Renaud Keriven
Affiliations:
Université Paris-Est, CERTIS, Ecole des Ponts ParisTech, France and Université Paris-Est, Laboratoire d'Informatique Gaspard Monge, íquipe A3SI, ESIEE Paris, France;Université Paris-Est, CERTIS, Ecole des Ponts ParisTech, France;Université Paris-Est, Laboratoire d'Informatique Gaspard Monge, íquipe A3SI, ESIEE Paris, France;Université Paris-Est, CERTIS, Ecole des Ponts ParisTech, France
Venue:
Image and Vision Computing
Year:
2010

Citing 10
Cited 3

Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence
The complexity of multiway cuts (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Geodesic Saliency of Watershed Contours and Hierarchical Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A minimum spanning tree algorithm with inverse-Ackermann type complexity

Journal of the ACM (JACM)
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to Algorithms

Introduction to Algorithms
A New Algorithm for Energy Minimization with Discontinuities

EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
On Topological Watersheds

Journal of Mathematical Imaging and Vision
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle

IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological grayscale reconstruction in image analysis: applications and efficient algorithms

IEEE Transactions on Image Processing

Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts

ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
GC-ASM: Synergistic integration of graph-cut and active shape model strategies for medical image segmentation

Computer Vision and Image Understanding
A path- and label-cost propagation approach to speedup the training of the optimum-path forest classifier

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

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.