Abstract A method based on geometric moments and dominant points is proposed. Algorithm for detecting dominant points could keep the original contour feature as much as possible, but the number of remain vertexes is not controllable. On the contrary, the method based on geometric moments can reduce the amount of vertexes to any number, but it makes the fitting result get into local optimum. Thus, a new method is introduced which integrates the two algorithms. In this way, most closed curves can be fitted to polygons with specified number of vertexes in a global optimal way.
[1] Ray B K, Ray K S. Determination of Optimal Polygon from Digital Curve Using L1 Norm. Pattern Recognition, 1993, 26(4): 505509 [2] Dinesh R, Damle S S, Guru D S. A SplitBased Method for Polygonal Approximation of Shape Curves // Proc of the 1st International Conference on Pattern Recognition and Machine Intelligence. Kolkata, India, 2005: 382387 [3] Marji M, Siy P. A New Algorithm for Dominant Points Detection and Polygonization of Digital Curves. Pattern Recognition, 2003, 36(10): 22392251 [4] CarmonaPoyato A, FernadezGarcia N L, MedinaCarnicer R, et al. Dominant Point Detection: A New Proposal. Image and Vision Computing, 2005, 23(13): 12261236 [5] Wang B, Chen Y Q, Wang L P, et al. A Genetic Algorithm with ChromosomeRepairing Technique for Polygonal Approximation of Digital Curves // Proc of the International Conference on Natural Computation. Changsha, China, 2005: 822831 [6] Yin P Y. Genetic Particle Swarm Optimization for Polygonal Approximation of Digital Curves. Pattern Recognition and Image Analysis, 2006, 16(2): 223233 [7] Shu H Z, Luo L M, Bao X D. Moment Based Methods for Polygonal Approximation of Digitized Curves. Pattern Recognition, 2002, 35(2): 421434 [8] Wu J S, Leou J J. New Polygonal Approximation Schemes for Object Shape Representation. Pattern Recognition, 1993, 26(4): 471484
2007, Vol. 20 
