Three-dimensional object recognition from single two-dimensional images
Artificial Intelligence
Visual reconstruction
Segmentation of edges into lines and arcs
Image and Vision Computing
Robust Contour Decomposition Using a Constant Curvature Criterion
IEEE Transactions on Pattern Analysis and Machine Intelligence
Techniques for segmenting image curves into meaningful descriptions
Pattern Recognition
Pattern Recognition Letters
A note on minimal length polygonal approximation to a digitized contour
Communications of the ACM
Locating Perceptually Salient Points on Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Critical Point Detection of Digital Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonparametric Segmentation of Curves into Various Representations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stable and Robust Vectorization: How to Make the Right Choices
GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances
Approximation of digital curves with line segments and circular arcs using genetic algorithms
Pattern Recognition Letters
Linear segmentation of discrete curves into blurred segments
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A curve matching algorithm for dynamic image sequences
ISCGAV'05 Proceedings of the 5th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Linear segmentation of discrete curves into blurred segments
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Approximation of digital circles by regular polygons
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
International Journal of Communication Systems
| Hi-index | 0.14 |
The perimeters of features in digital images are decomposed into sets of straight lines using the Haar transform. The Haar basis functions preserve sharp changes in direction along the perimeter while still allowing smoothing. The coefficients of the Haar transform are simply related to the error between the polygonal decomposition and the true perimeter. The Haar transform can be calculated efficiently with a computational overhead linear in the number of data points.