Fast recursive computation of Krawtchouk polynomials

DOI10.1007/s10851-017-0758-9zbMath1400.33034OpenAlexW2753977426MaRDI QIDQ1799470

Sadiq H. Abdulhussain, Syed Abdul Rahman Al-Haddad, Wissam A. Jassim, Basheera M. Mahmmod, Abd Rahman Ramli

Publication date: 19 October 2018

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: http://psasir.upm.edu.my/id/eprint/72738/1/Fast%20recursive%20computation%20of%20Krawtchouk%20polynomials.pdf

zbMATH Keywords

orthogonal polynomialssignal processingKrawtchouk polynomialpropagation errorKrawtchouk moments

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical approximation and evaluation of special functions (33F05)

Related Items (4)

Stable computation of higher order Charlier moments for signal and image reconstruction ⋮ 2D and 3D image localization, compression and reconstruction using new hybrid moments ⋮ A new hybrid form of Krawtchouk and Tchebichef polynomials: design and application ⋮ Mehler-Heine type formulas for the Krawtchouk polynomials

Uses Software

• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Content-based image quality metric using similarity measure of moment vectors
• On moments of classical orthogonal polynomials
• Zeros of generalized Krawtchouk polynomials
• Edge detection based on Krawtchouk polynomials
• Hypergeometric Orthogonal Polynomials and Their q-Analogues
• Image analysis by Tchebichef moments
• Digital Pattern Recognition by Moments

This page was built for publication: Fast recursive computation of Krawtchouk polynomials