Fast Constrained Image Segmentation Using Optimal Spanning Trees

DOI10.1007/978-3-319-26520-9_2zbMath1440.68317OpenAlexW2291098333MaRDI QIDQ3304755

Stanislav Harizanov, Ludmil T. Zikatanov, Svetozar 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)

Related Items

Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Nonlinear total variation based noise removal algorithms
• A new fuzzy \(c\)-means method with total variation regularization for segmentation of images with noisy and incomplete data
• Graph theoretical clustering based on limited neighbourhood sets
• A multiphase level set framework for image segmentation using the Mumford and Shah model
• Efficient graph-based image segmentation
• A New Multiscale Representation for Shapes and Its Application to Blood Vessel Recovery
• Optimal approximations by piecewise smooth functions and associated variational problems
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• Algorithmic Aspects of Vertex Elimination on Graphs
• Active contours without edges
• An algebraic preconditioning method for M‐matrices: linear versus non‐linear multilevel iteration
• A Semisupervised Segmentation Model for Collections of Images
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters