Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-02T20:03:47.873Z Has data issue: false hasContentIssue false

6 - Adaptive sensing for sparse recovery

Published online by Cambridge University Press:  05 November 2012

Jarvis Haupt
Affiliation:
University of Minnesota, USA
Robert Nowak
Affiliation:
University of Wisconsin, USA
Yonina C. Eldar
Affiliation:
Weizmann Institute of Science, Israel
Gitta Kutyniok
Affiliation:
Technische Universität Berlin
Get access

Summary

In recent years, tremendous progress has been made in high-dimensional inference problems by exploiting intrinsic low-dimensional structure. Sparsity is perhaps the simplest model for low-dimensional structure. It is based on the assumption that the object of interest can be represented as a linear combination of a small number of elementary functions, which are assumed to belong to a larger collection, or dictionary, of possible functions. Sparse recovery is the problem of determining which components are needed in the representation based on measurements of the object. Most theory and methods for sparse recovery are based on an assumption of non-adaptive measurements. This chapter investigates the advantages of sequential measurement schemes that adaptively focus sensing using information gathered throughout the measurement process. In particular, it is shown that adaptive sensing can be significantly more powerful when the measurements are contaminated with additive noise.

Introduction

High-dimensional inference problems cannot be accurately solved without enormous amounts of data or prior assumptions about the nature of the object to be inferred. Great progress has been made in recent years by exploiting intrinsic low-dimensional structure in high-dimensional objects. Sparsity is perhaps the simplest model for taking advantage of reduced dimensionality. It is based on the assumption that the object of interest can be represented as a linear combination of a small number of elementary functions. The specific functions needed in the representation are assumed to belong to a larger collection or dictionary of functions, but are otherwise unknown.

Type
Chapter
Information
Compressed Sensing
Theory and Applications
, pp. 269 - 304
Publisher: Cambridge University Press
Print publication year: 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×