Progressive texture synthesis can provide an added functional advantage to existing texture synthesis algorithms, which are time consuming and fail to deliver in some application areas. To provide practical solutions to this challenge we have previously proposed a Discrete Wavelet Transform (DWT) based texture synthesis algorithm for 2D surfaces. In this paper we propose the extension of this a...

De-noising algorithms based on wavelet thresholding replace small wavelet coeecients by zero and keep or shrink the coeecients with absolute value above the threshold. The optimal threshold minimizes the error of the result as compared to the unknown, exact data. To estimate this optimal threshold, we use Generalized Cross Validation. This procedure does not require an estimate for the noise en...

We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their "dual" domains by incorporating the "natural" distances between graph Laplacian eigenvectors, rather than simply using eigenvalue ordering. These dictionaries can be seen as generalizations classical Shannon wavelet packet dictionary to arbitrary graphs, and do not rely frequency interpretation eige...

This paper presents parallel algorithms for computing multi-dimensional wavelet transforms on both shared memory and distributed memory machines. Traditional data partitioning methods for n-dimensional Discrete Wavelet Transforms (DWTs) call for data redistribution once a one dimensional wavelet transform is computed along each dimension. To avoid the data communication inherent in this redistr...

De-noising algorithms based on wavelet thresholding replace small wavelet coeecients by zero and keep or shrink the coeecients with absolute value above the threshold. The optimal threshold minimizes the error of the result as compared to the unknown, exact data. To estimate this optimal threshold, we use Generalized Cross Validation. This procedure is fast and does not require an estimation fo...

Ramesh Neelamani December 23, 1998 Project Advisor: Prof. C.S. Burrus ELEC 696 Project Department of Electrical and Computer Engineering, Rice University, Houston, TX 77005. [email protected] Abstract Lifting has traditionally been described in the time/spatial domain and the intuition behind the entire scheme holds in this domain. It is known that the lifting scheme, as conventionally desc...

We describe several \wavelet transforms" which characterize smoothness spaces and for which the coe cients are obtained by sampling rather than integration. We use them to re-interpret the empirical wavelet transform, i.e. the common practice of applying pyramid lters to samples of a function.

We developed a general way to create integer wavelet transformations that can be used in lossless (reversible) compression of images with arbitrary size. The method, based on some updating techniques such as lifting and correction, allows us to generate a series of reversible integer transformations which have the similar features with the corresponding biorthogonal wavelet transforms and some ...

we present here the numerical solution of damped forced oscillator problem using haar wavelet and compare the numerical results obtained with some well-known numerical methods such as runge-kutta fourth order classical and taylor series methods. numerical results show that the present haar wavelet method gives more accurate approximations than above said numerical methods.