A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM
A note on minimal length polygonal approximation to a digitized contour
Communications of the ACM
Analysis of Engineering Drawings: State of the Art and Challenges
GREC '97 Selected Papers from the Second International Workshop on Graphics Recognition, Algorithms and Systems
A Survey of Non-thinning Based Vectorization Methods
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
On approximation of Jordan surfaces in 3D
Digital and image geometry
Robust and Accurate Vectorization of Line Drawings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast, accurate and convergent tangent estimation on digital contours
Image and Vision Computing
A Unified Curvature Definition for Regular, Polygonal, and Digital Planar Curves
International Journal of Computer Vision
Minimum-Perimeter Polygons of Digitized Silhouettes
IEEE Transactions on Computers
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
Adaptive Pixel Resizing for Multiscale Recognition and Reconstruction
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Finding the orthogonal hull of a digital object: a combinatorial approach
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Fast distance transformation on irregular two-dimensional grids
Pattern Recognition
Linear Decomposition of Planar Shapes
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
A cognitive and video-based approach for multinational License Plate Recognition
Machine Vision and Applications
Regularization of Discrete Contour by Willmore Energy
Journal of Mathematical Imaging and Vision
A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Unsupervised polygonal reconstruction of noisy contours by a discrete irregular approach
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A parametric active polygon for leaf segmentation and shape estimation
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
Topological and geometrical reconstruction of complex objects on irregular isothetic grids
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
License Plate Recognition From Still Images and Video Sequences: A Survey
IEEE Transactions on Intelligent Transportation Systems
Meaningful Scales Detection along Digital Contours for Unsupervised Local Noise Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
This paper proposes and evaluates a new method for reconstructing a polygonal representation from arbitrary digital contours that are possibly damaged or coming from the segmentation of noisy data. The method consists in two stages. In the first stage, a multi-scale analysis of the contour is conducted so as to identify noisy or damaged parts of the contour as well as the intensity of the perturbation. All the identified scales are then merged so that the input data is covered by a set of pixels whose size is increased according to the local intensity of noise. The second stage consists in transforming this set of resized pixels into an irregular isothetic object composed of an ordered set of rectangular and axis-aligned cells. Its topology is stored as a Reeb graph, which allows an easy pruning of its unnecessary spurious edges. Every remaining connected part has the topology of a circle and a polygonal representation is independently computed for each of them. Four different geometrical algorithms, including a new one, are reviewed for the latter task. These vectorization algorithms are experimentally evaluated and the whole method is also compared to previous works on both synthetic and true digital images. For fair comparisons, when possible, several error measures between the reconstruction and the ground truth are given for the different techniques.