Research reports

Geometric multiscale decompositions of dynamic low-rank matrices

by P. Grohs

(Report number 2012-03)

Abstract
The present paper is concerned with the study of manifold-valued multiscale transforms with a focus on the Stiefel manifold. For this speci c geometry we derive several formulas and algorithms for the computation of geometric means which will later enable us to construct multiscale transforms of wavelet type. As an application we study compression of piecewise smooth families of low-rank matrices both for synthetic data and also real-world data arising in hyperspectral imaging. As a main theoretical contribution we show that the manifold-valued wavelet transforms can achieve an optimal N-term approximation rate for piecewise smooth functions with possible discontinuities. This latter result is valid for arbitrary manifolds.

Keywords: Riemannian data, low-rank approximation, N-term approximation, compression, manifold-valued wavelet transforms

BibTeX
@Techreport{G12_155,
  author = {P. Grohs},
  title = {Geometric multiscale decompositions of dynamic low-rank matrices},
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2012-03},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2012/2012-03.pdf },
  year = {2012}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).

JavaScript has been disabled in your browser