Computational geometry: an introduction
Computational geometry: an introduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Perceptual Organization and Curve Partitioning
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Robotics Research
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Representation by Multiscale Contour Approximation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scale-Based Detection of Corners of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity-invariant signatures for partially occluded planar shapes
International Journal of Computer Vision
A note on minimal length polygonal approximation to a digitized contour
Communications of the ACM
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Decomposition of Digital Curves into Polygons Using the Haar Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Evaluation of Interest Point Detectors
International Journal of Computer Vision - Special issue on a special section on visual surveillance
Journal of Intelligent and Robotic Systems
Performance evaluation of corner detectors using consistency and accuracy measures
Computer Vision and Image Understanding
Detection of noncircularity and eccentricity of a rolling winder by artificial vision
EURASIP Journal on Applied Signal Processing
Corner validation based on extracted corner properties
Computer Vision and Image Understanding
Feature point detection utilizing the empirical mode decomposition
EURASIP Journal on Advances in Signal Processing
Performance evaluation of corner detectors using consistency and accuracy measures
Computer Vision and Image Understanding
Feature points detection using combined character along principal orientation
MIRAGE'07 Proceedings of the 3rd international conference on Computer vision/computer graphics collaboration techniques
Feature point extraction from the local frequency map of an image
Journal of Electrical and Computer Engineering
Hi-index | 0.14 |
This correspondence presents an algorithm for smoothed polygonal approximation of noisy digital planar curves, and feature point detection. The resulting smoothed polygonal representation preserves the signs of the curvature function of the curve. The algorithm is based on a simple decomposition of noisy digital curves into a minimal number of convex and concave sections. The location of each separation point is optimized, yielding the minimal possible distance between the smoothed approximation and the original curve. Curve points within a convex (concave) section are discarded if their angle signs do not agree with the section sign, and if the resulted deviations from the curve are less than a threshold /spl epsi/, which is derived automatically. Inflection points are curve points between pairs of convex-concave sections, and cusps are curve points between pairs of convex-convex or concave-concave sections. Corners and points of local minimal curvature are detected by applying the algorithm to respective total curvature graphs. The detection of the feature points is based on properties of pairs of sections that are determined in an adaptive manner, rather than on properties of single points that are based on a fixed-size neighborhood. The detection is therefore reliable and robust. Complexity analysis and experimental results are presented.