Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal moments and they are applied in various scientific areas such as image processing and feature extraction. Commonly, DHPs are used as object representation; however, they suffer from the problem of numerical instability when the moment order becomes large. In this paper, an operative method to compute the Hahn orthogonal basis is proposed and applied to high orders. This paper developed a new mathematical model for computing the initial value of the DHP and for different values of DHP parameters ( $\alpha $ and $\beta $ ). In addition, the proposed method is composed of two recurrence algorithms with an adaptive threshold to stabilize the generation of the DHP coefficients. It is compared with state-of-the-art algorithms in terms of computational cost and the maximum size that can be correctly generated. The experimental results show that the proposed algorithm performs better in both parameters for wide ranges of parameter values $\alpha $ and $\beta $ , and polynomial sizes.
Vector fields are a special kind of multidimensional data, which are in a certain sense similar to digital color images, but are distinct from them in several aspects. In each pixel, the field is assigned to a vector that shows the direction and the magnitude of the quantity, which has been measured. To detect the patterns of interest in the field, special matching methods must be developed. In this paper, we propose a method for the description and matching of vector field patterns under an unknown affine transformation of the field. Unlike digital images, transformations of vector fields act not only on the spatial coordinates but also on the field values, which makes the detection different from the image case. To measure the similarity between the template and the field patch, we propose original invariants with respect to total affine transformation. They are designed from the vector field moments. It is demonstrated by experiments on real data from fluid mechanics that they perform significantly better than potential competitors.
Discrete Racah polynomials (DRPs) are highly efficient orthogonal polynomials and used in various scientific fields for signal representation. They find applications in disciplines like image processing and computer vision. Racah polynomials were originally introduced by Wilson and later modified by Zhu to be orthogonal on a discrete set of samples. However, when the degree of the polynomial is high, it encounters numerical instability issues. In this paper, we propose a novel algorithm called Improved Stabilization (ImSt) for computing DRP coefficients. The algorithm partitions the DRP plane into asymmetric parts based on the polynomial size and DRP parameters. We have optimized the use of stabilizing conditions in these partitions. To compute the initial values, we employ the logarithmic gamma function along with a new formula. This combination enables us to compute the initial values efficiently for a wide range of DRP parameter values and large polynomial sizes. Additionally, we have derived a symmetry relation for the case when the Racah polynomial parameters are zero (a=0, α=0, β=0). This symmetry makes the Racah polynomials symmetric about the main diagonal, and we present a different algorithm for this specific scenario. We have demonstrated that the ImSt algorithm works for a broader range of parameters and higher degrees compared to existing algorithms. A comprehensive comparison between ImSt and the existing algorithms has been conducted, considering the maximum polynomial degree, computation time, restriction error analysis, and reconstruction error. The results of the comparison indicate that ImSt outperforms the existing algorithms for various values of Racah polynomial parameters.