A gradient-based approach to optimization of compressed sensing systems

Signal Processing

Volumn 139, Issue , 2017, Pages 49-61

  Li, Xiumei ^a   Bai, Huang ^b   Hou, Beiping ^c  

^a HANGZHOU NORMAL UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

^c ZHEJIANG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Compressive sensing; Mutual coherence; Optimization techniques

Indexed keywords

COMPRESSED SENSING; ITERATIVE METHODS; SIGNAL RECONSTRUCTION;

COHERENCE PROPERTIES; COMPRESSIVE SENSING; DICTIONARY DESIGNS; GRADIENT DESCENT; MUTUAL COHERENCE; OPTIMIZATION TECHNIQUES; PHYSICAL MEANINGS; TRADITIONAL APPROACHES;

OPTIMIZATION;

EID: 85017615947     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2017.04.005     Document Type: Article

References (28)

1. [1] Candes, E.J., Romberg, J., Tao, T., Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52:2 (2006), 489–509, 10.1109/TIT.2005.862083.
2. [2] Donoho, D.L., Compressed sensing. IEEE Trans. Inf. Theory 52:4 (2006), 1289–1306, 10.1109/TIT.2006.871582.
3. [3] Candes, E.J., Tao, T., Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52:12 (2006), 5406–5425, 10.1109/TIT.2006.885507.
4. [4] Duarte, M.F., Eldar, Y.C., Structured compressed sensing: from theory to applications. IEEE Trans. Signal Process. 59:9 (2011), 4053–4085, 10.1109/TSP.2011.2161982.
5. [5] Duarte-Carvajalino, J.M., Sapiro, G., Learning to sense sparse signals: simultaneous sensing matrix and sparsifying dictionary optimization. IEEE Trans. Image Process. 18:7 (2009), 1395–1408, 10.1109/TIP.2009.2022459.
6. 1 minimization. Proc. Natl. Acad. Sci. 100:5 (2003), 2197–2202.
7. [7] Tropp, J.A., Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50:10 (2004), 2231–2242, 10.1109/TIT.2004.834793.
8. [8] Tropp, J.A., Gilbert, A.C., Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53:12 (2007), 4655–4666, 10.1109/TIT.2007.909108.
9. [9] Candes, E.J., Wakin, M.B., An introduction to compressive sampling. IEEE Signal Process. Mag. 25:2 (2008), 21–30, 10.1109/MSP.2007.914731.
10. 2 optimization in signal and image processing. IEEE Signal Process. Mag. 27:3 (2010), 76–88, 10.1109/MSP.2010.936023.
11. 1 minimization for compressed sensing. Signal Process. 108 (2015), 459–475.
12. [12] Elad, M., Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. 2009, Springer, New York, NY, USA.
13. [13] Engan, K., Aase, S.O., Husoy, J.H., Method of optimal directions for frame design. 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1999), vol. 5, 1999, 2443–2446, 10.1109/ICASSP.1999.760624.
14. [14] Aharon, M., Elad, M., Bruckstein, A., K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54:11 (2006), 4311–4322, 10.1109/TSP.2006.881199.
15. [15] Smith, L.N., Elad, M., Improving dictionary learning: multiple dictionary updates and coefficient reuse. IEEE Signal Process. Lett. 20:1 (2013), 79–82, 10.1109/LSP.2012.2229976.
16. [16] Sahoo, S.K., Makur, A., Dictionary training for sparse representation as generalization of k-means clustering. IEEE Signal Process. Lett. 20:6 (2013), 587–590, 10.1109/LSP.2013.2258912.
17. [17] Elad, M., Optimized projections for compressed sensing. IEEE Trans. Signal Process. 55:12 (2007), 5695–5702, 10.1109/TSP.2007.900760.
18. [18] Abolghasemi, V., Ferdowsi, S., Makkiabadi, B., Sanei, S., On optimization of the measurement matrix for compressive sensing. 2010 18th European Signal Processing Conference, 2010, 427–431.
19. [19] Zelnik-Manor, L., Rosenblum, K., Eldar, Y.C., Sensing matrix optimization for block-sparse decoding. IEEE Trans. Signal Process. 59:9 (2011), 4300–4312, 10.1109/TSP.2011.2159211.
20. [20] Li, G., Zhu, Z., Yang, D., Chang, L., Bai, H., On projection matrix optimization for compressive sensing systems. IEEE Trans. Signal Process. 61:11 (2013), 2887–2898, 10.1109/TSP.2013.2253776.
21. [21] Strohmer, T., Heath, R.W., Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14:3 (2003), 257–275.
22. [22] Christensen, O., An Introduction to Frames and Riesz Bases. 2003, Birkhäuser, Boston, MA.
23. [23] Xu, J., Pi, Y., Cao, Z., Optimized projection matrix for compressive sensing. EURASIP J. Adv. Signal Process. 43 (2010), 1–8.
24. [24] Abolghasemi, V., Ferdowsi, S., Sanei, S., A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensing. Signal Process. 92:4 (2012), 999–1009.
25. [25] Bai, H., Li, G., Li, S., Li, Q., Jiang, Q., Chang, L., Alternating optimization of sensing matrix and sparsifying dictionary for compressed sensing. IEEE Trans. Signal Process. 63:6 (2015), 1581–1594, 10.1109/TSP.2015.2399864.
26. [26] Li, G., Li, X., Li, S., Bai, H., Jiang, Q., He, X., Designing robust sensing matrix for image compression. IEEE Trans. Image Process. 24:12 (2015), 5389–5400, 10.1109/TIP.2015.2479474.
27. [27] Hong, T., Bai, H., Li, S., Zhu, Z., An efficient algorithm for designing projection matrix in compressive sensing based on alternating optimization. Signal Process. 125 (2016), 9–20.
28. [28] Cleju, N., Optimized projections for compressed sensing via rank-constrained nearest correlation matrix. Appl. Computat. Harmon. Anal. 36:3 (2014), 495–507.