Graph-based supervoxel computation from iterative spanning forest

DOI10.1007/978-3-030-76657-3_29zbMath1484.68298OpenAlexW3161292339MaRDI QIDQ2061832

Alexandre Xavier Falcão, Carolina Jerônimo, Laurent Najman, Zenilton K. G. jun. Patrocínio, Sarah A. Carneiro, Felipe Belém, 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

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

Cites Work

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

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