Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis

DOI10.1007/S10851-012-0333-3MaRDI QIDQ1932995zbMATH OpenOpenAlexFDO

Authors Krzysztof Chris Ciesielski, Jayaram K. Udupa, Alexandre Falcao, Paulo A. V. Miranda

Publication date 22 January 2013

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

Full work available at URL https://doi.org/10.1007/s10851-012-0333-3

zbMATH Keywords

segmentationimage processingfuzzy connectednessgraph cut

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• Region-based segmentation: fuzzy connectedness, graph cut and related algorithms
• scientific article; zbMATH DE number 1849127
• Fast Constrained Image Segmentation Using Optimal Spanning Trees
• Optimum cuts in graphs by general fuzzy connectedness with local band constraints
• General theory of fuzzy connectedness segmentations

Cites work

• Fuzzy digital topology
• Links between image segmentation based on optimum-path forest and minimum cut in graph
• On the equivalence between hierarchical segmentations and ultrametric watersheds
• Region-based segmentation: fuzzy connectedness, graph cut and related algorithms
• Relative Fuzzy Connectedness among Multiple Objects: Theory, Algorithms, and Applications in Image Segmentation
• Simultaneous fuzzy segmentation of multiple objects

Cited in

(14)

• Spatially constrained Student's \(t\)-distribution based mixture model for robust image segmentation
• scientific article; zbMATH DE number 1849127 (Why is no real title available?)
• Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence
• Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
• Optimum cuts in graphs by general fuzzy connectedness with local band constraints
• Links between image segmentation based on optimum-path forest and minimum cut in graph
• Path-value functions for which Dijkstra's algorithm returns optimal mapping
• Some theoretical links between shortest path filters and minimum spanning tree filters
• Region-based segmentation: fuzzy connectedness, graph cut and related algorithms
• General theory of fuzzy connectedness segmentations
• Optimization of max-norm objective functions in image processing and computer vision
• The role of optimum connectivity in image segmentation: can the algorithm learn object information during the process?
• Seed robustness of oriented iImage foresting transform: core computation and the robustness coefficient
• Reduced graphs for min-cut/max-flow approaches in image segmentation

Describes a project that uses

Uses Software

• MAXFLOW

This page was built for publication: Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932995)