高多项式阶Hahn多项式的稳定计算

Mohamed Amine Tahiri, H. Karmouni, M. Sayyouri, H. Qjidaa
{"title":"高多项式阶Hahn多项式的稳定计算","authors":"Mohamed Amine Tahiri, H. Karmouni, M. Sayyouri, H. Qjidaa","doi":"10.1109/ISCV49265.2020.9204118","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new algorithm for computing Hahn polynomial coefficients (HPCs) for higher polynomial order, which greatly reduces the spread of numerical defects associated with Hahn polynomials (HPs) using conventional methods. The proposed method is used to reconstruct large 2D images. The reliability and effectiveness of the new approach were often linked to standard repetition algorithms. The findings show that the method proposed is efficient and effective in terms of calculation accuracy and stability of high order Hahn moments.","PeriodicalId":313743,"journal":{"name":"2020 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Stable Computation of Hahn Polynomials for Higher Polynomial Order\",\"authors\":\"Mohamed Amine Tahiri, H. Karmouni, M. Sayyouri, H. Qjidaa\",\"doi\":\"10.1109/ISCV49265.2020.9204118\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new algorithm for computing Hahn polynomial coefficients (HPCs) for higher polynomial order, which greatly reduces the spread of numerical defects associated with Hahn polynomials (HPs) using conventional methods. The proposed method is used to reconstruct large 2D images. The reliability and effectiveness of the new approach were often linked to standard repetition algorithms. The findings show that the method proposed is efficient and effective in terms of calculation accuracy and stability of high order Hahn moments.\",\"PeriodicalId\":313743,\"journal\":{\"name\":\"2020 International Conference on Intelligent Systems and Computer Vision (ISCV)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Intelligent Systems and Computer Vision (ISCV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCV49265.2020.9204118\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Intelligent Systems and Computer Vision (ISCV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCV49265.2020.9204118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种计算高多项式阶Hahn多项式系数(HPCs)的新算法,大大减少了传统方法中与Hahn多项式相关的数值缺陷的传播。该方法用于大型二维图像的重建。新方法的可靠性和有效性通常与标准重复算法联系在一起。结果表明,该方法在高阶哈恩矩的计算精度和稳定性方面是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stable Computation of Hahn Polynomials for Higher Polynomial Order
In this paper, we propose a new algorithm for computing Hahn polynomial coefficients (HPCs) for higher polynomial order, which greatly reduces the spread of numerical defects associated with Hahn polynomials (HPs) using conventional methods. The proposed method is used to reconstruct large 2D images. The reliability and effectiveness of the new approach were often linked to standard repetition algorithms. The findings show that the method proposed is efficient and effective in terms of calculation accuracy and stability of high order Hahn moments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信