New Algorithm for Large-Sized 2D and 3D Image Reconstruction using Higher-Order Hahn Moments

被引:25
作者
Daoui, Achraf [1 ]
Yamni, Mohamed [2 ]
El Ogri, Omar [2 ]
Karmouni, Hicham [2 ]
Sayyouri, Mohamed [1 ]
Qjidaa, Hassan [2 ]
机构
[1] Sidi Mohamed Ben Abdellah Fez Univ, Natl Sch Appl Sci, Lab Engn Syst & Applicat LESA, Fes, Morocco
[2] Sidi Mohamed Ben Abdellah Fez Univ, Fac Sci, Lab Elect Signals & Syst Informat LESSI, Fes, Morocco
关键词
2D and 3D image reconstruction; Discrete orthogonal Hahn polynomials; Discrete orthogonal Hahn moments; Modified Gram-Schmidt process; High-order moments; FAST COMPUTATION; CHARLIER MOMENTS; TCHEBICHEF MOMENTS; RECURSIVE COMPUTATION; PATTERN-RECOGNITION; STABLE COMPUTATION; INVARIANT MOMENTS; SCALE INVARIANTS; MEIXNER MOMENTS; KRAWTCHOUK;
D O I
10.1007/s00034-020-01384-z
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Discrete orthogonal moments such as Hahn moments are powerful tools for image analysis, especially for the reconstruction of 2D and 3D images. Several methods have been proposed to calculate Hahn moments, but the computation of the kernel polynomials of these latter is limited by the problem of the numerical fluctuation of higher-order polynomial values (overflow). In this paper, we propose an efficient method for the exact computation of Hahn polynomials using the modified Gram-Schmidt orthonormalization processes. This method greatly reduces the propagation of numerical errors involved in the computation of Hahn polynomials by the conventional methods. The method thus proposed is used for reconstructing large-sized 2D and 3D images. A comparison with other kinds of discrete orthogonal moments is also established in order to validate the stability and superiority of the proposed method when reconstructing large-sized 2D and 3D images. The results obtained show the reliability and effectiveness of the proposed method in terms of computation accuracy and numerical stability of high-order Hahn moments.
引用
收藏
页码:4552 / 4577
页数:26
相关论文
共 45 条
[1]   Fast Recursive Computation of Krawtchouk Polynomials [J].
Abdulhussain, Sadiq H. ;
Ramli, Abd Rahman ;
Al-Haddad, Syed Abdul Rahman ;
Mahmmod, Basheera M. ;
Jassim, Wissam A. .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2018, 60 (03) :285-303
[2]   On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order [J].
Abdulhussan, Sadiz H. ;
Ramli, Abd Rahman ;
Al-Haddad, Syed Abdul Rahman ;
Mahmmod, Basheera M. ;
Jassim, Wissam A. .
IEEE ACCESS, 2017, 5 :2470-2478
[3]   Fast computation of Krawtchouk moments [J].
Asli, Barmak Honarvar Shakibaei ;
Flusser, Jan .
INFORMATION SCIENCES, 2014, 288 :73-86
[4]   Fast and accurate computation of Racah moment invariants for image classification [J].
Benouini, Rachid ;
Batioua, Imad ;
Zenkouar, Khalid ;
Zahi, Azeddine ;
El Fadili, Hakim ;
Qjidaa, Hassan .
PATTERN RECOGNITION, 2019, 91 :100-110
[5]   New set of generalized legendre moment invariants for pattern recognition [J].
Benouini, Rachid ;
Batioua, Imad ;
Zenkouar, Khalid ;
Mrabti, Fatiha ;
El Fadili, Hakim .
PATTERN RECOGNITION LETTERS, 2019, 123 :39-46
[6]   Sinusoidal Siemens star spatial frequency response measurement errors due to misidentified target centers [J].
Birch, Gabriel C. ;
Griffin, John C. .
OPTICAL ENGINEERING, 2015, 54 (07)
[7]   Some computational aspects of Tchebichef moments for higher orders [J].
Camacho-Bello, Cesar ;
Rivera-Lopez, Jose S. .
PATTERN RECOGNITION LETTERS, 2018, 112 :332-339
[8]   Stable computation of higher order Charlier moments for signal and image reconstruction [J].
Daoui, Achraf ;
Yamni, Mohamed ;
El Ogri, Omar ;
Karmouni, Hicham ;
Sayyouri, Mhamed ;
Qjidaa, Hassan .
INFORMATION SCIENCES, 2020, 521 :251-276
[9]   Stable, fast computation of high-order Zernike moments using a recursive method [J].
Deng, An-Wen ;
Wei, Chia-Hung ;
Gwo, Chih-Ying .
PATTERN RECOGNITION, 2016, 56 :16-25
[10]   An efficient image compression technique using Tchebichef bit allocation [J].
Ernawan, Ferda ;
Kabir, Nomani ;
Zamli, Kamal Zuhairi .
OPTIK, 2017, 148 :106-119