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}
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.