Comments on: 'Robust Line Fitting in a Noisy Image by the Method of Moments'
IEEE Transactions on Pattern Analysis and Machine Intelligence
Classical orthogonal polynomials: dependence on parameters
Journal of Computational and Applied Mathematics - Special issue on numerical analysis in the 20th century vol. 1: approximation theory
On a structure formula for classical q-orthogonal polynomials
Journal of Computational and Applied Mathematics
Analysis for the reconstruction of a noisy signal based on orthogonal moments
Applied Mathematics and Computation
Some discrete multiple orthogonal polynomials
Journal of Computational and Applied Mathematics - Proceedings of the sixth international symposium on orthogonal polynomials, special functions and their applications
Journal of Computational and Applied Mathematics - Proceedings of the sixth international symposium on orthogonal polynomials, special functions and their applications
Image analysis by discrete orthogonal Racah moments
Signal Processing
Image indexing using moments and wavelets
IEEE Transactions on Consumer Electronics
Image analysis by Tchebichef moments
IEEE Transactions on Image Processing
Image analysis by Krawtchouk moments
IEEE Transactions on Image Processing
Some computational aspects of discrete orthonormal moments
IEEE Transactions on Image Processing
A unified methodology for the efficient computation of discrete orthogonal image moments
Information Sciences: an International Journal
Image analysis by Bessel-Fourier moments
Pattern Recognition
Quaternion Fourier-Mellin moments for color images
Pattern Recognition
Fast computation of tchebichef moments for binary and grayscale images
IEEE Transactions on Image Processing
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Rotation and translation invariants of Gaussian-Hermite moments
Pattern Recognition Letters
Image analysis by Gaussian-Hermite moments
Signal Processing
Generalized dual Hahn moment invariants
Pattern Recognition
The fast recursive computation of Tchebichef moment and its inverse transform based on Z-transform
Digital Signal Processing
Hi-index | 0.10 |
In this paper, we introduce a set of discrete orthogonal functions known as dual Hahn polynomials. The Tchebichef and Krawtchouk polynomials are special cases of dual Hahn polynomials. The dual Hahn polynomials are scaled to ensure the numerical stability, thus creating a set of weighted orthonormal dual Hahn polynomials. They are allowed to define a new type of discrete orthogonal moments. The discrete orthogonality of the proposed dual Hahn moments not only ensures the minimal information redundancy, but also eliminates the need for numerical approximations. The paper also discusses the computational aspects of dual Hahn moments, including the recurrence relation and symmetry properties. Experimental results show that the dual Hahn moments perform better than the Legendre moments, Tchebichef moments, and Krawtchouk moments in terms of image reconstruction capability in both noise-free and noisy conditions. The dual Hahn moment invariants are derived using a linear combination of geometric moments. An example of using the dual Hahn moment invariants as pattern features for a pattern classification application is given.