A split-based method for polygonal approximation of shape curves

Authors:
R. Dinesh;Santhosh S. Damle;D. S. Guru
Affiliations:
Department of Studies in Computer Science, University of Mysore, Manasagangotri, Mysore, India;Department of Studies in Computer Science, University of Mysore, Manasagangotri, Mysore, India;Department of Studies in Computer Science, University of Mysore, Manasagangotri, Mysore, India
Venue:
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Year:
2005

Citing 8
Cited 0

An algorithm for detection of dominant points and polygonal approximation of digitized curves

Pattern Recognition Letters
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
An algorithm for polygonal approximation based on iterative point elimination

Pattern Recognition Letters
Corner detection using bending value

Pattern Recognition Letters
A new split-and-merge technique for polygonal approximation of chain coded curves

Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Boundary-based corner detection using eigenvalues of covariance matrices

Pattern Recognition Letters
Reduced-search dynamic programming for approximation of polygonal curves

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new split-approach based method for approximating a boundary curve by a polygon is proposed in this paper. The proposed method recursively splits boundary curve into smaller segment with the help of small eigenvalue of covariance matrix of the boundary curve. Set of boundary points at which boundary curve is split into smaller segments are considered as vertices of the approximating polygon. Experimental results show that the proposed method is robust and efficient.