Computer Science – Information Theory
Scientific paper
2012-03-07
Computer Science
Information Theory
12 pages, 6 figures
Scientific paper
A recursive algorithm named Zero-point Attracting Projection (ZAP) is proposed recently for sparse signal reconstruction. Compared with the reference algorithms, ZAP demonstrates rather good performance in recovery precision and robustness. However, any theoretical analysis about the mentioned algorithm, even a proof on its convergence, is not available. In this work, a strict proof on the convergence of ZAP is provided and the condition of convergence is put forward. Based on the theoretical analysis, it is further proved that ZAP is non-biased and can approach the sparse solution to any extent, with the proper choice of step-size. Furthermore, the case of inaccurate measurements in noisy scenario is also discussed. It is proved that disturbance power linearly reduces the recovery precision, which is predictable but not preventable. The reconstruction deviation of $p$-compressible signal is also provided. Finally, numerical simulations are performed to verify the theoretical analysis.
Chen Laming
Gu Yuantao
Wang Xiaohan
No associations
LandOfFree
Proof of Convergence and Performance Analysis for Sparse Recovery via Zero-point Attracting Projection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proof of Convergence and Performance Analysis for Sparse Recovery via Zero-point Attracting Projection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of Convergence and Performance Analysis for Sparse Recovery via Zero-point Attracting Projection will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-395029