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]...

Full description

Bibliographic Details
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