- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Convex optimization for generalized sparse recovery
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Convex optimization for generalized sparse recovery van den Berg, Ewout
Abstract
The past decade has witnessed the emergence of compressed sensing as a way of acquiring sparsely representable signals in a compressed form. These developments have greatly motivated research in sparse signal recovery, which lies at the heart of compressed sensing, and which has recently found its use in altogether new applications. In the first part of this thesis we study the theoretical aspects of joint-sparse recovery by means of sum-of-norms minimization, and the ReMBo-l₁ algorithm, which combines boosting techniques with l₁-minimization. For the sum-of-norms approach we derive necessary and sufficient conditions for recovery, by extending existing results to the joint-sparse setting. We focus in particular on minimization of the sum of l₁, and l₂ norms, and give concrete examples where recovery succeeds with one formulation but not with the other. We base our analysis of ReMBo-l₁ on its geometrical interpretation, which leads to a study of orthant intersections with randomly oriented subspaces. This work establishes a clear picture of the mechanics behind the method, and explains the different aspects of its performance. The second part and main contribution of this thesis is the development of a framework for solving a wide class of convex optimization problems for sparse recovery. We provide a detailed account of the application of the framework on several problems, but also consider its limitations. The framework has been implemented in the SPGL1 algorithm, which is already well established as an effective solver. Numerical results show that our algorithm is state-of-the-art, and compares favorably even with solvers for the easier---but less natural---Lagrangian formulations. The last part of this thesis discusses two supporting software packages: Sparco, which provides a suite of test problems for sparse recovery, and Spot, a Matlab toolbox for the creation and manipulation of linear operators. Spot greatly facilitates rapid prototyping in sparse recovery and compressed sensing, where linear operators form the elementary building blocks. Following the practice of reproducible research, all code used for the experiments and generation of figures is available online at http://www.cs.ubc.ca/labs/scl/thesis/09vandenBerg/.
Item Metadata
Title |
Convex optimization for generalized sparse recovery
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2009
|
Description |
The past decade has witnessed the emergence of compressed sensing as
a way of acquiring sparsely representable signals in a compressed
form. These developments have greatly motivated research in sparse
signal recovery, which lies at the heart of compressed sensing, and
which has recently found its use in altogether new applications.
In the first part of this thesis we study the theoretical aspects of
joint-sparse recovery by means of sum-of-norms minimization, and the
ReMBo-l₁ algorithm, which combines boosting techniques with
l₁-minimization. For the sum-of-norms approach we derive
necessary and sufficient conditions for recovery, by extending
existing results to the joint-sparse setting. We focus in particular
on minimization of the sum of l₁, and l₂ norms, and give
concrete examples where recovery succeeds with one formulation but
not with the other. We base our analysis of ReMBo-l₁ on its
geometrical interpretation, which leads to a study of orthant
intersections with randomly oriented subspaces. This work
establishes a clear picture of the mechanics behind the method, and
explains the different aspects of its performance.
The second part and main contribution of this thesis is the
development of a framework for solving a wide class of convex
optimization problems for sparse recovery. We provide a detailed
account of the application of the framework on several problems, but
also consider its limitations. The framework has been implemented in
the SPGL1 algorithm, which is already well established as an
effective solver. Numerical results show that our algorithm is
state-of-the-art, and compares favorably even with solvers for the
easier---but less natural---Lagrangian formulations.
The last part of this thesis discusses two supporting software
packages: Sparco, which provides a suite of test problems for
sparse recovery, and Spot, a Matlab toolbox for the creation and
manipulation of linear operators. Spot greatly facilitates rapid
prototyping in sparse recovery and compressed sensing, where linear
operators form the elementary building blocks.
Following the practice of reproducible research, all code used for
the experiments and generation of figures is available online at
http://www.cs.ubc.ca/labs/scl/thesis/09vandenBerg/.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2009-12-14
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-ShareAlike 3.0 Unported
|
DOI |
10.14288/1.0051332
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2010-05
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-ShareAlike 3.0 Unported