Fast algorithms for discrete and continuous wavelet transforms
نویسندگان
چکیده
منابع مشابه
Fast algorithms for discrete and continuous wavelet transforms
Several algorithms are reviewed for computing various types of wavelet transforms: the Mallat algorithm, the “a trous” algorithm and their generalizations by Shensa. The goal is 1) to develop guidelines for implementing discrete and continuous wavelet transforms efficiently, 2) to compare the various algorithms obtained and give an idea of possible gains by providing operation counts. The compu...
متن کاملContinuous and Discrete Wavelet Transforms
Rob A. Zuidwijk CWI E-mail: [email protected] Url: http://www.cwi.nl/cwi/projects/wavelets.html November 6, 1997 Abstract In this lecture, the continuous wavelet transform will be discussed and some attention will be given to the discrete wavelet transform. Finally, wavelet transforms on multidimensional data will be considered. The set-up of the lecture is as follows: 1. The continuous wavelet t...
متن کاملContinuous and Discrete Wavelet Transforms
This paper is an expository survey of results on integral representations and discrete sum expansions of functions in L(R) in terms of coherent states. Two types of coherent states are considered: Weyl–Heisenberg coherent states, which arise from translations and modulations of a single function, and affine coherent states, called “wavelets,” which arise as translations and dilations of a singl...
متن کاملFast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk , then P coincides with CN+1 := (cos jkπ N )j,k=0. This paper presents a new fast algorithm for the computation of the matrixvector product Pa in O(N logN) arithmetical operations. The algorithm divides into a fast transform wh...
متن کاملFast Wavelet Transforms and Numerical Algorithms
The purpose of this paper is to introduce a class of numerical algorithms designed for rapid application of dense matrices (or integral operators) to vectors. As is well-known, applying directly a dense N×N− matrix to a vector requires roughly N operations, and this simple fact is a cause of serious difficulties encountered in large-scale computations. For example, the main reason for the limit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1992
ISSN: 0018-9448,1557-9654
DOI: 10.1109/18.119724