A moment-based polygonal approximation algorithm for regular digital curves

Authors:
Xiaojing Xuan;Fangmin Dong;Shuifa Sun;Liwen Wang
Affiliations:
China Three Gorges University, Yichang, Hubei, P.R. China;China Three Gorges University, Yichang, Hubei, P.R. China;China Three Gorges University, Yichang, Hubei, P.R. China;China Three Gorges University, Yichang, Hubei, P.R. China
Venue:
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Year:
2013

Citing 5
Cited 0

A non-parametric sequential method for polygonal approximation of digital curves

Pattern Recognition Letters
Improving fitting quality of polygonal approximation by using the dynamic programming technique

Pattern Recognition Letters
A Novel Approach to 2-D Shape Representation Based on Equilateral Polygonal Approximation

CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 01
Tabu split and merge for the simplification of polygonal curves

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Method for polygonal approximation through dominant points deletion

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Keeping the features of the original curve is a key issue in polygonal approximation The low order moments of curves have well-defined image description capability. Taking this advantage, this paper uses the difference of the second order moments to measure the similarity between an approximated polygon and the original curve, and implements a PSO-based polygonal approximation algorithm for regular digital curves. Experiments show that the proposed method can obtain good results in keeping the features of the original curves.