Compressed sensing (CS) is a rapidly advancing area of signal processing and statistics that has the potential to radically change the way that analog signals are transformed into digital signals. The main idea is to acquire a sparse signal from a very small number of measurements using a specialized sampling and reconstruction process. Since one promising application of CS is medical imaging, improvements in CS systems are also expected to advance real-world healthcare applications. In this project, the investigators will study the fundamental connection between error-correcting codes (ECC) and CS and leverage recent advances in ECC to design improved CS measurement and reconstruction systems.

In particular, the connection between linear-programming (LP) decoding of binary linear codes and LP reconstruction will be used to develop a non-asymptotic theory for the design and analysis of CS algorithms and measurement matrices. The first part of the project will focus on novel relaxations of the CS reconstruction problem that allow non-convex regularization and iterative solution. The second part of the project will focus on applying the theory of pseudo-codewords, which was originally developed to understand iterative and LP decoding of binary linear codes, to achieve a non-asymptotic analysis of iterative reconstruction algorithms for CS. The third part of the project will focus on exploiting additional signal structure (i.e., beyond sparsity) that exists in high-contrast imaging applications such as angiograms.

Project Start
Project End
Budget Start
2013-01-16
Budget End
2015-08-31
Support Year
Fiscal Year
2013
Total Cost
$196,560
Indirect Cost
Name
University of Texas Austin
Department
Type
DUNS #
City
Austin
State
TX
Country
United States
Zip Code
78759