Fast recursive computation of Krawtchouk polynomials
From MaRDI portal
Recommendations
- On fast computation of a polynomial in the Frobenius matrix
- Efficient computation of Laguerre polynomials
- Fast algorithms for the characteristic polynomial
- Efficient computation of squarefree separator polynomials
- Efficient computation of the characteristic polynomial
- Fast computation of Krawtchouk moments
- Publication:3485872
- Fast algorithms using orthogonal polynomials
- Faster algorithms for the characteristic polynomial
Cites work
- scientific article; zbMATH DE number 48956 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 2228141 (Why is no real title available?)
- Content-based image quality metric using similarity measure of moment vectors
- Digital Pattern Recognition by Moments
- Edge detection based on Krawtchouk polynomials
- Hypergeometric orthogonal polynomials and their \(q\)-analogues. With a foreword by Tom H. Koornwinder
- Image analysis by Tchebichef moments
- On moments of classical orthogonal polynomials
- Zeros of generalized Krawtchouk polynomials
Cited in
(7)- Recursive technique for computation of Gramians
- Mehler-Heine type formulas for the Krawtchouk polynomials
- Fast computation of Krawtchouk moments
- scientific article; zbMATH DE number 1263411 (Why is no real title available?)
- A new hybrid form of Krawtchouk and Tchebichef polynomials: design and application
- 2D and 3D image localization, compression and reconstruction using new hybrid moments
- Stable computation of higher order Charlier moments for signal and image reconstruction
This page was built for publication: Fast recursive computation of Krawtchouk polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799470)
