.png){kind=icon}
.png){kind=icon}
Return
Learning-Based Compressive Subsampling
.png){kind=icon}
OA
AI
DOI：10.1109/JSTSP.2016.2548442.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of recovering a structured signal x is an element of C-p from a set of dimensionality-reduced linear measurements b = Ax arises in a variety of applications, such as medical imaging, spectroscopy, Fourier optics, and computerized tomography. Due to computational and storage complexity or physical constraints imposed by the problem, the measurement matrix A is an element of C-nxp is often of the form A = P Omega Psi for some orthonormal basis matrix Psi is an element of C-pxp and subsampling operator P-Omega : C-p -> C-n that selects the rows indexed by Omega. This raises the fundamental question of how best to choose the index set Omega in order to optimize the recovery performance. Previous approaches to addressing this question rely on nonuniform random subsampling using application-specific knowledge of the structure of x. In this paper, we instead take a principled learning-based approach in which a fixed index set is chosen based on a set of training signals x(1),..., x(m). We formulate combinatorial optimization problems seeking to maximize the energy captured in these signals in an average-case or worst-case sense, and we show that these can be efficiently solved either exactly or approximately via the identification of modularity and submodularity structures. We provide both deterministic and statistical theoretical guarantees showing how the resulting measurement matrices perform on signals differing from the training signals, and we provide numerical examples showing our approach to be effective on a variety of data sets.
Keywords:
Compressive sensing
learning-based measurement design
data-driven sensing design
nonuniform subsampling
structured sparsity
scientific and medical imaging
submodular optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.9K
Citations:
1.1W