Structure-sensitive superpixels via geodesic distance

DOI10.1007/s11263-012-0588-6zbMath1270.68358OpenAlexW2003088946MaRDI QIDQ362067

Rui Gan, Gang Zeng, 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

zbMATH Keywords

geodesic distanceiterative optimizationstructure-sensitivitysuperpixel segmentation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Machine vision and scene understanding (68T45)

Related Items (1)

Rooted spanning superpixels

Uses Software

• BSDS
• gbvs
• GeoS

Cites Work

• Unnamed Item
• O(\(N\)) implementation of the fast marching algorithm
• Geodesic Methods in Computer Vision and Graphics
• Least squares quantization in PCM
• A fast marching level set method for monotonically advancing fronts.
• Geodesic Distance Based Fuzzy Clustering
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations

This page was built for publication: Structure-sensitive superpixels via geodesic distance