Generalizing CoSaMP to signals from a union of low dimensional linear subspaces

Tom Tirer, Raja Giryes

Research output: Contribution to journalArticlepeer-review

Abstract

The idea that signals reside in a union of low dimensional subspaces subsumes many low dimensional models that have been used extensively in the recent decade in many fields and applications. Until recently, the vast majority of works have studied each one of these models on its own. However, a recent approach suggests providing general theory for low dimensional models using their Gaussian mean width, which serves as a measure for the intrinsic low dimensionality of the data. In this work we use this novel approach to study a generalized version of the popular compressive sampling matching pursuit (CoSaMP) algorithm, and to provide general recovery guarantees for signals from a union of low dimensional linear subspaces, under the assumption that the measurement matrix is Gaussian. We discuss the implications of our results for specific models, and use the generalized algorithm as an inspiration for a new greedy method for signal reconstruction in a combined sparse-synthesis and cosparse-analysis model. We perform experiments that demonstrate the usefulness of the proposed strategy.

Original languageEnglish
Pages (from-to)99-122
Number of pages24
JournalApplied and Computational Harmonic Analysis
Volume49
Issue number1
DOIs
StatePublished - Jul 2020

Keywords

  • CoSaMP
  • Compressive sampling
  • Gaussian mean width
  • Sparse representation
  • Union of subspaces

Fingerprint

Dive into the research topics of 'Generalizing CoSaMP to signals from a union of low dimensional linear subspaces'. Together they form a unique fingerprint.

Cite this