Graph-based supervoxel computation from iterative spanning forest

DOI10.1007/978-3-030-76657-3_29MaRDI QIDQ2061832zbMATH OpenOpenAlexFDO

Authors Carolina Jerônimo, Felipe Belém, Sarah A. Carneiro, Zenilton K. G. jun. Patrocínio, Laurent Najman, Alexandre Falcao, Sílvio J. F. Guimarães

Publication date 21 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-76657-3_29

zbMATH Keywords

graph-based methoditerative spanning forestsupervoxel computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10)

Recommendations

• An Iterative Spanning Forest Framework for Superpixel Segmentation
• Real-Time Hierarchical Supervoxel Segmentation via a Minimum Spanning Tree
• Towards interactive image segmentation by dynamic and iterative spanning forest
• A graph-based framework for sub-pixel image segmentation
• Rooted spanning superpixels
• Efficient graph-based image segmentation

Cites work

• An Iterative Spanning Forest Framework for Superpixel Segmentation
• Efficient graph-based image segmentation
• Path-value functions for which Dijkstra's algorithm returns optimal mapping
• Real-Time Hierarchical Supervoxel Segmentation via a Minimum Spanning Tree

Cited in

(1)

• Rooted spanning superpixels

This page was built for publication: Graph-based supervoxel computation from iterative spanning forest

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