Iteratively reweighted algorithm for signals recovery with coherent tight frame
Ning Bi, Kaihao Liang
Source abstract
We consider the problem of compressed sensing with a coherent tight frame and design an iteratively reweighted least squares algorithm to solve it. To analyze the problem, we propose a sufficient null space property under a tight frame (sufficient D‐NSP). We show that, if a measurement matrix A satisfies the sufficient D‐NSP of order s , then an s ‐sparse signal under the tight frame can be exactly recovered. Furthermore, if A satisfies the restricted isometric property with tight frame D of order 2 b s , then it also satisfies the sufficient D‐NSP of order a s with a < b and b sufficiently large. We prove the convergence of the algorithm based on the sufficient D‐NSP and give the upper error bounds. In numerical experiments, we use the discrete cosine transform, discrete Fourier transform, and Haar wavelets to verify the effectiveness of this algorithm. With increasing measurement number, the signal‐to‐noise ratio increases monotonically.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.