Abstract

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].

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.