Method for polygonal approximation through dominant points deletion

Authors:
A. Carmona-Poyato;R. Medina-Carnicer;N. L. Fernandez-Garcia;F. J. Madrid-Cuevas;R. Muñoz-Salinas
Affiliations:
Departament of Computing and Numerical Analisis, Cordoba University, Spain;Departament of Computing and Numerical Analisis, Cordoba University, Spain;Departament of Computing and Numerical Analisis, Cordoba University, Spain;Departament of Computing and Numerical Analisis, Cordoba University, Spain;Departament of Computing and Numerical Analisis, Cordoba University, Spain
Venue:
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Year:
2010

Citing 18
Cited 1

Finding Trajectories of Feature Points in a Monocular Image Sequence

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection of significant points and polygonal approximation of digitized curves

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

Pattern Recognition Letters
A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves

Pattern Recognition Letters
Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints

IEEE Transactions on Pattern Analysis and Machine Intelligence
Another look at the dominant point detection of digital curves

Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
The DEDALE system for complex spatial queries

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Convexity rule for shape decomposition based on discrete contour evolution

Computer Vision and Image Understanding
On Critical Point Detection of Digital Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Pattern Recognition Letters
A novel approach to polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
Optimized polygonal approximation by dominant point deletion

Pattern Recognition
Dominant point detection by reverse polygonization of digital curves

Image and Vision Computing
Angle Detection on Digital Curves

IEEE Transactions on Computers
Dominant point detection: A new proposal

Image and Vision Computing
A rotationally invariant two-phase scheme for corner detection

Pattern Recognition

A moment-based polygonal approximation algorithm for regular digital curves

Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for polygonal approximation of digital planar curves is proposed. This method is relied on the supression of dominant points. Initially, the method uses the set of all breakpoints as dominant points. The method eliminates dominant points until a final condition is satisfied. The residuary dominant points are the polygonal approximation. This aproximation is compared with other classical algorithms. The experimental results show that this method works well for digital planar curves with features of several sizes.