Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence

DOI10.1137/17M1118580zbMath1401.49059OpenAlexW2624473104MaRDI QIDQ4689664

Laurent Najman

Publication date: 17 October 2018

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1118580

zbMATH Keywords

classificationimage segmentation\(\Gamma\)-convergenceimage filteringspectral clusteringpower watershed

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Miscellaneous topics in calculus of variations and optimal control (49N99)

Related Items (3)

Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions ⋮ Power spectral clustering ⋮ Some theoretical links between shortest path filters and minimum spanning tree filters

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Nonlinear total variation based noise removal algorithms
• Global-local optimizations by hierarchical cuts and climbing energies
• Nonlocal discrete \(p\)-Laplacian driven image and manifold processing
• An introduction to \(\Gamma\)-convergence
• An introduction to gamma-convergence for spectral clustering
• On the equivalence between hierarchical segmentations and ultrametric watersheds
• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
• Asymptotic development by \(\Gamma{}\)-convergence
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• Scale-sets image analysis
• Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
• The TVL1 Model: A Geometric Point of View
• Maximal flow through a domain
• Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree
• A Comparative Review of Component Tree Computation Algorithms
• Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs
• Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters and Minimum Spanning Tree Filters
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history

This page was built for publication: Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence