李乐林, 江万寿, 张靖. 利用极化角点指数进行数字曲线快速多边形近似[J]. 武汉大学学报 ( 信息科学版), 2009, 34(12): 1495-1498.
引用本文: 李乐林, 江万寿, 张靖. 利用极化角点指数进行数字曲线快速多边形近似[J]. 武汉大学学报 ( 信息科学版), 2009, 34(12): 1495-1498.
LI Lelin, JIANG Wanshou, ZHANG Jing. Fast Polygonal Approximation of Digital Curve Based on Polarization Cornerity Index[J]. Geomatics and Information Science of Wuhan University, 2009, 34(12): 1495-1498.
Citation: LI Lelin, JIANG Wanshou, ZHANG Jing. Fast Polygonal Approximation of Digital Curve Based on Polarization Cornerity Index[J]. Geomatics and Information Science of Wuhan University, 2009, 34(12): 1495-1498.

利用极化角点指数进行数字曲线快速多边形近似

Fast Polygonal Approximation of Digital Curve Based on Polarization Cornerity Index

  • 摘要: 针对曲线结构特征,引入极化角点指数作为特征角点的候选依据,提出了一种与曲线起始点位置无关的基于角点检测的多边形近似算法。实验证明,此方法快速有效,结果稳定,噪声抑制效果较好。

     

    Abstract: According to the structural characteristics of the curve,a new polygonal approximation algorithm based on corner detection is proposed by introducing a polarization cornerity index for the corner candidate.This algorithm has nothing to do with the position of the start point.A comprehensive analysis between the polygon approximation approaches and the corner detection approaches for the reconstruction of the curve is executed.The newly developed curve reconstruction algorithm was extensively tested on various shapes and is proved to be computationally fast and robust to noise.Experimental results are stable and closer to human visual effects.

     

/

返回文章
返回