Rooted spanning superpixels

DOI10.1007/S11263-020-01352-9MaRDI QIDQ2056121zbMATH OpenOpenAlexFDO

Authors Deng-Feng Chai

Publication date 1 December 2021

Published in International Journal of Computer Vision (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11263-020-01352-9

zbMATH Keywords

segmentationspanning forestsuperpixels

Mathematics Subject Classification ID

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

Recommendations

• Structure-sensitive superpixels via geodesic distance
• Fast marching based superpixels generation
• Fast marching based superpixels
• Graph-based supervoxel computation from iterative spanning forest
• Correction to: ``Rooted spanning superpixels

Cites work

• A note on two problems in connexion with graphs
• Efficient graph-based image segmentation
• Harmony potentials fusing global and local scale for semantic image segmentation
• Introduction to algorithms.
• Structure-sensitive superpixels via geodesic distance

Cited in

(6)

• Fast marching based superpixels
• Correction to: ``Rooted spanning superpixels
• Graph-based supervoxel computation from iterative spanning forest
• Structure-sensitive superpixels via geodesic distance
• Novel arc-cost functions and seed relevance estimations for compact and accurate superpixels
• Accelerated algorithms for growing segments from image regions

Describes a project that uses

Uses Software

• LIBSVX
• Displets
• SuperCNN
• NYU Depth

This page was built for publication: Rooted spanning superpixels

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