Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis

From MaRDI portal
Publication:413654

DOI10.1016/J.ACHA.2011.08.001zbMATH Open1242.42038arXiv1105.4924OpenAlexW2964012263MaRDI QIDQ413654FDOQ413654

Guangliang Chen, Mauro Maggioni, William Allard

Publication date: 7 May 2012

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: Data sets are often modeled as point clouds in RD, for D large. It is often assumed that the data has some interesting low-dimensional structure, for example that of a d-dimensional manifold M, with d much smaller than D. When M is simply a linear subspace, one may exploit this assumption for encoding efficiently the data by projecting onto a dictionary of d vectors in RD (for example found by SVD), at a cost (n+D)d for n data points. When M is nonlinear, there are no "explicit" constructions of dictionaries that achieve a similar efficiency: typically one uses either random dictionaries, or dictionaries obtained by black-box optimization. In this paper we construct data-dependent multi-scale dictionaries that aim at efficient encoding and manipulating of the data. Their construction is fast, and so are the algorithms that map data points to dictionary coefficients and vice versa. In addition, data points are guaranteed to have a sparse representation in terms of the dictionary. We think of dictionaries as the analogue of wavelets, but for approximating point clouds rather than functions.


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




Recommendations




Cites Work


Cited In (28)

Uses Software





This page was built for publication: Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis

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