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 March 2006 | Published
Book Section - Chapter Open

Encoding the ℓ_p ball from limited measurements

Abstract

We address the problem of encoding signals which are sparse, i.e. signals that are concentrated on a set of small support. Mathematically, such signals are modeled as elements in the ℓ_p ball for some p ≤ 1. We describe a strategy for encoding elements of the ℓ_p ball which is universal in that 1) the encoding procedure is completely generic, and does not depend on p (the sparsity of the signal), and 2) it achieves near-optimal minimax performance simultaneously for all p < 1. What makes our coding procedure unique is that it requires only a limited number of nonadaptive measurements of the underlying sparse signal; we show that near-optimal performance can be obtained with a number of measurements that is roughly proportional to the number of bits used by the encoder. We end by briefly discussing these results in the context of image compression.

Additional Information

© 2006 IEEE. Issue Date: 28-30 March 2006. Date of Current Version: 10 April 2006.

Attached Files

Published - Candes2006p9151Dcc_2006_Data_Compression_Conference_Proceedings.pdf

Files

Candes2006p9151Dcc_2006_Data_Compression_Conference_Proceedings.pdf
Files (276.1 kB)

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024