By Topic

Recursive Gabor transform for images of very large size and design of massively parallel architecture

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
$33 $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

4 Author(s)
N. Venkateswaran ; Dept. of Comput. Sci. & Eng., Sri Venkateswara Coll. of Eng., Sriperumbudur, India ; M. Venkatachalam ; S. Swaminathan ; C. Srinivasan

The conventional Gabor transforms, complete and generalized, cannot be applied for image matrices received as different partitions. In practice, very large images are received in the form of submatrix partitions. Then, taking transform on different partitions (of the same image) at different times is of prime importance. The situation can be easily handled if the transformation algorithm is made recursive. The authors present a recursive Gabor transform (RGT) amenable for pipelining partitions of different images interleaved. Apriori knowledge of image size is not required for the RGT unlike the conventional Gabor Transform. A dedicated massively parallel architecture based on Pacube VLSI arrays is presented which achieves a high degree of pipelining with respect to different image matrices. The pipelining rate is proportional to the delay of a Pacube macrocell in mode 1 operation

Published in:

High-Performance Computing, 1997. Proceedings. Fourth International Conference on

Date of Conference:

18-21 Dec 1997