Fast recursive computation of Krawtchouk polynomials
Krawtchouk polynomials (KPs) and their moments are used widely in the field of signal processing for their superior discriminatory properties. This study proposes a new fast recursive algorithm to compute Krawtchouk polynomial coefficients (KPCs). This algorithm is based on the symmetry property of...
Principais autores: | Abdulhussain, Sadiq H., Ramli, Abd Rahman, Sy Mohamed, Sy Abd Rahman Al-haddad, Mahmmod, Basheera M., Jassim, Wissam A. |
---|---|
Formato: | Artigo |
Idioma: | English |
Publicado em: |
Springer
2018
|
Acesso em linha: | http://psasir.upm.edu.my/id/eprint/72738/1/Fast%20recursive%20computation%20of%20Krawtchouk%20polynomials.pdf |
Registros relacionados
-
Image edge detection operators based on orthogonal polynomials
por: Abdulhussain, Sadiq H., et al.
Publicado em: (2017) -
High-Performance Krawtchouk Polynomials of High Order Based on Multithreading
por: Wameedh Nazar Flayyih, et al.
Publicado em: (2024-06-01) -
Fast temporal video segmentation based on Krawtchouk-Tchebichef moments
por: Abdulhussain, Sadiq H., et al.
Publicado em: (2020) -
A new separable moments based on Tchebichef-Krawtchouk polynomials
por: Idan, Zinah N., et al.
Publicado em: (2020) -
Signal compression and enhancement using a new orthogonal-polynomial-based discrete transform
por: Mahmmod, Basheera M., et al.
Publicado em: (2017)