Explicit RIP Matrices in Compressed Sensing from Algebraic Geometry
نویسنده
چکیده
Compressed sensing was proposed by E. J. Candés, J. Romberg, T. Tao, and D. Donoho for efficient sampling of sparse signals in 2006 and has vast applications in signal processing. The expicit restricted isometry property (RIP) measurement matrices are needed in practice. Since 2007 R. DeVore, J. Bourgain et al and R. Calderbank et al have given several deterministic cosntrcutions of RIP matrices from various mathematical objects. On the other hand the strong coherence property of a measurement matrix was introduced by Bajwa and Calderbank et al for the recovery of signals under the noisy measuremnt. In this paper we propose new explicit construction of real valued RIP measurement matrices in compressed sensing from algebraic geometry. Our construction indicates that using more general algebraic-geometric objects rather than curves (AG codes), RIP measurement matrices in compressed sensing can be constructed with much smaller coherence and much bigger sparsity orders. The RIP matrices from algebraic geometry also have a nice asymptotic bound matching the bound from the previous constructions of Bourgain et al and the small-bias sets. On the negative side, we prove that the RIP matrices from DeVore’s construction, its direct algebraic geometric generalization and one of our new construction do not satisfy the strong coherence property. However we give a modified version of AG-RIP matrices which satisfies the strong coherence property. Therefore the new RIP matrices in compressed sensing from our modified algebraic geometric construction can be used for the recovery of signals from the noisy measurement. ∗H. Chen is with the Department of Mathematics, School of Sciences, Hangzhou Dianzi University, Hangzhou 310018, Zhejiang Province, China. H.Chen was supported by NSFC Grant 11371138.
منابع مشابه
What Is... a Rip Matrix?
RIP matrices– shorthand for matrices which satisfy the restricted isometry property– appeared as a byproduct of Compressed Sensing; a method discovered by D. Donoho, E. Candès and T. Tao in 2004 with several applications in computer science. Besides their real world application, RIP matrices are interesting mathematical objects because, on the one hand, a random matrix has a negligible probabil...
متن کاملAchievable Angles Between two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach
at analytically characterizing the achievable angles between u Φ and v Φ . Motivated by geometric interpretations of RIP and with the aid of the well-known law of cosines, we propose a plane geometry based formulation for the study of the considered problem. It is shown that all the RIP-induced norm/distance constraints on u Φ and v Φ can be jointly depicted via a simple geometric diagram in th...
متن کاملDeterministic Construction of RIP Matrices in Compressed Sensing from Constant Weight Codes
The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in signal processing. RIP matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs have been proposed and analysised. On the other hand binary constant weight codes have been studied for many years and many optimal or near-optimal small weight and d...
متن کاملCompressed Sensing: How sharp is the Restricted Isometry Property
Compressed Sensing (CS) seeks to recover an unknown vector with N entries by making far fewer than N measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the vector, not simply N . CS combines the important task of compression directly with the measurement task. Since its introduction in 2004 there have been hundreds of ma...
متن کاملExplicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck
Matrices with the restricted isometry property (RIP) are of particular interest in compressed sensing. To date, the best known RIP matrices are constructed using random processes, while explicit constructions are notorious for performing at the “square-root bottleneck,” i.e., they only accept sparsity levels on the order of the square root of the number of measurements. The only known explicit ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.07490 شماره
صفحات -
تاریخ انتشار 2015