Fast and accurate computation of high‐order Tchebichef polynomials

Abstract

Summary Discrete Tchebichef polynomials (DTPs) and their moments are effectively utilized in different fields such as video and image coding, pattern recognition, and computer vision due to their remarkable performance. However, when the moments order becomes large (high), DTPs prone to exhibit numerical instabilities. In this article, a computationally efficient and numerically stable recurrence algorithm is proposed for high order of moment. The proposed algorithm is based on combining two recurrence algorithms, which are the recurrence relations in the n$$ n $$ and x$$ x $$‐directions. In addition, an adaptive threshold is used to stabilize the generation of the DTP coefficients. The designed algorithm can generate the DTP coefficients for high moment's order and large signal size. By large signal size, we mean the samples of the discrete signal are large. To evaluate the performance of the proposed algorithm, a comparison study is performed with state‐of‐the‐art algorithms in terms of computational cost and capability of generating DTPs with large polynomial size and high moment order. The results show that the proposed algorithm has a remarkably low computation cost and is numerically stable, where the proposed algorithm is 27prefix×$$ \times $$ times faster than the state‐of‐the‐art algorithm.

Constrained numerical deconvolution using orthogonal polynomials

“…By leveraging orthogonal polynomials, this method offers: i) improved numerical stability in calculations, minimizing the impact of small errors in the deconvolved signal; ii) improved noise resistance, leading to cleaner estimates of the underlying functions; iii) better handling of complex patterns, ensuring more accurate reconstructions than other methods; and iv) additional flexibility in the deconvolution process through the choice of specific orthogonal polynomials (e.g., Legendre [46] , Racah [26] , Hermite, Chebyshev, etc.) [32] , [2] , [15] .…”

High-Performance Krawtchouk Polynomials of High Order Based on Multithreading

“…Fourier-Mellin and Zernike polynomials [8,9] are examples of polynomials that are orthogonal on a disc. On the other hand, Krawtchouk, Legendre, and Tchebichef polynomials [10][11][12] are polynomials that are orthogonal on a rectangle.…”

A Pitch Estimation Algorithm for Speech in Complex Noise Environments Based on the Radon Transform

“…In [12], an operative method is proposed to compute the Hahn orthogonal basis for high orders and effectively reduced the computational cost. In [13], a fast and accurate algorithm for high-order DTPs is proposed which provided great inspiration for signal processing.…”