Fast marching based superpixels generation

DOI10.1007/978-3-030-20867-7_27MaRDI QIDQ2189386zbMATH OpenOpenAlexFDO

Authors Kaiwen Chang, B. Figliuzzi

Publication date 15 June 2020

Full work available at URL https://doi.org/10.1007/978-3-030-20867-7_27

zbMATH Keywords

eikonal equationsuperpixel segmentationfast marching algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• Fast marching based superpixels
• Generalized fast marching method: applications to image segmentation
• Lazy Random Walks for Superpixel Segmentation
• Variational, Geometric, and Level Set Methods in Computer Vision
• An image segmentation approach with progressive superpixel merging

Cited in

(9)

• SLICT: computing texture-sensitive superpixels in medical images
• SuperPatchMatch: An Algorithm for Robust Correspondences Using Superpixel Patches
• Principal geodesic analysis boundary delineation with superpixel-based constraints
• Novel arc-cost functions and seed relevance estimations for compact and accurate superpixels
• Rooted spanning superpixels
• Structure-sensitive superpixels via geodesic distance
• Accelerated algorithms for growing segments from image regions
• Editorial -- special issue: ISMM 2019
• Fast marching based superpixels

This page was built for publication: Fast marching based superpixels generation

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