On the Detection of Visual Features from Digital Curves Using a Metaheuristic Approach

In computational shape analysis a crucial step consists in extracting meaningful features from digital curves. Dominant points are those points with curvature extreme on the curve that can suitably describe the curve both for visual perception and for recognition. Many approaches have been developed for detecting dominant points. In this paper we present a novel method that combines the dominant point detection and the ant colony optimization search. The method is inspired by the ant colony search (ACS) suggested by Yin in [1] but it results in a much more efficient and effective approximation algorithm. The excellent results have been compared both to works using an optimal search approach and to works based on exact approximation strategy.

[1]  Wen-Yen Wu,et al.  Detecting the Dominant Points by the Curvature-Based Polygonal Approximation , 1993, CVGIP Graph. Model. Image Process..

[2]  Peng-Yeng Yin,et al.  Ant colony search algorithms for optimal polygonal approximation of plane curves , 2003, Pattern Recognit..

[3]  Keiichi Abe,et al.  Towards a Hierarchical Contour Description via Dominant Point Detection , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[4]  Ji-Hwei Horng,et al.  Improving fitting quality of polygonal approximation by using the dynamic programming technique , 2002, Pattern Recognit. Lett..

[5]  Peng-Yeng Yin.  A Tabu Search Approach to Polygonal Approximation of Digital Curves , 2000, Int. J. Pattern Recognit. Artif. Intell..

[6]  Pepe Siy,et al.  A new algorithm for dominant points detection and polygonization of digital curves , 2003, Pattern Recognit..

[7]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Wen-Yen Wu,et al.  Dominant point detection using adaptive bending value , 2003, Image Vis. Comput..

[9]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Cecilia Di Ruberto,et al.  A New Algorithm for Polygonal Approximation Based on Ant Colony Optimization , 2009, ICIAP.

[11]  PENG-YENG YIN.  Genetic Algorithms for Polygonal Approximation of Digital Curves , 1999, Int. J. Pattern Recognit. Artif. Intell..

[12]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[13]  BIMAL KUMAR RAY,et al.  Determination of optimal polygon from digital curve using L1 norm , 1993, Pattern Recognit..

[14]  Yukio Sato,et al.  Piecewise linear approximation of plane curves by perimeter optimization , 1992, Pattern Recognit..

[15]  Philippe Cornic,et al.  Another look at the dominant point detection of digital curves , 1997, Pattern Recognit. Lett..

[16]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[17]  F. Attneave.  Some informational aspects of visual perception. , 1954, Psychological review.

[18]  Edward J. Delp,et al.  On detecting dominant points , 1991, Pattern Recognit..

[19]  Francisco José Madrid-Cuevas,et al.  Dominant point detection: A new proposal , 2005, Image Vis. Comput..

[20]  Peng-Yeng Yin.  Polygonal Approximation of Digital Curves Using the State-of-the-art Metaheuristics , 2007 .

[21]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[22]  Wen-Yen Wu,et al.  A dynamic method for dominant point detection , 2002, Graph. Model..

[23]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

[24]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[25]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[26]  Bimal Kumar Ray,et al.  A new split-and-merge technique for polygonal approximation of chain coded curves , 1995, Pattern Recognit. Lett..

[27]  Wen-Yen Wu,et al.  Corner detection using bending value , 1995, Pattern Recognit. Lett..

[28]  Peng-Yeng Yin.  Polygonal Approximation Using Genetic Algorithms , 1999, CAIP.