A class of Laplacian multiwavelets bases for high-dimensional data

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce a framework for representing functions defined on high-dimensional data. In this framework, we propose to use the eigenvectors of the graph Laplacian to construct a multiresolution analysis on the data. We assume the dataset to have an associated hierarchical tree partition, together with a function that measures the similarity between pairs of points in the dataset. The construction results in a one parameter family of orthonormal bases, which includes both the Haar basis as well as the eigenvectors of the graph Laplacian, as its two extremes. We describe a fast discrete transform for the expansion in any of the bases in this family, and estimate the decay rate of the expansion coefficients. We also bound the error of non-linear approximation of functions in our bases. The properties of our construction are demonstrated using various numerical examples.

Original languageEnglish
Pages (from-to)420-451
Number of pages32
JournalApplied and Computational Harmonic Analysis
Volume38
Issue number3
DOIs
StatePublished - 1 May 2015

Keywords

  • Graph Laplacian
  • High dimensional data
  • Multiresolution analysis
  • Multiwavelets

Fingerprint

Dive into the research topics of 'A class of Laplacian multiwavelets bases for high-dimensional data'. Together they form a unique fingerprint.

Cite this