Computational algorithms for discrete wavelet transform using fixed-size filter matrices

Anna Z. Baraniecki; Salahadin O. Karim

doi:10.1117/12.138249

9 July 1992 Computational algorithms for discrete wavelet transform using fixed-size filter matrices

Anna Z. Baraniecki, Salahadin O. Karim

Proceedings Volume 1699, Signal Processing, Sensor Fusion, and Target Recognition; (1992) https://doi.org/10.1117/12.138249
Event: Aerospace Sensing, 1992, Orlando, FL, United States

Abstract

This paper describes matrix based algorithms for computing wavelet transform representations with application to multiresolution analysis. Structure of the algorithm presented is well suited for programming purpose and also for the implementation on VLSI processors. By using overlap-add or overlap-save techniques, constant matrix size can be used to accommodate arbitrary data lengths. Performance of the algorithm described in this paper is illustrated by decomposing an image into details and smoothed components.

Citation Download Citation

Anna Z. Baraniecki and Salahadin O. Karim "Computational algorithms for discrete wavelet transform using fixed-size filter matrices", Proc. SPIE 1699, Signal Processing, Sensor Fusion, and Target Recognition, (9 July 1992); https://doi.org/10.1117/12.138249

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available