Recursive computation of Tchebichef moment and its inverse transform

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.

[1]  Roland T. Chin,et al.  On Image Analysis by the Methods of Moments , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  K. R. Ramakrishnan,et al.  Fast computation of Legendre and Zernike moments , 1995, Pattern Recognit..

[3]  Chee-Way Chong,et al.  A comparative analysis of algorithms for fast computation of Zernike moments , 2003, Pattern Recognit..

[4]  Huazhong Shu,et al.  An Efficient Method for Computation of Legendre Moments , 2000, Graph. Model..

[5]  Wen-Hsien Fang,et al.  Unified Fully-Pipelined VLSI Implementations of the One-and Two-Dimensional Real Discrete Trigonometric Transforms , 1999 .

[6]  Miroslaw Pawlak,et al.  On the reconstruction aspects of moment descriptors , 1992, IEEE Trans. Inf. Theory.

[7]  Wei Shen,et al.  On Geometric and Orthogonal Moments , 2000, Int. J. Pattern Recognit. Artif. Intell..

[8]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[9]  Miroslaw Pawlak,et al.  On Image Analysis by Moments , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  M. Teague Image analysis via the general theory of moments , 1980 .

[11]  Gerhard Fettweis,et al.  Computation of forward and inverse MDCT using Clenshaw's recurrence formula , 2003, IEEE Trans. Signal Process..

[12]  Huazhong Shu,et al.  Two new algorithms for efficient computation of Legendre moments , 2002, Pattern Recognit..

[13]  Richard J. Kozick,et al.  Computation of discrete cosine transform using Clenshaw's recurrence formula , 1995, IEEE Signal Processing Letters.

[14]  Mandyam D. Srinath,et al.  Orthogonal Moment Features for Use With Parametric and Non-Parametric Classifiers , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Chih-Peng Fan,et al.  Compact recursive structures for discrete cosine transform , 2000 .

[16]  Alvaro R. De Pierro,et al.  Analysis for the reconstruction of a noisy signal based on orthogonal moments , 2002, Appl. Math. Comput..

[17]  Sim Heng Ong,et al.  Image Analysis by Tchebichef Moments , 2001, IEEE Trans. Image Process..

[18]  Richard J. Kozick,et al.  Methods for designing efficient parallel‐recursive filter structures for computing discrete transforms , 2000, Telecommun. Syst..