Global-local optimizations by hierarchical cuts and climbing energies
From MaRDI portal
Publication:898294
DOI10.1016/j.patcog.2013.05.012zbMath1326.68294OpenAlexW2035303416MaRDI QIDQ898294
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.05.012
energy minimizationdynamic programmingmathematical morphologyhierarchical segmentationclimbing optimization
Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)
Related Items (8)
Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps ⋮ New Characterizations of Minimum Spanning Trees and of Saliency Maps Based on Quasi-flat Zones ⋮ Constrained Optimization on Hierarchies and Braids of Partitions ⋮ Segmentation of Multimodal Images Based on Hierarchies of Partitions ⋮ Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method ⋮ Prior-based hierarchical segmentation highlighting structures of interest ⋮ Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence ⋮ Prior-Based Hierarchical Segmentation Highlighting Structures of Interest
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structure of images
- On the equivalence between hierarchical segmentations and ultrametric watersheds
- Level lines selection with variational models for segmentation and encoding
- Scale-sets image analysis
- Hierarchies and Optima
- Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
- Constrained Connectivity and Transition Regions
- A Multiscale Algorithm for Image Segmentation by Variational Method
- Active contours without edges
- Ground Truth Energies for Hierarchies of Segmentations
This page was built for publication: Global-local optimizations by hierarchical cuts and climbing energies
