Optimum cuts in graphs by general fuzzy connectedness with local band constraints

DOI10.1007/S10851-020-00953-WzbMath1482.68261OpenAlexW3013985656WikidataQ122111965 ScholiaQ122111965MaRDI QIDQ2203345

Paulo A. V. Miranda, Fábio A. M. Cappabianco, Caio de Moraes Braz, Krzysztof Chris Ciesielski

Publication date: 6 October 2020

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-020-00953-w

zbMATH Keywords

image foresting transformgraph-cut segmentationboundary band constrainthedgehog shape prior

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45)

Related Items (4)

Differential oriented image foresting transform and its applications to support high-level priors for object segmentation ⋮ Graph-based image segmentation with shape priors and band constraints ⋮ Differential oriented image foresting transform segmentation by seed competition ⋮ Efficient hierarchical multi-object segmentation in layered graphs

Cites Work

• Unnamed Item
• General theory of fuzzy connectedness segmentations
• Path-value functions for which Dijkstra's algorithm returns optimal mapping
• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
• Oriented Image Foresting Transform Segmentation by Seed Competition
• A fast marching level set method for monotonically advancing fronts.
• Graph-Based Segmentation with Local Band Constraints
• The Transitive Reduction of a Directed Graph

This page was built for publication: Optimum cuts in graphs by general fuzzy connectedness with local band constraints