A graph partitioning algorithm based on SLIC superpixels
From MaRDI portal
Publication:2983705
DOI10.3969/J.ISSN.1005-3085.2016.05.001zbMATH Open1374.68712MaRDI QIDQ2983705FDOQ2983705
Authors: Yuan Zhao, Yi Gao, Ji-Gen Peng
Publication date: 17 May 2017
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)
Cited In (8)
- Improved DCUT image segmentation algorithm based on SLIC
- SLICT: computing texture-sensitive superpixels in medical images
- Novel arc-cost functions and seed relevance estimations for compact and accurate superpixels
- An image segmentation approach with progressive superpixel merging
- Structure-sensitive superpixels via geodesic distance
- An image cosegmentation algorithm using hypergraph cut
- Fast marching based superpixels
- Object segmentation in video via graph cut built on superpixels
This page was built for publication: A graph partitioning algorithm based on SLIC superpixels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983705)