Results 251 to 260 of about 6,623 (299)

A note on irregular discrete wavelet transforms

IEEE Transactions on Information Theory, 1992
Estimates of frame bounds for wavelet frames generated by discrete sets in phase space satisfying only a certain density condition are deduced. Numerical examples show that these estimates, which are the sharpest results of this kind known to the authors, are rather poor compared to Daubechies' estimates (see ibid., vol.36, no.5, p.961-1005, 1990) for ...
Peder A. Olsen, Kristian Seip
exaly   +2 more sources

Discrete Lattice Wavelet Transform

IEEE Transactions on Circuits and Systems II: Express Briefs, 2007
The discrete wavelet transform (DWT) has gained a wide acceptance in denoising and compression coding of images and signals. In this work we introduce a discrete lattice wavelet transform (DLWT). In the analysis part, the lattice structure contains two parallel transmission channels, which exchange information via two crossed lattice filters.
Olkkonen, H., Olkkonen, Juuso
openaire   +3 more sources

CONVERGENCE OF THE DISCRETE WAVELET TRANSFORM

International Journal of Wavelets, Multiresolution and Information Processing, 2012
The discrete wavelet transform; depending of the pair of integers (m, n), applied to functions f in L2(R) with respect to an admissible function h in L2(R) of class C∞ with compact support, is used to prove that f is continuous at x = 0, and furthermore at any x = b in R if and only if there exists the convergence of the discrete wavelet transform, as
Jaime Navarro, Oscar Herrera-Alcántara
openaire   +1 more source

Discrete wavelet transforms in VLSI

[1992] Proceedings of the International Conference on Application Specific Array Processors, 2003
Three architectures, based on linear systolic arrays, for computing the discrete wavelet transform, are described. The AT/sup 2/ lower bound for computing the DWT in a systolic model is derived and shown to be AT/sup 2/= Omega (N/sup 2/N/sub w/k). Two of the architectures are within a factor of log N from optimal, but they are of practical importance ...
Mohan Vishwanath, Robert Michael Owens, Mary Jane Irwin   +2 more
openaire   +1 more source

Hardware implementation of Discrete Wavelet Transform and Inverse Discrete Wavelet Transform on FPGA

2010 IEEE 18th Signal Processing and Communications Applications Conference, 2010
In this paper, hardware implementation of the Discrete Wavelet Transform (DWT) and Inverse Discrete Wavelet Transform (IDWT) based on FPGA is explained. DWT and IDWT algorithms are implemented on the Altera Cyclone-II FPGA. Filtering processes of rows and columns are seriatim applied as in level-by-level architecture. But both addressing for read/write
Çavuşlu, Mehmet Ali, Karakaya, Fuat
openaire   +2 more sources

Initialization of orthogonal discrete wavelet transforms

IEEE Transactions on Signal Processing, 2000
Summary: The symptotic formulae of both the approximation error and the systematic error of a special prefilter projection and the quantitative estimates of the upper bounds of the errors are obtained. In addition, it is shown that for the Daubechies' orthogonal wavelet basis, the estimated constant is optimal.
Jiankang Zhang, Zheng Bao 0001
openaire   +2 more sources

Discrete Wavelets and Fast Wavelet Transform

1991
The wavelet analysis, introduced by J. MORLET and Y. MEYER in the middle of the eighties, is a processus of time-frequency (or time-scale) analysis which consists of decomposing a signal into a basis of functions (o jk ) called wavelets. These wavelets are in turn deduced from the analyzing wavelet o by dilatations and translations. More precisely:
Bonnet, Pierre, Rémond, Didier
openaire   +2 more sources

CONVOLUTION FOR THE DISCRETE WAVELET TRANSFORM

International Journal of Wavelets, Multiresolution and Information Processing, 2011
Translation and convolution associated with the discrete wavelet transform are investigated using properties of Calderón–Zygmund operator and Riesz fractional integral operator. Dual convolution is also studied. The wavelet convolution is applied to approximate functions belonging to certain Lp-spaces.
openaire   +2 more sources

Numerical Condition of Discrete Wavelet Transforms

SIAM Journal on Matrix Analysis and Applications, 1997
In many applications biorthogonal wavelets have been used rather than orthogonal ones, since the latter might exclude other useful properties like symmetry in the case of compactly supported wavelets. Thus one would like to study stability of biorthogonal wavelets and obtain quantitative information about sensitivity to noise in the data or ...
openaire   +1 more source

The Discrete Wavelet Transform

2013
Introduction Here we introduce the discrete wavelet transform (DWT), which is the basic tool needed for studying time series via wavelets and plays a role analogous to that of the discrete Fourier transform in spectral analysis. We assume only that the reader is familiar with the basic ideas from linear filtering theory and linear algebra
Donald B. Percival, Andrew T. Walden
openaire   +1 more source