Generalized Tree-Based Wavelet Transform

Abstract : In this paper we propose a new wavelet transform applicable to functions defined on high dimensional data, weighted graphs and networks. The proposed method generalizes the Haar-like transform recently introduced by Gavish , and can also construct data adaptive orthonormal wavelets beyond Haar. It is defined via a hierarchical tree, which is assumed to capture the geometry and structure of the input data, and is applied to the data using a modified version of the common one-dimensional (1D) wavelet filtering and decimation scheme. The adaptivity of this wavelet scheme is obtained by permutations derived from the tree and applied to the approximation coefficients in each decomposition level, before they are filtered. We show that the proposed transform is more efficient than both the 1D and two-dimension 2D separable wavelet transforms in representing images. We also explore the application of the proposed transform to image denoising, and show that combined with a subimage averaging scheme, it achieves denoising results which are similar to those obtained with the K-SVD algorithm.
Type de document :
Article dans une revue
IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2011, 59 (9), pp.4199 -4209. 〈10.1109/TSP.2011.2158428〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00705951
Contributeur : Jules Espiau de Lamaestre <>
Soumis le : vendredi 8 juin 2012 - 15:28:58
Dernière modification le : samedi 14 avril 2018 - 23:58:03

Lien texte intégral

Identifiants

Collections

Citation

Idan Ram, Michael Elad, Israel Cohen. Generalized Tree-Based Wavelet Transform. IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2011, 59 (9), pp.4199 -4209. 〈10.1109/TSP.2011.2158428〉. 〈hal-00705951〉

Partager

Métriques

Consultations de la notice

259