<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0565460</ARLID> <utime>20230418205243.9</utime><mtime>20221214235959.9</mtime>   <SCOPUS>85129655037</SCOPUS> <WOS>000795507300001</WOS>  <DOI>10.1109/ACCESS.2022.3170893</DOI>           <title language="eng" primary="1">Fast Computation of Hahn Polynomials for High Order Moments</title>  <specification> <page_count>14 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0461036</ARLID><ISSN>2169-3536</ISSN><title>IEEE Access</title><part_num/><part_title/><volume_id>10</volume_id><volume>1 (2022)</volume><page_num>48719-48732</page_num><publisher><place/><name>Institute of Electrical and Electronics Engineers</name><year/></publisher></serial>    <keyword>Hahn polynomials</keyword>   <keyword>Hahn moments</keyword>   <keyword>propagation error</keyword>   <keyword>numerical error</keyword>    <author primary="1"> <ARLID>cav_un_auth*0428249</ARLID> <name1>Mahmmod</name1> <name2>B. M.</name2> <country>IQ</country> </author> <author primary="0"> <ARLID>cav_un_auth*0428248</ARLID> <name1>Abdulhussain</name1> <name2>S. H.</name2> <country>IQ</country> </author> <author primary="0"> <ARLID>cav_un_auth*0101203</ARLID> <name1>Suk</name1> <name2>Tomáš</name2> <institution>UTIA-B</institution> <full_dept language="cz">Zpracování obrazové informace</full_dept> <full_dept>Department of Image Processing</full_dept> <department language="cz">ZOI</department> <department>ZOI</department> <full_dept>Department of Image Processing</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0442693</ARLID> <name1>Hussain</name1> <name2>A.</name2> <country>GB</country> <garant>K</garant> </author>   <source> <url>http://library.utia.cas.cz/separaty/2022/ZOI/suk-0565460.pdf</url> </source> <source> <url>https://ieeexplore.ieee.org/document/9764684</url>  </source>        <cas_special> <project> <project_id>GA21-03921S</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0412209</ARLID> </project> <project> <project_id>StrategieAV21/1</project_id> <agency>AV ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0441412</ARLID> </project>  <abstract language="eng" primary="1">Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal moments and they are applied in various scientific areas such as image processing and feature extraction. Commonly, DHPs are used as object representation, however, they suffer from the problem of numerical instability when the moment order becomes large. In this paper, an operative method to compute the Hahn orthogonal basis is proposed and applied to high orders. This paper developed a new mathematical model for computing the initial value of the DHP and for different values of DHP parameters (alpha and beta). In addition, the proposed method is composed of two recurrence algorithms with an adaptive threshold to stabilize the generation of the DHP coefficients. It is compared with state-of-the-art algorithms in terms of computational cost and the maximum size that can be correctly generated. The experimental results show that the proposed algorithm performs better in both parameters for wide ranges of parameter values alpha and beta, and polynomial sizes.</abstract>     <result_subspec>WOS</result_subspec> <RIV>IN</RIV> <FORD0>20000</FORD0> <FORD1>20200</FORD1> <FORD2>20201</FORD2>    <reportyear>2023</reportyear>      <num_of_auth>4</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>https://hdl.handle.net/11104/0337913</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> 1* Article Computer Science Information Systems|Engineering Electrical Electronic|Telecommunications </unknown> <unknown tag="mrcbC91"> A </unknown>         <unknown tag="mrcbT16-e">COMPUTERSCIENCE.INFORMATIONSYSTEMS|ENGINEERING.ELECTRICAL&amp;ELECTRONIC|TELECOMMUNICATIONS</unknown> <unknown tag="mrcbT16-f">4.1</unknown> <unknown tag="mrcbT16-g">0.7</unknown> <unknown tag="mrcbT16-h">2.9</unknown> <unknown tag="mrcbT16-i">0.32756</unknown> <unknown tag="mrcbT16-j">0.685</unknown> <unknown tag="mrcbT16-k">239575</unknown> <unknown tag="mrcbT16-s">0.926</unknown> <unknown tag="mrcbT16-5">3.600</unknown> <unknown tag="mrcbT16-6">9547</unknown> <unknown tag="mrcbT16-7">Q2</unknown> <unknown tag="mrcbT16-C">57.3</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <unknown tag="mrcbT16-M">0.89</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">63.8</unknown> <arlyear>2022</arlyear>       <unknown tag="mrcbU14"> 85129655037 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000795507300001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0461036 IEEE Access 2169-3536 2169-3536 Roč. 10 č. 1 2022 48719 48732 Institute of Electrical and Electronics Engineers </unknown> </cas_special> </bibitem>