...
首页> 外文期刊>Applied Soft Computing >Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting
【24h】

Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

机译:Elitist克隆选择算法用于B样条数据拟合中自由结的最佳选择

获取原文
获取原文并翻译 | 示例

摘要

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed. (C) 2014 Elsevier B.V. All rights reserved.
机译:在CAD / CAM,虚拟现实,数据可视化以及许多其他领域的逆向工程中,使用B样条进行数据拟合是一个具有挑战性的问题。众所周知,如果将节视为自由变量,则拟合度会大大提高。然而,这导致了非常困难的多峰和多变量连续非线性优化问题,即所谓的结调整问题。在这种情况下,本文介绍了一种适用于B样条曲线自动结调整的精英克隆选择算法。给定一组嘈杂的数据点,我们的方法会自动确定结的数量和位置,以便获得极其精确的数据拟合。此外,我们的方法可最大程度地减少此任务所需的参数数量。即使对于基础功能需要相同多个重结的情况,例如具有间断和尖峰的功能,我们的方法也能以全自动方式很好地执行。为了评估其性能,已将其应用于三个具有挑战性的测试功能,并将结果与​​基于AIS和遗传算法的其他替代方法的结果进行了比较。我们的实验结果表明,我们的建议在准确性和灵活性方面优于以前的方法。还讨论了其他一些问题,例如参数调整,算法的复杂性和CPU运行时间。 (C)2014 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号