An alternative lagrange-dual based algorithm for sparse signal reconstruction

IEEE Transactions on Signal Processing

Volumn 59, Issue 4, 2011, Pages 1895-1901

  Wang, Yiju ^a   Zhou, Guanglu ^b   Caccetta, Louis ^b   Liu, Wanquan ^b  

^a QUFU NORMAL UNIVERSITY   (China)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

Dual program; gradient type method; sparse signal reconstruction; strong duality theorem

Indexed keywords

DUAL PROGRAM; GRADIENT-TYPE METHOD; LAGRANGE; MINIMIZATION PROBLEMS; NUMERICAL EXAMPLE; OPTIMIZATION PROBLEMS; ORIGINAL SIGNAL; SPARSE SIGNAL RECONSTRUCTION; STATE OF THE ART; STRONG DUALITY;

ALGORITHMS; LAGRANGE MULTIPLIERS; NUMERICAL ANALYSIS; OPTIMIZATION; SIGNAL ANALYSIS;

SIGNAL RECONSTRUCTION;

EID: 79952655935     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2103066     Document Type: Article

References (49)

1. S. Agarwal and D. Roth, "Learning a sparse representation for object detection," in ECCV, 2002, pp. 97-101.
2. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms. New York: Wiley, 1993.
3. M. Bertalmio, L. Vese, G. Sapiro, and S. Osher, "Simultaneous structure and texture image inpainting," IEEE Trans. Image Process., vol. 12, no. 8, pp. 882-889, Aug. 2003.
4. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
5. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
6. R. H. Byrd, P. Lu, J. Nocedal, and C. Zhu, "A limited memory algorithm for bound constrained optimization," SIAM J. Sci. Comput., vol. 16, pp. 1190-1208, 1995.
7. E. J. Cande's, "Compressive sampling," in Proc. Int. Congr. Math., 2006, vol. 3, pp. 1433-1452.
8. E. J. Cande's, "The restricted isometry property and its applications for compressed sensing," Compte Rendus de l'Academie des Sciences. Paris, France, vol. 1, pp. 589-592, 2008.
9. E. J. Cande's, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
10. E. J. Cande's and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
11. E. J. Cande's and M. Wakin, "An introduction to compressive sampling," IEEE Signal. Process. Mag., vol. 25, pp. 21-30, 2008.
12. A. Chakrabarti and F. Hirakawa, "Effective separation of sparse and non-sparse image features for denoising," in Proc. Int. Conf. Acoust., Speech, Signal Process. (ICASSP), Apr. 2008, pp. 857-860.
13. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1999. (Pubitemid 128689501)
14. S. F. Cotter, K. Kreutz-Delgado, and B. D. Rao, "Backward sequential elimination for sparse vector subset selection," Signal Process., vol. 81, pp. 1849-1864, Sep. 2002. (Pubitemid 32723681)
15. S. F. Cotter, K. Kreutz-Delgado, and B. D. Rao, "Efficient backward elimination algorithm for sparse signal representation using overcomplete dictionaries," IEEE Signal Process. Lett., vol. 9, no. 5, pp. 145-147, May 2002. (Pubitemid 34878649)
16. C. Couvreur and Y. Bresler, "On the optimality of the backward greedy algorithm for the subset selection problem," SIAM J. Matrix Anal. Appl., vol. 21, no. 3, pp. 797-808, 1999.
17. I. Daubechies, M. Defrise, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, pp. 1413-1457, 2004. (Pubitemid 39427442)
18. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," Constr. Approx., vol. 13, no. 1, pp. 57-98, Mar. 7, 1997.
19. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
20. D. L. Donoho, "For most large underdetermined systems of linear equations, the minimal l1 norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol. 59, no. 6, pp. 797-829, 2006. (Pubitemid 43667226)
21. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, Nov. 2001. (Pubitemid 33053488)
22. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2558-2567, Sep. 2002. (Pubitemid 35032680)
23. M. Figueiredo and R. Nowak, "A bound optimization approach to wavelet-based image deconvolution," in Proc. IEEE Int. Conf. Image Process., 2005, pp. 782-785. (Pubitemid 44539056)
24. M. Figueiredo, R. Nowak, and S. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process., vol. 1, pp. 586-598, 2007.
25. J. J. Fuchs, "Recovery of exact sparse representations in the presence of noise," in Proc. IEEE Int. Conf. Acoust., Speec, Signal Process. (ICASSP), Montreal, QC, Canada, May 2004, vol. II, pp. 533-536.
26. J. J. Fuchs, "More on sparse representations in arbitrary bases," IEEE Trans. Inf. Theory, vol. 50, pp. 1341-1344, 2004.
27. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss, "Near-optimal sparse Fourier representations via sampling," in Proc. 2002 ACM Symp. Theory Comput. (STOC), 2002, pp. 152-161. (Pubitemid 35009373)
28. E. T. Hale, W. Yin, and Y. Zhang, "A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing," Comput. Appl. Math. Dept., Rice Univ., Houston, TX, CAAM Tech. Rep. TR07-07, Jul. 2007.
29. M. A. Iwen, "A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods," in Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), 2008, pp. 20-29.
30. S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "An interior-point method for large-scale l1 -regularized least squares," IEEE J. Select. Topics Signal Process., vol. 1, no. 4, pp. 606-617, Dec. 2007. (Pubitemid 351266626)
31. M. H. Li, H. Kudo, J. C. Hu, and R. H. Johnson, "Improved iterative algorithm for sparse object reconstruction and its performance evaluation with micro-CT data," IEEE Trans. Nucl. Sci., vol. 51, no. 3, pp. 659-666, Jun. 2004.
32. M. Lustig, J. M. Santos, D. L. Donoho, and J. M. Pauly, "Rapid MR angiography with randomly under-sampled 3DFT trajectories and nonlinear reconstruction," presented at the 9th Annu. Meeting, Soc. For Cardiovascular Magnetic Resonance, Miami, FL, 2006.
33. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Precess., vol. 41, no. 12, pp. 3379-3415, Dec. 1993.
34. O. L. Mangasarian and R. R. Meyer, "Nonlinear perturbation of linear programs," SIAM J Control Optim., vol. 17, no. 6, pp. 745-752, 1979.
35. A. Miller, Subset Selection in Regression. London, U.K.: Chapman Hall, 2002.
36. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, no. 2, pp. 227-234, 1995.
37. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, pp. 301-321, 2009.
38. J. C. Niebles, H. Wang, and L. Fei-Fei, "Unsupervised learning of human action categories using spatial-temporal words," Int. J. Comput. Vis., vol. 79, p. 299C318, 2008.
39. J. Nocedal and S. J. Wright, Numerical Optimization. New York: Springer-Verlag, 1999.
40. R. Tomioka and M. Sugiyama, "Dual-augmented Lagrangian method for efficient sparse reconstruction," IEEE Signal Process. Lett., vol. 16, no. 12, pp. 1067-1070, Dec. 2009.
41. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol. 51, pp. 1030-1051, 2006. (Pubitemid 46444890)
42. J. A. Tropp and S. J. Wright, Computational methods for sparse solution of linear inverse problems Caltech ACM Technical Report 2009-01, preprint.
43. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655-4666, Dec. 2007.
44. Y. Tsaig and D. L. Donoho, "Breakdown of equivalence between the minimal l1 -norm solution and the sparsest solution," Signal Process., vol. 86, no. 3, pp. 533-548, Mar. 2006. (Pubitemid 43106570)
45. Y. Tsaig and D. L. Donoho, "Extensions of compressed sensing," Signal Process., vol. 86, no. 3, pp. 549-571, Mar. 2006. (Pubitemid 43106571)
46. J. Wright, A. Young, A. Ganesh, S. S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Trans. Pattern Recogn. Anal. Mach. Intell., vol. 31, no. 2, pp. 210-227, Feb. 2009.
47. S. Yan and H. Wang, "Semi-supervised learning by sparse representation," in Proc. SIAM Int. Conf. Data Min. (SDM), 2009, pp. 792-801.
48. S. Yun and K.-C. Toh, "A coordinate gradient descent method for l1-regularized convex minimization," Comput. Optim. Appl., to be published.
49. M. Zibulewsky and B. Pearlmutter, "Blind source separation by sparse decomposition on a signal dictionary," Neural Comput., vol. 13, pp. 863-882, 2001. (Pubitemid 33594308)