Memetic firefly algorithm for data fitting with rational curves

A. Iglesias, A. Gálvez
{"title":"Memetic firefly algorithm for data fitting with rational curves","authors":"A. Iglesias, A. Gálvez","doi":"10.1109/CEC.2015.7256932","DOIUrl":null,"url":null,"abstract":"This paper concerns the problem of obtaining a smooth fitting curve to a given set of (noisy) data points. This problem arises frequently in several industrial fields, such as computer-aided design and manufacturing (construction of car bodies, ship hulls, airplane fuselage), computer graphics and animation, medicine, and many others. The classical approach relies on polynomial functions to solve this problem. It has been noticed, however, that some shapes cannot be properly approximated through this polynomial scheme. In this paper, we address this issue by using rational functions, particularly the rational Bernstein basis functions. This poses an additional challenge: we have not only to compute the poles of the resulting rational Bézier fitting curve but also to obtain their corresponding weights and a suitable parameterization of data points. Overall, this leads to a continuous multivariate nonlinear optimization problem that cannot be solved through traditional mathematical optimization techniques. Our approach to tackle this issue is based on a memetic firefly algorithm combining a powerful metaheuristic technique (the firefly algorithm) for global optimization with a local search method. The performance of our scheme is illustrated through its application to four illustrative examples of free-form synthetic shapes. Our experimental results show that our memetic approach performs very well, and allows us to reconstruct the underlying shape of data points automatically with high accuracy. A comparative analysis on our benchmark shows that our approach outperforms some alternative methods reported in the literature for this problem.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2015.7256932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

This paper concerns the problem of obtaining a smooth fitting curve to a given set of (noisy) data points. This problem arises frequently in several industrial fields, such as computer-aided design and manufacturing (construction of car bodies, ship hulls, airplane fuselage), computer graphics and animation, medicine, and many others. The classical approach relies on polynomial functions to solve this problem. It has been noticed, however, that some shapes cannot be properly approximated through this polynomial scheme. In this paper, we address this issue by using rational functions, particularly the rational Bernstein basis functions. This poses an additional challenge: we have not only to compute the poles of the resulting rational Bézier fitting curve but also to obtain their corresponding weights and a suitable parameterization of data points. Overall, this leads to a continuous multivariate nonlinear optimization problem that cannot be solved through traditional mathematical optimization techniques. Our approach to tackle this issue is based on a memetic firefly algorithm combining a powerful metaheuristic technique (the firefly algorithm) for global optimization with a local search method. The performance of our scheme is illustrated through its application to four illustrative examples of free-form synthetic shapes. Our experimental results show that our memetic approach performs very well, and allows us to reconstruct the underlying shape of data points automatically with high accuracy. A comparative analysis on our benchmark shows that our approach outperforms some alternative methods reported in the literature for this problem.
有理曲线数据拟合的模因萤火虫算法
本文讨论的问题是获得一组给定的(有噪声的)数据点的光滑拟合曲线。这个问题经常出现在几个工业领域,如计算机辅助设计和制造(汽车车身、船体、飞机机身的建造)、计算机图形和动画、医学和许多其他领域。经典的方法依赖于多项式函数来解决这个问题。然而,我们注意到,有些形状不能通过这种多项式格式恰当地逼近。在本文中,我们利用有理函数,特别是有理Bernstein基函数来解决这个问题。这提出了一个额外的挑战:我们不仅要计算得到的合理bsamzier拟合曲线的极点,还要获得它们相应的权重和数据点的适当参数化。总的来说,这导致了一个连续的多元非线性优化问题,无法通过传统的数学优化技术来解决。我们解决这个问题的方法是基于模因萤火虫算法,结合了强大的全局优化元启发式技术(萤火虫算法)和局部搜索方法。我们的方案的性能通过它的应用说明了四个说明性的例子,自由形式的合成形状。实验结果表明,我们的模因方法具有良好的性能,可以自动高精度地重建数据点的基本形状。对我们的基准的比较分析表明,我们的方法优于文献中报道的针对该问题的一些替代方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信