Tolerant Compressed Sensing With Partially Coherent Sensing Matrices
نویسندگان
چکیده
Most of compressed sensing (CS) theory to date is focused on incoherent sensing, that is, columns from the sensing matrix are highly uncorrelated. However, sensing systems with naturally occurring correlations arise in many applications, such as signal detection, motion detection and radar. Moreover, in these applications it is often not necessary to know the support of the signal exactly, but instead small errors in the support and signal are tolerable. Despite the abundance of work utilizing incoherent sensing matrices, for this type of tolerant recovery we suggest that coherence is actually beneficial. We promote the use of coherent sampling when tolerant support recovery is acceptable, and demonstrate its advantages empirically. In addition, we provide a first step towards theoretical analysis by considering a specific reconstruction method for selected signal classes.
منابع مشابه
Compressed sensing and designs: theory and simulations
In An asymptotic result on compressed sensing matrices [4], a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we analyse the performance of these matrices using deterministic and probabilistic methods. We provide a new recovery algorithm and detailed simulations. These simulations suggest that the construction is competitive with...
متن کاملMismatch and resolution in compressive imaging
Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant dictionaries as sparsifying operators. Algorithms (BOMP, BLOOMP) based on techniques of band exclusion and local optimization are proposed to enhance Orthogonal Matching Pursuit (OMP)...
متن کاملA Novel Coherence Reduction Method in Compressed Sensing for DOA Estimation
A novel method named as coherent column replacement method is proposed to reduce the coherence of a partially deterministic sensing matrix, which is comprised of highly coherent columns and random Gaussian columns. The proposed method is to replace the highly coherent columns with random Gaussian columns to obtain a new sensing matrix. The measurement vector is changed accordingly. It is proved...
متن کاملA null space analysis of the L1 synthesis method in dictionary-based compressed sensing
An interesting topic in compressed sensing aims to recover signals with sparse representations in a dictionary. Recently the performance of the l1-analysis method has been a focus, while some fundamental problems for the l1-synthesis method are still unsolved. For example, what are the conditions for it to stably recover compressible signals under noise? Whether coherent dictionaries allow the ...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.05094 شماره
صفحات -
تاریخ انتشار 2016