Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Design and FPGA implementation of finite Ridgelet transform [image processing applications]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Uzun, I.S. ; Sch. of Comput. Sci., Queen''s Univ., Belfast, UK ; Amira, A.

The Ridgelet transform was recently introduced to overcome the weakness of wavelets in higher dimensions. In this paper, we present the design and FPGA implementation of the finite Ridgelet transform (FRIT) for image processing applications. The proposed architecture uses the finite Radon transform (FRAT) and 1D discrete biorthogonal wavelet transform (DBWT) as building blocks. A detailed evaluation of the FPGA implementation for the proposed architectures targeting the Xilinx Virtex-II device family has been reported, based on maximum system frequency, chip area and image size. The implementation results show that the core speed for the proposed FRIT architecture is around 100 MHz and it occupies 491 slices for an input image size of 7×7.

Published in:

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Date of Conference:

23-26 May 2005