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

Authors:
Jean Cousty;Laurent Najman
Affiliations:
Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, A3SI, ESIEE;Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, A3SI, ESIEE
Venue:
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Year:
2011

Citing 21
Cited 3

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Geodesic Saliency of Watershed Contours and Hierarchical Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Efficient Graph-Based Image Segmentation

International Journal of Computer Vision
Quasi-Linear Algorithms for the Topological Watershed

Journal of Mathematical Imaging and Vision
Scale-Sets Image Analysis

International Journal of Computer Vision
A Metric Approach to Vector-Valued Image Segmentation

International Journal of Computer Vision
Seed-Relative Segmentation Robustness of Watershed and Fuzzy Connectedness Approaches

SIBGRAPI '07 Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

IEEE Transactions on Computers
Weighted fusion graphs: Merging properties and watersheds

Discrete Applied Mathematics
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle

IEEE Transactions on Pattern Analysis and Machine Intelligence
Some Morphological Operators in Graph Spaces

ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Watersheds, mosaics, and the emergence paradigm

Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds

IEEE Transactions on Pattern Analysis and Machine Intelligence
Some links between extremum spanning forests, watersheds and min-cuts

Image and Vision Computing
Artwork 3D model database indexing and classification

Pattern Recognition
On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds

Journal of Mathematical Imaging and Vision
Power Watershed: A Unifying Graph-Based Optimization Framework

IEEE Transactions on Pattern Analysis and Machine Intelligence
Antiextensive connected operators for image and sequence processing

IEEE Transactions on Image Processing
Building the Component Tree in Quasi-Linear Time

IEEE Transactions on Image Processing

Climbing: a unified approach for global constraints on hierarchical segmentation

ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
A hierarchical image segmentation algorithm based on an observation scale

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Global-local optimizations by hierarchical cuts and climbing energies

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and we prove that optimal hierarchical segmentations are equivalent to the ones given by uprooting a watershed-cut based segmentation. Based on those theoretical results, we propose an efficient algorithm to compute such hierarchies, as well as the first saliency map algorithm compatible with the morphological filtering framework.