Abstract
This paper provides an efficient minimization algorithm for dictionary based sparse representation and its application in some signal recovery problems. Dictionary has shown great potential in effectively representing various kinds of signals sparsely. However the computational cost associated with dictionary based sparse representation can be tremendous, especially when the representation problem is coupled with the complex encoding processes of the signals. The proposed algorithm tackles this problem by alternating direction minimizations with the use of Barzilai-Borwein's optimal step size selection technique to significantly improve the convergence speed. Numerical experiments demonstrate the high efficiency of the proposed algorithm over traditional optimization methods. © 2011 ACM.
| Original language | English |
|---|---|
| Title of host publication | ACM International Conference Proceeding Series |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, ISABEL'11 - Barcelona, Spain Duration: 26 Oct 2011 → 29 Oct 2011 |
Conference
| Conference | 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, ISABEL'11 |
|---|---|
| Place | Spain |
| City | Barcelona |
| Period | 26/10/11 → 29/10/11 |
Fingerprint
Dive into the research topics of 'Efficient minimization for dictionary based sparse representation and signal recovery'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver