Towards interactive image segmentation by dynamic and iterative spanning forest

DOI10.1007/978-3-030-76657-3_25zbMath1484.68287OpenAlexW3162945634MaRDI QIDQ2061819

Paulo A. V. Miranda, Zenilton K. G. jun. do Patrocínio, Alexandre Xavier Falcão, Isabela Borlido Barcelos, 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_25

zbMATH Keywords

interactive segmentationgraph-based image segmentationdynamic and iterative spanning forest

Mathematics Subject Classification ID

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

Related Items (1)

Novel arc-cost functions and seed relevance estimations for compact and accurate superpixels

Cites Work

• Path-value functions for which Dijkstra's algorithm returns optimal mapping
• Oriented Image Foresting Transform Segmentation by Seed Competition
• The Role of Optimum Connectivity in Image Segmentation: Can the Algorithm Learn Object Information During the Process?
• An Iterative Spanning Forest Framework for Superpixel Segmentation
• Bandeirantes: A Graph-Based Approach for Curve Tracing and Boundary Tracking

This page was built for publication: Towards interactive image segmentation by dynamic and iterative spanning forest