Exact and stable recovery of sequences of signals with sparse increments via differential ℓ [subscript 1]-minimization
We consider the problem of recovering a sequence of vectors, (Xk)[K over k=0], for which the increments X[subscript k] - X[subscript k-1] are S[subscript k]-sparse (with S[subscript k] typically smaller than S[subscript 1]), based on linear measurements (Y[subscript k] = A[subscript k]X[subscript k]...
Main Authors: | Ba, Demba E. (Contributor), Babadi, Behtash (Contributor), Purdon, Patrick (Author), Brown, Emery N. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Brain and Cognitive Sciences (Contributor) |
Format: | Article |
Language: | English |
Published: |
Neural Information Processing Systems Foundation, Inc.,
2015-02-19T18:56:27Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms for Sparse Signal Recovery in the Presence of Noise
by: Babadi, Behtash, et al.
Published: (2014) -
Sparse spectral estimation from point process observations
by: Miran, Sina, et al.
Published: (2017) -
Robust spectrotemporal decomposition by iteratively reweighted least squares
by: Babadi, Behtash, et al.
Published: (2015) -
Exact recovery of sparse multiple measurement vectors by l 2 , p $l_{2,p}$ -minimization
by: Changlong Wang, et al.
Published: (2018-01-01) -
Stable Recovery of Sparse Signals and an Oracle Inequality
by: Cai, T. Tony, et al.
Published: (2011)