Discrete wavelet transform

Résumé

In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures both frequency and location information (location in time). Examples Haar wavelets Haar wavelet The first DWT was invented by Hungarian mathematician Alfréd Haar. For an input represented by a list of 2^n numbers, the Haar wavelet transform may be considered to pair up input values, storing the difference and passing the sum. This process is repeated recursively, pairing up the sums to prove the next scale, which leads to 2^n-1 differences and a final sum. Daubechies wavelets Daubechies wavelet The most commonly used set of discrete wavelet transforms was formulated by the Belgian mathematician Ingrid Daubechies in 1988. This formulation is based on the use

Source officielle

https://en.wikipedia.org/wiki/Discrete_wavelet_transform

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (100)

Publications associées

Chargement

Personnes associées (22)

, , , , , , , , ,

Afficher plus

Personnes associées

Chargement

Unités associées (12)

Unités associées

Chargement

Concepts associés (15)

Concepts associés

Chargement

Cours associés (12)

Cours associés

Chargement

Séances de cours associées (23)

Séances de cours associées

Chargement

, ,

A novel hybrid evolutionary neural network method to generate multiple spectrum-compatible artificial earthquake accelerograms (SCAEAs) is presented. Genetic algorithm is employed to optimize the weight values of networks. In order to improve the training efficiency, principal component analysis along with some other reduction techniques are used. The proposed evolutionary neural network develops an inverse mapping from compacted and reduced spectrum coefficients to the metamorphosed accelerogram's wavelet packet coefficients. As compared to the traditional methods, our algorithm is capable of generating an ensemble of dissimilar 10, 20, 30, and 40 s SCAEAs with better spectrum-compatibility and diversity, and proper computational efforts.

Taylor & Francis2011

Chargement

Directionlets

Vladan Velisavljevic

Efficient representation of geometrical information in images is very important in many image processing areas, including compression, denoising and feature extraction. However, the design of transforms that can capture these geometrical features and represent them with a sparse description is very challenging. Recently, the separable wavelet transform achieved a great success providing a computationally simple tool and allowing for a sparse representation of images. However, in spite of the success, the efficiency of the representation is limited by the spatial isotropy of the wavelet basis functions built in the horizontal and vertical directions as well as the lack of directionality. One-dimensional discontinuities in images (edges and contours), which are very important elements in visual perception, intersect with too many wavelet basis functions leading to a non-sparse representation. To capture efficiently these anisotropic geometrical structures characterized by many more than the horizontal and vertical directions, more flexible multi-directional and anisotropic transforms are required. We present a new lattice-based perfect reconstruction and critically sampled anisotropic multi-directional wavelet transform. The transform retains the separable filtering, subsampling and simplicity of computations and filter design from the standard two-dimensional wavelet transform, unlike in the case of some other existing directional transform constructions (e.g. curvelets, contourlets or edgelets). The corresponding anisotropic basis functions, which we call directionlets, have directional vanishing moments along any two directions with rational slopes. Furthermore, we show that this novel transform provides an efficient tool for non-linear approximation of images, achieving the decay of mean-square error O(N-1.55), which, while slower than the optimal rate O(N-2), is much better than O(N-1) achieved with wavelets, but at similar complexity. Owing to critical sampling, directionlets can easily be applied to image compression since it is possible to use Lagrange optimization as opposed to the case of overcomplete expansions. The compression algorithms based on directionlets outperform the methods based on the standard wavelet transform achieving better numerical results and visual quality of the reconstructed images. Moreover, we have adapted image denoising algorithms to be used in conjunction with an undecimated version of directionlets obtaining results that are competitive with the current state-of-the-art image denoising methods while having lower computational complexity.

EPFL2005

Chargement

, ,

2002

Chargement

Directionlets

Vladan Velisavljevic

EPFL2005