The discrete Pascal transform and its applications

We introduce a new discrete polynomial transform constructed from the rows of Pascal's triangle. The forward and inverse transforms are computed the same way in both the one- and two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in digital image processing, such as bump and edge detection.

[1]  J. R. Martin,et al.  Information retrieval in digital watermarking , 2001, IEEE Commun. Mag..

[2]  John Riordan,et al.  Inverse Relations and Combinatorial Identities , 1964 .

[3]  Jun Shen,et al.  Range-image-based calculation of three-dimensional convex object moments , 1993, IEEE Trans. Robotics Autom..

[4]  Francisco J. García-Ugalde,et al.  z transform from lowpass to bandpass by Pascal matrix , 2004, IEEE Signal Processing Letters.

[5]  Richard J. Kozick,et al.  Discrete polynomial transform representation using binary matrices and flow diagrams , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[6]  Maurice F. Aburdene,et al.  Unification of Legendre, Laguerre, Hermite, and binomial discrete transforms using Pascal's matrix , 1994, Multidimens. Syst. Signal Process..

[7]  Francisco J. García-Ugalde,et al.  The bilinear Z transform by Pascal matrix and its application in the design of digital filters , 2002, IEEE Signal Processing Letters.