A graph-based framework for sub-pixel image segmentation
From MaRDI portal
Publication:630599
DOI10.1016/j.tcs.2010.11.030zbMath1207.68428OpenAlexW2002961836MaRDI QIDQ630599
Filip Malmberg, Ingela Nyström, Nataša Sladoje, Joakim Lindblad
Publication date: 17 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.030
image segmentationgraph labelinggraph cutscoverage segmentationfeature estimationsub-pixel segmentation
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Estimation of linear deformations of 2D and 3D fuzzy objects ⋮ Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
Cites Work
- Links between image segmentation based on optimum-path forest and minimum cut in graph
- Sub-pixel Segmentation with the Image Foresting Transform
- Probabilistic segmentation of partial volume voxels
- The Piecewise Smooth Mumford–Shah Functional on an Arbitrary Graph
- Fuzzy sets
- Multigrid convergence of calculated features in image analysis
This page was built for publication: A graph-based framework for sub-pixel image segmentation