Fast and Scalable Computation of the Forward and Inverse Discrete Periodic Radon Transform

The discrete periodic radon transform (DPRT) has extensively been used in applications that involve image reconstructions from projections. Beyond classic applications, the DPRT can also be used to compute fast convolutions that avoids the use of floating-point arithmetic associated with the use of the fast Fourier transform. Unfortunately, the use of the DPRT has been limited by the need to compute a large number of additions and the need for a large number of memory accesses. This paper introduces a fast and scalable approach for computing the forward and inverse DPRT that is based on the use of: a parallel array of fixed-point adder trees; circular shift registers to remove the need for accessing external memory components when selecting the input data for the adder trees; an image block-based approach to DPRT computation that can fit the proposed architecture to available resources; and fast transpositions that are computed in one or a few clock cycles that do not depend on the size of the input image. As a result, for an N × N image (N prime), the proposed approach can compute up to N2 additions per clock cycle. Compared with the previous approaches, the scalable approach provides the fastest known implementations for different amounts of computational resources. For example, for a 251×251 image, for approximately 25% fewer flip-flops than required for a systolic implementation, we have that the scalable DPRT is computed 36 times faster. For the fastest case, we introduce optimized just 2N + ⌈log2 N⌉ + 1 and 2N + 3 ⌈log2 N⌉ + B + 2 cycles, architectures that can compute the DPRT and its inverse in respectively, where B is the number of bits used to represent each input pixel. On the other hand, the scalable DPRT approach requires more 1-b additions than for the systolic implementation and provides a tradeoff between speed and additional 1-b additions. All of the proposed DPRT architectures were implemented in VHSIC Hardware Description Language (VHDL) and validated using an Field-Programmable Gate Array (FPGA) implementation.

[1]  Daniel Llamocca,et al.  A Dynamically Reconfigurable Pixel Processor System Based on Power/Energy-Performance-Accuracy Optimization , 2013, IEEE Transactions on Circuits and Systems for Video Technology.

[2]  Imants D. Svalbe,et al.  Erasure Coding with the Finite Radon Transform , 2010, 2010 IEEE Wireless Communication and Networking Conference.

[3]  Vijay K. Madisetti,et al.  The fast discrete Radon transform. I. Theory , 1993, IEEE Trans. Image Process..

[4]  Hamid Soltanian-Zadeh,et al.  Radon transform orientation estimation for rotation invariant texture analysis , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Marios S. Pattichis,et al.  New algorithms for computing directional discrete Fourier transforms , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

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

[7]  D. Lun,et al.  Compressive sensing of images based on discrete periodic radon transform , 2014 .

[8]  W. Clem Karl,et al.  Line detection in images through regularized hough transform , 2006, IEEE Transactions on Image Processing.

[9]  Imants D. Svalbe,et al.  Geometric Shape Effects in Redundant Keys used to Encrypt Data Transformed by Finite Discrete Radon Projections , 2005, Digital Image Computing: Techniques and Applications (DICTA'05).

[10]  Ming-Ting Sun,et al.  Resource-Efficient FPGA Architecture and Implementation of Hough Transform , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  M. A. Fiddy,et al.  The Radon Transform and Some of Its Applications , 1985 .

[12]  Daniel Llamocca,et al.  A scalable architecture for implementing the fast discrete periodic radon transform for prime sized images , 2014, 2014 IEEE International Conference on Image Processing (ICIP).

[13]  Izidor Gertner A new efficient algorithm to compute the two-dimensional discrete Fourier transform , 1988, IEEE Trans. Acoust. Speech Signal Process..

[14]  V. Vlček Computation of Inverse Radon Transform on Graphics Cards , 2004 .

[15]  David Dagan Feng,et al.  Efficient blind image restoration using discrete periodic Radon transform , 2004, IEEE Transactions on Image Processing.

[16]  Daniel Llamocca,et al.  The Fast Discrete Periodic Radon Transform for prime sized images: Algorithm, architecture, and VLSI/FPGA implementation , 2014, 2014 Southwest Symposium on Image Analysis and Interpretation.

[17]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[18]  Artyom M. Grigoryan Comments on "The discrete periodic radon transform" , 2010, IEEE Trans. Signal Process..

[19]  Gregory Beylkin,et al.  Discrete radon transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[20]  Abbes Amira,et al.  Medical image denoising on field programmable gate array using finite Radon transform , 2012, IET Signal Process..

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

[22]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[23]  Wan-Chi Siu,et al.  The discrete periodic Radon transform , 1996, IEEE Trans. Signal Process..

[24]  Emmanuel J. Candès,et al.  The curvelet transform for image denoising , 2002, IEEE Trans. Image Process..

[25]  A. Kingston,et al.  Projective Transforms on Periodic Discrete Image Arrays , 2006 .

[26]  Vijay K. Madisetti,et al.  The fast discrete Radon transform , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[27]  Federica Battisti,et al.  Finite Radon coding for content delivery over hybrid client-server and P2P architecture , 2012, 2012 5th International Symposium on Communications, Control and Signal Processing.

[28]  Anil K. Jain Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[29]  Marios S. Pattichis Novel algorithms for the accurate, efficient, and parallel computation of multidimensional, regional discrete Fourier transforms , 2000, 2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099).

[30]  E. T. An Introduction to the Theory of Numbers , 1946, Nature.

[31]  Abbes Amira,et al.  An efficient VLSI architecture and FPGA implementation of the Finite Ridgelet Transform , 2008, Journal of Real-Time Image Processing.