Generalized Tree-Based Wavelet Transform

DOI10.1109/TSP.2011.2158428zbMATH Open1392.94419DBLPjournals/tsp/RamEC11arXiv1011.4615WikidataQ60487157 ScholiaQ60487157MaRDI QIDQ4573166FDOQ4573166

Idan Ram, Israel Cohen, Michael Elad

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transform proposed in [1], and it is defined via a hierarchical tree, which is assumed to capture the geometry and structure of the input data. It is applied to the data using a modified version of the common one-dimensional (1D) wavelet filtering and decimation scheme, which can employ different wavelet filters. In each level of this wavelet decomposition scheme, a permutation derived from the tree is applied to the approximation coefficients, before they are filtered. We propose a tree construction method that results in an efficient representation of the input function in the transform domain. We show that the proposed transform is more efficient than both the 1D and two-dimensional (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.

Full work available at URL: https://arxiv.org/abs/1011.4615

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Application of orthogonal and other special functions (94A11)

Cited In (17)

• The Haar wavelet transform of a dendrogram
• A class of Laplacian multiwavelets bases for high-dimensional data
• Face recognition via collaborative representation based multiple one-dimensional embedding
• Parseval wavelets on hierarchical graphs
• Multiscale Discrete Framelet Transform for Graph-Structured Signals
• Adaptive Approximation Algorithms for Sparse Data Representation
• Data-driven tight frame learning scheme based on local and non-local sparsity with application to image recovery
• Wavelet shrinkage on paths for denoising of scattered data
• Hyperspectral image classification using wavelet transform-based smooth ordering
• Patch ordering as a regularization for inverse problems in image processing
• Semi-supervised learning using multiple one-dimensional embedding based adaptive interpolation
• Spatiotemporal analysis using Riemannian composition of diffusion operators
• Title not available (Why is that?)
• A region-based easy-path wavelet transform for sparse image representation
• Semi-supervised learning using ensembles of multiple 1D-embedding-based label boosting
• Multi-link wavelets on hierarchical graphs
• Samplets: construction and scattered data compression

This page was built for publication: Generalized Tree-Based Wavelet Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573166)