Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 2011 | Accepted Version
Book Section - Chapter Open

Explicit Matrices for Sparse Approximation

Abstract

We show that girth can be used to certify that sparse compressed sensing matrices have good sparse approximation guarantees. This allows us to present the first deterministic measurement matrix constructions that have an optimal number of measurements for ℓ_1/ℓ_1 approximation. Our techniques are coding theoretic and rely on a recent connection of compressed sensing to LP relaxations for channel decoding.

Additional Information

© 2011 IEEE. Date of Current Version: 03 October 2011.

Attached Files

Accepted Version - Explicit_20matrices_20for_20sparse_20approximation.pdf

Files

Explicit_20matrices_20for_20sparse_20approximation.pdf
Files (628.9 kB)

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024