Toward deterministic compressed sensing.

نویسنده

  • Jeffrey D Blanchard
چکیده

Over the past decade, compressed sensing has delivered significant advances in the theory and application of measuring and compressing data. Consider capturing a 10 mega pixel image with a digital camera. Emailing an image of this size requires an unnecessary amount of storage space and bandwidth. Instead, users employ a standard digital compression scheme, such as JPEG, to represent the image as a 64KB file. The compressed image is completely recognizable even though the dimension of the compressed version is a tiny fraction of the original 10 million dimensions. Compressed sensing takes this mathematical phenomenon one step further. Is it possible to capture the pertinent information, such as the 64KB image, without first measuring the full 10 million pixel values? If so, how should we perform the measurements? If we capture the important information, can we still reconstruct the image from this limited number of observations? Compressed sensing exploded in 2004 when Donoho (1,2) and Candes and Tao (3) definitively answered these questions by incorporating randomness in the measurement process. Since engineering a truly random process is impossible, a major open problem in compressed sensing is the search for deterministic methods for sparse signal measurement that capture the relevant information in the signal and permit accurate reconstruction. In this issue of PNAS, Monajemi et al. (4) provide a major step forward in understanding the potential for deterministic measurement matrices in compressed sensing. Capturing digital images on a camera is simple; however, there are many applications where the measurement process has a much greater underlying cost. Magnetic Resonance Imaging (MRI) is a prime example of a high‐impact compressed sensing application. For most MRI examinations, a patient is required to lie still in a confined space for roughly 45 minutes. In some situations, compressed sensing has generated diagnostic‐quality MR images using only 10% as many measurements (5). MRI is only a single example of compressed sensing applications which extend well beyond imaging and include computed tomography, electro‐cardiography, multispectral imaging, seismology, analog to digital conversion, radar, X‐ray holography, astronomy, DNA sequencing, genotyping, and more (6). Traditional signal processing procedures measure the full signal directly and apply standard compression routines for storage or transmission. When needed, the original signal can be reconstructed by inverting the linear compression procedure. Compressed sensing transfers the workload from the measurement process to the signal reconstruction. While the measurement process remains linear, the reduced number of measurements forces a …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Construction of Deterministic Compressed Sensing Matrices via Singular Linear Spaces over Finite Fields

As an emerging approach of signal processing, not only has compressed sensing (CS) successfully compressed and sampled signals with few measurements, but also has owned the capabilities of ensuring the exact recovery of signals. However, the above-mentioned properties are based on the (compressed) sensing matrices. Hence the construction of sensing matrices is the key problem. Compared with the...

متن کامل

Deterministic Compressed Sensing Matrices from Additive Character Sequences

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a K×N measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for N = K, and to present a sufficient condition on the ...

متن کامل

A new method on deterministic construction of the measurement matrix in compressed sensing

Construction on the measurement matrix A is a central problem in compressed sensing. Although using random matrices is proven optimal and successful in both theory and applications. A deterministic construction on the measurement matrix is still very important and interesting. In fact, it is still an open problem proposed by T. Tao. In this paper, we shall provide a new deterministic constructi...

متن کامل

Stability of Efficient Deterministic Compressed Sensing for Images with Chirps and Reed-Muller Sequences

We explore the stability of image reconstruction algorithms under deterministic compressed sensing. Recently, we have proposed [1-3] deterministic compressed sensing algorithms for 2D images. These algorithms are suitable when Daubechies wavelets are used as the sparsifying basis. In the initial work, we have shown that the algorithms perform well for images with sparse wavelets coefficients. I...

متن کامل

Deterministic construction of Fourier-based compressed sensing matrices using an almost difference set

In this paper, a new class of Fourier-based matrices is studied for deterministic compressed sensing. Initially, a basic partial Fourier matrix is introduced by choosing the rows deterministically from the inverse discrete Fourier transform (DFT) matrix. By row/column rearrangement, the matrix is represented as a concatenation of DFT-based submatrices. Then, a full or a part of columns of the c...

متن کامل

Efficient Deterministic Compressed Sensing for Images with Chirps and Reed-muller Sequences∗

A recent approach to compressed sensing using deterministic sensing matrices formed from discrete frequency-modulated chirps or from Reed-Muller sequences is extended to support efficient deterministic reconstruction of signals that are less sparse than envisioned in the original work. In particular, this allows the application of this approach in imaging. The reconstruction algorithm developed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Proceedings of the National Academy of Sciences of the United States of America

دوره 110 4  شماره 

صفحات  -

تاریخ انتشار 2013