Fast Computation of Hahn Polynomials for High Order Moments
نویسندگان
چکیده
Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal they applied in various scientific areas such as image processing feature extraction. Commonly, DHPs used object representation; however, suffer from problem numerical instability when moment order becomes large. In this paper, an operative method compute basis is proposed high orders. This paper developed a new mathematical model for computing initial value DHP different values parameters ( $\alpha $ notation="LaTeX">$\beta ). addition, composed two recurrence algorithms with adaptive threshold stabilize generation coefficients. It compared state-of-the-art terms computational cost maximum size that can correctly generated. The experimental results show algorithm performs better both wide ranges parameter , polynomial sizes.
منابع مشابه
A spectral method based on Hahn polynomials for solving weakly singular fractional order integro-differential equations
In this paper, we consider the discrete Hahn polynomials and investigate their application for numerical solutions of the fractional order integro-differential equations with weakly singular kernel .This paper presented the operational matrix of the fractional integration of Hahn polynomials for the first time. The main advantage of approximating a continuous function by Hahn polynomials is tha...
متن کاملFast computation of Krawtchouk moments
Article history: Received 24 May 2013 Received in revised form 18 July 2014 Accepted 29 July 2014 Available online 7 August 2014
متن کاملAccurate and Efficient Computation of High Order Zernike Moments
Zernike Moments are useful tools in pattern recognition and image analysis due to their orthogonality and rotation invariance property. However, direct computation of these moments is very expensive, limiting their use especially at high orders. There has been some efforts to reduce the computational cost by employing quantized polar coordinate systems, which also reduces the accuracy of the mo...
متن کاملFast Gröbner Basis Computation for Boolean Polynomials
We introduce the Macaulay2 package BooleanGB, which computes a Gröbner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3170893