Structure-sensitive superpixels via geodesic distance
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3936168 (Why is no real title available?)
- A fast marching level set method for monotonically advancing fronts.
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
- Geodesic Distance Based Fuzzy Clustering
- Geodesic methods in computer vision and graphics
- Least squares quantization in PCM
- O(\(N\)) implementation of the fast marching algorithm
Cited in
(7)- TurboTensors for entropic image comparison
- Geometric labeling of image regions based on combination of multiple features
- 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
- Fast marching based superpixels
This page was built for publication: Structure-sensitive superpixels via geodesic distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q362067)