Sharp RIP Bound for Sparse Signal and Low-Rank Matrix Recovery

Loading...
Thumbnail Image
Penn collection
Statistics Papers
Degree type
Discipline
Subject
compressed sensing
dantzig selector
ℓ1 minimization
low-rank matrix recovery
nuclear norm minimization
restricted isometry
sparse signal recovery
Applied Statistics
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Cai, T. Tony
Zhang, Anru
Contributor
Abstract

This paper establishes a sharp condition on the restricted isometry property (RIP) for both the sparse signal recovery and low-rank matrix recovery. It is shown that if the measurement matrix A satisfies the RIP condition δkA < 1/3, then all k-sparse signals β can be recovered exactly via the constrained ℓ1 minimization based on y = Aβ. Similarly, if the linear map M satisfies the RIP condition δrM, then all matrices X of rank at most r can be recovered exactly via the constrained nuclear norm minimization based on b = M(X). Furthermore, in both cases it is not possible to do so in general when the condition does not hold. In addition, noisy cases are considered and oracle inequalities are given under the sharp RIP condition.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2013-07-01
Journal title
Applied and Computational Harmonic Analysis
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection