Fast Constrained Image Segmentation Using Optimal Spanning Trees

DOI10.1007/978-3-319-26520-9_2MaRDI QIDQ3304755zbMATH OpenOpenAlexFDO

Authors Stanislav Harizanov, Ludmil T. Zikatanov, S. Margenov

Publication date 3 August 2020

Published in Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26520-9_2

zbMATH Keywords

image segmentationconvex relaxationsegmentation problemregularity term

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• Efficient graph-based image segmentation
• A fast constrained image segmentation algorithm
• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
• Graph-based image segmentation with shape priors and band constraints

Cites work

• scientific article; zbMATH DE number 2191998 (Why is no real title available?)
• A Semisupervised Segmentation Model for Collections of Images
• A multiphase level set framework for image segmentation using the Mumford and Shah model
• A new fuzzy \(c\)-means method with total variation regularization for segmentation of images with noisy and incomplete data
• A new multiscale representation for shapes and its application to blood vessel recovery
• Active contours without edges
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• An algebraic preconditioning method for M‐matrices: linear versus non‐linear multilevel iteration
• Efficient graph-based image segmentation
• Graph theoretical clustering based on limited neighbourhood sets
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Nonlinear total variation based noise removal algorithms
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimal approximations by piecewise smooth functions and associated variational problems

Cited in

(18)

• Object delineation by -connected components
• A simple topology preserving max-flow algorithm for graph cut based image segmentation
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
• Algorithms and Computation
• Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\)
• Learning-based segmentation for connectomics
• Differential oriented image foresting transform segmentation by seed competition
• A minimum spanning tree based image segmentation algorithm with closed-form solution
• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
• Graph-based image segmentation with shape priors and band constraints
• A fast constrained image segmentation algorithm
• Image segmentation by relaxed deep extreme cut with connected extreme points
• Links between image segmentation based on optimum-path forest and minimum cut in graph
• A fast, memory-efficient alpha-tree algorithm using flooding and tree size estimation
• Dynamic graph merging for image segmentation
• Design and formal proof of a new optimal image segmentation program with hypermaps
• scientific article; zbMATH DE number 2079742 (Why is no real title available?)
• Efficient graph-based image segmentation

This page was built for publication: Fast Constrained Image Segmentation Using Optimal Spanning Trees

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