Thresholded Landweber Iteration (TLI) is an attractive algorithm since it has the advantage of simplicity for the problem of sparse reconstruction. However, this algorithm depends heavily on the coherence property of the redundant ictionary, and its convergence rate is slow. In this paper, we develop a modified version of TLI by using a sensing dictionary. The proposed algorithm significantly improves the reconstruction performance and the convergence roperties when compared to the classical TLI. We provide a sufficient condition for which the modified TLI algorithm an be guaranteed to exactly identify the correct atoms and also discuss the convergence properties for this agorithm. Finally, simulation results are presented to demonstrate the superior performance of the proposed lgorithm.
1. Blumensath, T. and M. E. Davies, "Iterative thresholding for sparse approximations," The Journal of Fourier Analysis and Applications, Vol. 14, No. 5, 629-654, Dec. 2008. doi:10.1007/s00041-008-9035-z
2. Zhang, Y., Q. Wan, and A. Huang, "Localization of narrow band sources in the presence of mutual coupling sparse solution finding," Progress In Electromagnetics Resaerch, Vol. 86, 243-257, 2008. doi:10.2528/PIER08090703
3. Pati, Y. C., R. Rezaiifar, and P. S. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, Proc. 27th Annu. Asilomar Conf. Signals, Systems, and Computers, Vol. 1, 40-44, Pacific Grove, CA, Nov. 1993.
4. Daubechies, I., M. Defrise, and C. De Mol, "An iterative thresholding algorothm for linear inverse problems," Comm. Pure Appl. Math., Vol. 57, No. 11, 1413-1457, Aug. 2004. doi:10.1002/cpa.20042