Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
DOI10.1007/S10851-012-0333-3zbMATH Open1255.68222OpenAlexW2116965201MaRDI QIDQ1932995FDOQ1932995
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
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
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)
Cites Work
- Simultaneous fuzzy segmentation of multiple objects
- Region-based segmentation: fuzzy connectedness, graph cut and related algorithms
- Relative Fuzzy Connectedness among Multiple Objects: Theory, Algorithms, and Applications in Image Segmentation
- 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
Cited In (14)
- Reduced graphs for min-cut/max-flow approaches in image segmentation
- Some theoretical links between shortest path filters and minimum spanning tree filters
- Seed Robustness of Oriented Image Foresting Transform: Core Computation and the Robustness Coefficient
- The Role of Optimum Connectivity in Image Segmentation: Can the Algorithm Learn Object Information During the Process?
- General theory of fuzzy connectedness segmentations
- Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence
- Spatially constrained Student's \(t\)-distribution based mixture model for robust image segmentation
- Optimum cuts in graphs by general fuzzy connectedness with local band constraints
- Title not available (Why is that?)
- Region-based segmentation: fuzzy connectedness, graph cut and related algorithms
- Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
- Path-value functions for which Dijkstra's algorithm returns optimal mapping
- Links between image segmentation based on optimum-path forest and minimum cut in graph
- Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision
Uses Software
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)
