Sparse signal recovery and dynamic update of the underdetermined system

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2010, Pages 798-802

  Asif, M Salman ^a   Romberg, Justin ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC UPDATE; HOMOTOPIES; LINEAR MEASUREMENTS; MINIMIZATION PROBLEMS; MODERN SIGNAL PROCESSING; OVERCOMPLETE DICTIONARIES; RECONSTRUCTION PROBLEMS; SPARSE APPROXIMATIONS; SPARSE SIGNALS; SYSTEM MATRICES; SYSTEM OF EQUATIONS; UNDERLYING SYSTEMS;

SIGNAL PROCESSING;

INDEPENDENT COMPONENT ANALYSIS;

EID: 79958018723     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2010.5757675     Document Type: Conference Paper

References (28)

1. D. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2845-2862, Nov 2001.
2. E. Candès and T. Tao, "Decoding by linear programming," IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
3. 1 minimization," Proc. Nat. Aca. Sci, vol. 100, no. 5, pp. 2197-2202, 2003.
4. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
5. E. Candès, "Compressive sampling," Proceedings of the International Congress of Mathematicians, Madrid, Spain, vol. 3, pp. 1433-1452, 2006.
6. D. Donoho, "Compressed sensing," IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289-1306, April 2006.
7. B. Natarajan, "Sparse Approximate Solutions to Linear Systems," SIAM Journal on Computing, vol. 24, p. 227, 1995.
8. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, March 2004.
9. 1-MAGIC: Recovery of Sparse Signals via Convex Programming." http://www.acm.caltech.edu/ l1magic/.
10. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 33-61, 1999.
11. R. Tibshirani, "Regression shrinkage and selection via the lasso," Journal of the Royal Statistical Society, Series B, vol. 58, no. 1, pp. 267-288, 1996.
12. M. Figueiredo, R. Nowak, and S. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE Journal of Selected Topics in Signal Processing, vol. 1, no. 4, pp. 586-597, 2007.
13. 1- regularized least squares problems." http://www.caam.rice.edu/ ~optimization/L1/FPC AS/.
14. S. Becker, J. Bobin, and E. Candès, "Nesta: A fast and accurate first-order method for sparse recovery." Accepted in SIAM J. on Imaging Sciences, 2009.
15. P. J. Garrigues and L. E. Ghaoui, "An homotopy algorithm for the Lasso with online observations," Neural Information Processing Systems (NIPS) 21, December 2008.
16. 1 filtering," 42nd Asilomar conference on Signals, Systems and Computers, October 2008.
17. 1 minimization," IEEE Journal of Selected Topics in Signal Processing, April 2010.
18. M. S. Asif and J. Romberg, "Dynamic updating for sparse time varying signals," Information Sciences and Systems, 43rd Annual Conference on (CISS), March 2009.
19. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Annals of Statistics, vol. 32, no. 2, pp. 407-499, 2004.
20. M. Osborne, B. Presnell, and B. Turlach, "A new approach to variable selection in least squares problems," IMA Journal of Numerical Analysis, vol. 20, no. 3, pp. 389-403, 2000.
21. Å. Björck, Numerical Methods for Least Squares Problems. Society for Industrial Mathematics, 1996.
22. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 210-227, 2008.
23. J. Buckheit, S. Chen, D. Donoho, and I. Johnstone, "Wavelab 850, Software toolbox." http://www-stat.stanford.edu/~wavelab/.
24. B. Olshausen and D. Field, "Sparse coding with an overcomplete basis set: A strategy employed by V1?," Vision research, vol. 37, no. 23, pp. 3311-3325, 1997.
25. M. Aharon, M. Elad, and A. Bruckstein, "¡ tex¿ rmK¡/tex¿-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation," Signal Processing, IEEE Transactions on, vol. 54, no. 11, pp. 4311-4322, 2006.
26. M. S. Asif, W. Mantzel, and J. Romberg, "Channel Protection: Random coding meets sparse channels," Information theory workshop, October 2009. To appear.
27. J. Huang, X. Huang, and D. Metaxas, "Simultaneous image transformation and sparse representation recovery," IEEE Conferenece on Computer Vision and Pattern Recognition (CVPR), pp. 1-8, 2008.
28. J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1341-1344, 2004.