Structure-sensitive superpixels via geodesic distance
DOI10.1007/S11263-012-0588-6zbMATH Open1270.68358OpenAlexW2003088946MaRDI QIDQ362067FDOQ362067
Authors: Gang Zeng, Rui Gan, Jingdong Wang, Hongbin Zha, Peng Wang 
Publication date: 20 August 2013
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11263-012-0588-6
Recommendations
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)
Cites Work
- Least squares quantization in PCM
- Title not available (Why is that?)
- A fast marching level set method for monotonically advancing fronts.
- Geodesic methods in computer vision and graphics
- Geodesic Distance Based Fuzzy Clustering
- O(\(N\)) implementation of the fast marching algorithm
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
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
Uses Software
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)
