高级检索
胡倩倩, 梁如意, 王国瑾. 一类快速收敛的渐进迭代逼近方法[J]. 计算机辅助设计与图形学学报, 2023, 35(12): 1900-1909. DOI: 10.3724/SP.J.1089.2023.2023-00004
引用本文: 胡倩倩, 梁如意, 王国瑾. 一类快速收敛的渐进迭代逼近方法[J]. 计算机辅助设计与图形学学报, 2023, 35(12): 1900-1909. DOI: 10.3724/SP.J.1089.2023.2023-00004
Hu Qianqian, Liang Ruyi, Wang Guojin. A Family of Progressive Iterative Approximation Methods with Fast Convergence[J]. Journal of Computer-Aided Design & Computer Graphics, 2023, 35(12): 1900-1909. DOI: 10.3724/SP.J.1089.2023.2023-00004
Citation: Hu Qianqian, Liang Ruyi, Wang Guojin. A Family of Progressive Iterative Approximation Methods with Fast Convergence[J]. Journal of Computer-Aided Design & Computer Graphics, 2023, 35(12): 1900-1909. DOI: 10.3724/SP.J.1089.2023.2023-00004

一类快速收敛的渐进迭代逼近方法

A Family of Progressive Iterative Approximation Methods with Fast Convergence

  • 摘要: 渐进迭代逼近(PIA)是一种用于数据拟合的经典几何迭代方法,其操作简单,表达显式.针对经典PIA算法存在收敛速度慢的问题,将逆矩阵的具有高阶收敛的迭代算法与经典PIA方法融合,提出一类单步非定常的加速PIA算法.首先,对给定数据点用均匀或累加弦长法进行参数化;然后,用加速PIA算法调整控制点生成拟合曲线(曲面)序列,从理论上保证了生成的曲线(曲面)序列的极限插值原始数据点.在规则曲线曲面,散乱数据点以及加噪声散乱数据点的拟合实验结果表明,在相同终止误差条件下,相比经典PIA算法,所提加速PIA算法需要的迭代次数平均减少84.75%,运算时间平均减少65.53%.

     

    Abstract: The progressive iterative approximation (PIA) is a classical geometric iterative method for data fitting, which is simple to operate and has explicit representation. However, the classical PIA suffers from slow convergence rate. To address this issue, we propose a family of single-step nonstationary accelerated PIA methods by integrating the high-order convergence iterative algorithm of inverse matrix with the classical PIA method. Firstly, the given data points are parameterized by uniform or chord length parameterization method. Then, the accelerated PIA algorithm is employed to adjust the control points iteratively, and generates a sequence of fitting curves (surfaces). The limit of the generated sequence of curves (surfaces) is theoretically guaranteed to interpolate the original data points. Experimental results on fitting regular curves (surfaces), scattered data points and noisy scattered data points demonstrate that compared with the classical PIA algorithm, the proposed accelerated PIA requires an average reduction of 84.75% in the number of iterations and an average reduction of 65.53% in running time.

     

/

返回文章
返回