A fast iterative method for dominant points detection of digital curves

Authors:
Cecilia Di Ruberto;Andrea Morgera
Affiliations:
University of Cagliari, Dept. of Mathematics and Comp. Science, Cagliari, Italy;University of Cagliari, Dept. of Mathematics and Comp. Science, Cagliari, Italy
Venue:
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Year:
2009

Citing 6
Cited 1

On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
An algorithm for detection of dominant points and polygonal approximation of digitized curves

Pattern Recognition Letters
A dynamic method for dominant point detection

Graphical Models
A Corner-Finding Algorithm for Chain-Coded Curves

IEEE Transactions on Computers
An Improved Method of Angle Detection on Digital Curves

IEEE Transactions on Computers
Dominant point detection by reverse polygonization of digital curves

Image and Vision Computing

Shape matching by curve modelling and alignment

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm for detecting dominant points of digitized closed curves is presented. At first a process of localization of maximum curvature points is done. The method adds iteratively contour points as dominant points by a criterion that considers the distance of contour points respect to the set of dominant points calculated in previous steps. It follows a final process of refinement. The performance of our method are successfully compared with other dominant point extraction techniques. Finally, some examples of polygonal approximation are showed.