bibtype J - Journal Article
ARLID 0576213
utime 20240402214510.1
mtime 20231006235959.9
SCOPUS 85174839455
WOS 001094808500001
DOI 10.1109/ACCESS.2023.3321969
title (primary) (eng) Accelerated and Improved Stabilization for High Order Moments of Racah Polynomials
specification
page_count 20 s.
media_type E
serial
ARLID cav_un_epca*0461036
ISSN 2169-3536
title IEEE Access
volume_id 11
volume 1 (2023)
page_num 110502-110521
publisher
name Institute of Electrical and Electronics Engineers
keyword Racah polynomials
keyword Recurrence formulas
keyword Stabilizing condition
keyword Improved stabilization
keyword Orthogonal moments
author (primary)
ARLID cav_un_auth*0428249
name1 Mahmmod
name2 B. M.
country IQ
author
ARLID cav_un_auth*0428248
name1 Abdulhussain
name2 S. H.
country IQ
author
ARLID cav_un_auth*0101203
name1 Suk
name2 Tomáš
institution UTIA-B
full_dept (cz) Zpracování obrazové informace
full_dept Department of Image Processing
department (cz) ZOI
department ZOI
full_dept Department of Image Processing
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0456010
name1 Alsabah
name2 M.
country IQ
author
ARLID cav_un_auth*0442693
name1 Hussain
name2 A.
country GB
source
url http://library.utia.cas.cz/separaty/2023/ZOI/suk-0576213.pdf
source
url https://ieeexplore.ieee.org/document/10271275
cas_special
project
project_id GA21-03921S
agency GA ČR
ARLID cav_un_auth*0412209
project
project_id StrategieAV21/1
agency AV ČR
country CZ
ARLID cav_un_auth*0441412
abstract (eng) Discrete Racah polynomials (DRPs) are highly efficient orthogonal polynomials widely used in various scientific fields for signal representation. They find applications in disciplines like image processing and computer vision. Racah polynomials were originally introduced by Wilson and later modified by Zhu to be orthogonal on a discrete set of samples. However, when the degree of the polynomial is high, it encounters numerical instability issues. In this paper, we propose a novel algorithm called Improved Stabilization (ImSt) for computing DRP coefficients. The algorithm partitions the DRP plane into asymmetric parts based on the polynomial size and DRP parameters. We have optimized the use of stabilizing conditions in these partitions. To compute the initial values, we employ the logarithmic gamma function along with a new formula. This combination enables us to compute the initial values efficiently for a wide range of DRP parameter values and large polynomial sizes. Additionally, we have derived a symmetry relation for the case when the Racah polynomial parameters are zero ($a=0$, $\alpha=0$, $\beta=0$). This symmetry makes the Racah polynomials symmetric, and we present a different algorithm for this specific scenario. We have demonstrated that the ImSt algorithm works for a broader range of parameters and higher degrees compared to existing algorithms. A comprehensive comparison between ImSt and the existing algorithms has been conducted, considering the maximum polynomial degree, computation time, restriction error analysis, and reconstruction error. The results of the comparison indicate that ImSt outperforms the existing algorithms for various values of Racah polynomial parameters.
result_subspec WOS
RIV IN
FORD0 20000
FORD1 20200
FORD2 20201
reportyear 2024
num_of_auth 5
inst_support RVO:67985556
permalink https://hdl.handle.net/11104/0346080
cooperation
ARLID cav_un_auth*0456012
name University of Baghdad
country IQ
cooperation
ARLID cav_un_auth*0331273
name Liverpool John Moores University
country GB
cooperation
ARLID cav_un_auth*0456013
name Khalifa University of Science and Technology
country AE
confidential S
mrcbC91 A
mrcbT16-e COMPUTERSCIENCEINFORMATIONSYSTEMS|ENGINEERINGELECTRICALELECTRONIC|TELECOMMUNICATIONS
mrcbT16-j 0.698
mrcbT16-D Q3
arlyear 2023
mrcbU14 85174839455 SCOPUS
mrcbU24 PUBMED
mrcbU34 001094808500001 WOS
mrcbU63 cav_un_epca*0461036 IEEE Access 11 1 2023 110502 110521 2169-3536 2169-3536 Institute of Electrical and Electronics Engineers