An efficient VLSI architecture and FPGA implementation of the Finite Ridgelet Transform

In this paper, an efficient architecture for the Finite Ridgelet Transform (FRIT) suitable for VLSI implementation based on a parallel, systolic Finite Radon Transform (FRAT) and a Haar Discrete Wavelet Transform (DWT) sub-block, respectively is presented. The FRAT sub-block is a novel parametrisable, scalable and high performance core with a time complexity of O(p2), where p is the block size. Field Programmable Gate Array (FPGA) and Application Specific Integrated Circuit (ASIC) implementations are carried out to analyse the performance of the FRIT core developed.

[1]  Abbes Amira,et al.  Design and FPGA implementation of finite Ridgelet transform [image processing applications] , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[2]  Minh N. Do,et al.  Orthonormal finite ridgelet transform for image compression , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[3]  Ethan D. Bolker,et al.  The finite Radon transform , 1987 .

[4]  Minh N. Do,et al.  Contourlets: a directional multiresolution image representation , 2002, Proceedings. International Conference on Image Processing.

[5]  Wael Badawy,et al.  Architectures for finite radon transform , 2004 .

[6]  E. Candès,et al.  Curvelets: A Surprisingly Effective Nonadaptive Representation for Objects with Edges , 2000 .

[7]  Rabi Mahapatra,et al.  FPGA Based Image Processing With The Curvelet Transform , 2003 .

[8]  Jan Flusser,et al.  Image Representation Via a Finite Radon Transform , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Abbes Amira,et al.  High speed/low power architectures for the finite radon transform , 2005, International Conference on Field Programmable Logic and Applications, 2005..