Redundant wavelets on graphs and high dimensional data clouds

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we propose a new redundant wavelet transform applicable to scalar functions defined on high dimensional coordinates, weighted graphs and networks. The proposed transform utilizes the distances between the given data points to construct tree-like structures. We modify the filter-bank decomposition scheme of the redundant wavelet transform by adding in each decomposition level operators that reorder the approximation coefficients. These reordering operators are derived by organizing the tree-node features so as to shorten the path that passes through these points. We explore the use of the proposed transform for the recovery of labels defined on point clouds and to image denoising, and show that in both cases the results are promising.

Original languageEnglish
Article number6176290
Pages (from-to)291-294
Number of pages4
JournalIEEE Signal Processing Letters
Volume19
Issue number5
DOIs
StatePublished - 2012

Keywords

  • High-dimensional signal processing
  • image denoising
  • label recovery
  • redundancy
  • tree
  • wavelet

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Redundant wavelets on graphs and high dimensional data clouds'. Together they form a unique fingerprint.

Cite this