scholarly journals Compressed sensing with coherent tight frames via $l_q$-minimization for $0 < q \leq 1$

2014 ◽  
Vol 8 (3) ◽  
pp. 761-777 ◽  
Author(s):  
Song Li ◽  
◽  
Junhong Lin
2017 ◽  
Vol 2017 ◽  
pp. 1-8
Author(s):  
Yao Wang ◽  
Jianjun Wang

This paper establishes new sufficient conditions on the restricted isometry property (RIP) for compressed sensing with coherent tight frames. One of our main results shows that the RIP (adapted to D) condition δk+θk,k<1 guarantees the stable recovery of all signals that are nearly k-sparse in terms of a coherent tight frame D via the l1-analysis method, which improves the existing ones in the literature.


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Xiaohu Luo ◽  
Wanzhen Yang ◽  
Jincai Ha ◽  
Xing Ai ◽  
Xishan Tian

2015 ◽  
Vol 92 (3) ◽  
pp. 496-507 ◽  
Author(s):  
FEN-GONG WU ◽  
DONG-HUI LI

In this paper, we consider signal recovery via $l_{1}$-analysis optimisation. The signals we consider are not sparse in an orthonormal basis or incoherent dictionary, but sparse or nearly sparse in terms of some tight frame $D$. The analysis in this paper is based on the restricted isometry property adapted to a tight frame $D$ (abbreviated as $D$-RIP), which is a natural extension of the standard restricted isometry property. Assuming that the measurement matrix $A\in \mathbb{R}^{m\times n}$ satisfies $D$-RIP with constant ${\it\delta}_{tk}$ for integer $k$ and $t>1$, we show that the condition ${\it\delta}_{tk}<\sqrt{(t-1)/t}$ guarantees stable recovery of signals through $l_{1}$-analysis. This condition is sharp in the sense explained in the paper. The results improve those of Li and Lin [‘Compressed sensing with coherent tight frames via $l_{q}$-minimization for $0<q\leq 1$’, Preprint, 2011, arXiv:1105.3299] and Baker [‘A note on sparsification by frames’, Preprint, 2013, arXiv:1308.5249].


PLoS ONE ◽  
2015 ◽  
Vol 10 (4) ◽  
pp. e0119584 ◽  
Author(s):  
Yunsong Liu ◽  
Jian-Feng Cai ◽  
Zhifang Zhan ◽  
Di Guo ◽  
Jing Ye ◽  
...  

2015 ◽  
Vol 63 (15) ◽  
pp. 3974-3985 ◽  
Author(s):  
Peng Zhang ◽  
Lu Gan ◽  
Sumei Sun ◽  
Cong Ling

2017 ◽  
Vol 2017 (1) ◽  
Author(s):  
Evaggelia Tsiligianni ◽  
Lisimachos P. Kondi ◽  
Aggelos K. Katsaggelos

2016 ◽  
Vol 15 (04) ◽  
pp. 505-520
Author(s):  
Dekai Liu ◽  
Song Li

In this paper, we consider to recover a signal which is sparse in terms of a tight frame from undersampled measurements via [Formula: see text]-minimization problem for [Formula: see text]. In [Compressed sensing with coherent tight frames via [Formula: see text]-minimization for [Formula: see text], Inverse Probl. Imaging 8 (2014) 761–777], Li and Lin proved that when [Formula: see text] there exists a [Formula: see text], depending on [Formula: see text] such that for any [Formula: see text], each solution of the [Formula: see text]-minimization problem can approximate the true signal well. The constant [Formula: see text] is referred to as the [Formula: see text]-RIP constant of order [Formula: see text] which was first introduced by Candès et al. in [Compressed sensing with coherent and redundant dictionaries, Appl. Comput. Harmon. Anal. 31 (2011) 59–73]. The main aim of this paper is to give the closed-form expression of [Formula: see text]. We show that for every [Formula: see text]-RIP constant [Formula: see text], if [Formula: see text] where [Formula: see text] then the [Formula: see text]-minimization problem can reconstruct the true signal approximately well. Our main results also hold for the complex case, i.e. the measurement matrix, the tight frame and the signal are all in the complex domain. It should be noted that the[Formula: see text]-RIP condition is independent of the coherence of the tight frame (see [Compressed sensing with coherent and redundant dictionaries, Appl. Comput. Harmon. Anal. 31 (2011) 59–73]). In particular, when the tight frame reduces to an identity matrix or an orthonormal matrix, the conclusions in our paper coincide with the results appeared in [Stable recovery of sparse signals via [Formula: see text]-minimization, Appl. Comput. Harmon. Anal. 38 (2015) 161–176].


Sign in / Sign up

Export Citation Format

Share Document