On Image Analysis by the Methods of Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Orthogonal Moment Features for Use With Parametric and Non-Parametric Classifiers
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis for the reconstruction of a noisy signal based on orthogonal moments
Applied Mathematics and Computation
Computation of forward and inverse MDCT using Clenshaw's recurrence formula
IEEE Transactions on Signal Processing
On the reconstruction aspects of moment descriptors
IEEE Transactions on Information Theory
Image analysis by Tchebichef moments
IEEE Transactions on Image Processing
Discrete orthogonal moments in image analysis
SPPR'07 Proceedings of the Fourth conference on IASTED International Conference: Signal Processing, Pattern Recognition, and Applications
A unified methodology for the efficient computation of discrete orthogonal image moments
Information Sciences: an International Journal
Discrete orthogonal moments in image analysis
SPPRA '07 Proceedings of the Fourth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications
Fast computation of tchebichef moments for binary and grayscale images
IEEE Transactions on Image Processing
The fast recursive computation of Tchebichef moment and its inverse transform based on Z-transform
Digital Signal Processing
Hi-index | 0.01 |
Tchebichef moment is a novel set of orthogonal moment applied in the fields of image analysis and pattern recognition. Less work has been made for the computation of Tchebichef moment and its inverse moment transform. In this paper, both a direct recursive algorithm and a compact algorithm are developed for the computation of Tchebichef moment. The effective recursive algorithm for inverse Tchebichef moment transform is also presented. Clenshaw's recurrence formula was used in this paper to transform kernels of the forward and inverse Tchebichef moment transform. There is no need for the proposed algorithms to compute the Tchebichef polynomial values. The approaches presented are more efficient compared with the straightforward methods, and particularly suitable for parallel VLSI implementation due to their regular and simple filter structures.