A new bound on the block restricted isometry constant in compressed sensing
نویسندگان
چکیده
This paper focuses on the sufficient condition of block sparse recovery with the [Formula: see text]-minimization. We show that if the measurement matrix satisfies the block restricted isometry property with [Formula: see text], then every block s-sparse signal can be exactly recovered via the [Formula: see text]-minimization approach in the noiseless case and is stably recovered in the noisy measurement case. The result improves the bound on the block restricted isometry constant [Formula: see text] of Lin and Li (Acta Math. Sin. Engl. Ser. 29(7):1401-1412, 2013).
منابع مشابه
A Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit
We shall show that if the restricted isometry constant (RIC) δs+1(A) of the measurement matrix A satisfies δs+1(A) < 1 √ s+ 1 , then the greedy algorithm Orthogonal Matching Pursuit(OMP) will succeed. That is, OMP can recover every s-sparse signal x in s iterations from b = Ax. Moreover, we shall show the upper bound of RIC is sharp in the following sense. For any given s ∈ N, we shall construc...
متن کاملRestricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse and compressible signals. Many recovery algorithms are known to succeed when the restricted isometry constants of the sampling matrix are small. Many potential applications of compressed sensing involve a data-acquisitio...
متن کاملNear optimal bound of orthogonal matching pursuit using restricted isometric constant
As a paradigm for reconstructing sparse signals using a set of under sampled measurements, compressed sensing has received much attention in recent years. In identifying the sufficient condition under which the perfect recovery of sparse signals is ensured, a property of the sensing matrix referred to as the restricted isometry property (RIP) is popularly employed. In this article, we propose t...
متن کاملImproved Bounds for RIC in Compressed Sensing
This paper improves bounds for restricted isometry constant (RIC) in compressed sensing. Let Φ be a m × n real matrix and k be a positive integer with k ≤ n. The main results of this paper show that if the restricted isometry constant of Φ satisfies δk+ak < 3 2 − 1 + √ (4a+ 3)2 − 8 8a for a > 3 8 , then k-sparse solution can be recovered exactly via l1 minimization in the noiseless case. In par...
متن کاملA Null-Space-Based Weighted `1 Minimization Approach to Compressed Sensing∗
It has become an established fact that the constrained `1 minimization is capable of recovering the sparse solution from a small number of linear observations and the reweighted version can significantly improve its numerical performance. The recoverability is closely related to the Restricted Isometry Constant (RIC) of order s (s is an integer), often denoted as δs. A class of sufficient condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017