首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
  • 本地全文:下载
  • 作者:F. Dong ; R. Xiao ; Y. Zhong
  • 期刊名称:Journal of Universal Computer Science
  • 印刷版ISSN:0948-6968
  • 出版年度:2007
  • 卷号:13
  • 期号:10
  • 页码:1449-1449
  • 出版社:Graz University of Technology and Know-Center
  • 摘要:An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the polygonal approximation problem, which is represented as a binary vector. The offset error of centroid between the original curve and the approximation polygon, and the variance of distance error for each approximation segment are adopted in the fitness function to evaluate the feasibility degree of the candidate solution. The sigmoid function of iteration times is used as the acceleration factors instead of the constant factors to improve the global searching characteristics. Experimental results show that the proposed approach can get suitable approximation results for preserving the features of original curves.
  • 关键词:PSO, centroid, polygonal approximation, sigmoid function
国家哲学社会科学文献中心版权所有