作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (17): 232-234. doi: 10.3969/j.issn.1000-3428.2012.17.062

• 图形图像处理 • 上一篇    下一篇

改进D-P算法在图像轮廓平滑中的应用

程 立,王江晴,田 微,朱宗晓,魏红昀,刘 赛,徐 科   

  1. (中南民族大学计算机科学学院,武汉 430074)
  • 收稿日期:2011-10-12 修回日期:2011-12-29 出版日期:2012-09-05 发布日期:2012-09-03
  • 作者简介:程 立(1976-),男,讲师,主研方向:图像处理,模式识别;王江晴,教授、博士;田 微、朱宗晓、魏红昀、刘 赛、徐 科,讲师、博士研究生
  • 基金资助:
    国家自然科学基金资助项目“女书规范化及识别技术研究”(60975021);中南民族大学中央高校基本科研业务费专项基金资助项目(CZQ12005)

Application of Improved D-P Algorithm in Image Edge Smoothing

CHENG Li, WANG Jiang-qing, TIAN Wei, ZHU Zong-xiao, WEI Hong-yun, LIU Sai, XU Ke   

  1. (College of Computer Science, South-Central University for Nationalities, Wuhan 430074, China)
  • Received:2011-10-12 Revised:2011-12-29 Online:2012-09-05 Published:2012-09-03

摘要: 针对传统D-P算法速度较慢、编程不方便的问题,提出一种改进算法。以一定步长对轮廓进行遍历,根据轮廓上点到所选轮廓段首末点连线最大距离与距离阈值的大小关系,按轮廓遍历顺序获取曲线轮廓的特征点,并在相邻的特征点之间采用贝塞尔曲线进行平滑。实验结果表明,改进算法的速度比传统算法提高10%以上。

关键词: 轮廓平, 特征点, D-P算法, 轮廓遍历, 阈值, 贝塞尔曲线

Abstract: A modified Douglas-Peucker algorithm is proposed aiming at the disadvantages of traditional Douglas-Peucker algorithm such as low running speed and difficulty in program design. In the algorithm, the edge is traversed at a certain step length and the feature points on the edge are gained in order of traversal sequence according to the relation between max distance of points on the edge to line between the start and end point of the selected edge section and the distance threshold. At the same time smoothing effect is good when edges are smoothed between the adjacent two feature points. Experimental results show the improved algorithm can increases speed by ten percent than the traditional algorithm.

Key words: edge smoothing, feature point, Douglas-Peucker algorithm, edge traverse, threshold, Bezier curve

中图分类号: