Vol. 1, No. 1, 2013
Download this article
Download this article For screen
For printing
Recent Issues
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 3
Volume 6, Issue 2
Volume 6, Issue 1
Volume 5, Issue 3-4
Volume 5, Issue 2
Volume 5, Issue 1
Volume 4, Issue 3-4
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 4
Volume 3, Issue 3
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 2
Volume 1, Issue 1
The Journal
About the Journal
Editorial Board
Subscriptions
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
ISSN: 2325-3444 (e-only)
ISSN: 2326-7186 (print)
Author Index
To Appear
 
Other MSP Journals

Change is coming to MEMOCS: This journal is becoming a
subscription journal with select diamond open-access articles.
Read more about it.

TV-min and greedy pursuit for constrained joint sparsity and application to inverse scattering

Albert Fannjiang

Vol. 1 (2013), No. 1, 81–104
DOI: 10.2140/memocs.2013.1.81
Abstract

This paper proposes a general framework for compressed sensing of constrained joint sparsity (CJS) which includes total variation minimization (TV-min) as an example. The gradient- and 2-norm error bounds, independent of the ambient dimension, are derived for the CJS version of basis pursuit and orthogonal matching pursuit. As an application the results extend Candès, Romberg, and Tao’s proof of exact recovery of piecewise constant objects with noiseless incomplete Fourier data to the case of noisy data.

Keywords
total variation, joint sparsity, multiple measurement vectors, compressive sensing
Mathematical Subject Classification 2010
Primary: 15A29
Milestones
Received: 11 May 2012
Revised: 17 September 2012
Accepted: 12 November 2012
Published: 6 February 2013

Communicated by Micol Amar
Authors
Albert Fannjiang
Department of Mathematics
University of California, Davis
One Shields Ave.
Davis, CA 95616-8633
United States