Approximation and compression of scattered data by meshless multiscale decompositions

Richard Baraniuk, Albert Cohen, Raymond Wagner

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We introduce a class of multiscale decompositions for scattered discrete data, motivated by sensor network applications. A specific feature of these decompositions is that they do not rely on any type of mesh or connectivity between the data points. The decomposition is based on a thinning procedure that organizes the points in a multiscale hierarchy and on a local prediction operator based on least-square polynomial fitting. We prove that the resulting multiscale coefficients obey the same decay properties as classical wavelet coefficients when the analyzed function has some local smoothness properties. This yields compression capabilities that we illustrate by numerical experiments.

Original languageEnglish (US)
Pages (from-to)133-147
Number of pages15
JournalApplied and Computational Harmonic Analysis
Volume25
Issue number2
DOIs
StatePublished - Sep 2008

ASJC Scopus subject areas

  • Applied Mathematics

Fingerprint Dive into the research topics of 'Approximation and compression of scattered data by meshless multiscale decompositions'. Together they form a unique fingerprint.

Cite this