Share Email Print
cover

Proceedings Paper

Real-time FPGA implementation of recursive wavelet packet transform
Author(s): Vanishree Gopalakrishna; Nasser Kehtarnavaz; Chandrasekhar Patlolla; Matthias F. Carlsohn
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

To address the computational complexity of the wavelet packet transform of a moving window with a large amount of overlap between consecutive windows, the recursive computation approach was introduced previously1. In this work, this approach is extended to 2D or images. In addition, the FPGA implementation of the recursive approach for updating wavelet coefficients is performed by using the LabVIEW FPGA module. This programming approach is graphical and requires no knowledge of relatively involved hardware description languages. A number of optimization steps including both filter and wavelet stage pipelining are taken in order to achieve a real-time throughput. It is shown that the recursive approach reduces the computational complexity significantly as compared to the non-recursive or the classical computation of wavelet packet transform. For example, the number of multiplications is reduced by a factor of 3 for a 3-stage 1D transform of moving windows containing 128 samples and by a factor of 12 for a 3-stage 2D transform of moving window blocks of size 16×16 with 50% overlap.

Paper Details

Date Published: 2 May 2012
PDF: 9 pages
Proc. SPIE 8437, Real-Time Image and Video Processing 2012, 84370P (2 May 2012); doi: 10.1117/12.924156
Show Author Affiliations
Vanishree Gopalakrishna, The Univ. of Texas at Dallas (United States)
Nasser Kehtarnavaz, The Univ. of Texas at Dallas (United States)
Chandrasekhar Patlolla, The Univ. of Texas at Dallas (United States)
Matthias F. Carlsohn, Computer Vision and Image Communication (Germany)


Published in SPIE Proceedings Vol. 8437:
Real-Time Image and Video Processing 2012
Nasser Kehtarnavaz; Matthias F. Carlsohn, Editor(s)

© SPIE. Terms of Use
Back to Top