Segmentation of edges into lines and arcs
Image and Vision Computing
Pattern Recognition Letters
Pattern Recognition Letters
A new method to detect arcs and segments from curvature profiles
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
A Unified Curvature Definition for Regular, Polygonal, and Digital Planar Curves
International Journal of Computer Vision
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Multi-scale Analysis of Discrete Contours for Unsupervised Noise Detection
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Binomial convolutions and derivatives estimation from noisy discretizations
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Convergence of binomial-based derivative estimation for C2noisy discretized curves
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Multiscale Analysis from 1D Parametric Geometric Decomposition of Shapes
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Approximation of a polyline with a sequence of geometric primitives
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Hi-index | 0.00 |
We address the problem of constructing an approximate continuous representation of a digital contour with guarantees on the Hausdorff error between the digital shape and its reconstruction. Instead of polygonalizing the contour, we propose to reconstruct the shape with circular arcs. To do so, we exploit the recent curvature estimators. From their curvature field, we introduce a new simple and efficient algorithm to approximate a digital shape with as few arcs as possible at a given scale, specified by a maximal admissible Hausdorff distance. We show the potential of our reconstruction method with numerous experiments and we also compare our results with some recent promising approaches. Last, all these algorithms are available online for comparisons on arbitrary shapes.