Robust optimisation algorithm for the measurement matrix in compressed sensing

Ying Zhou; Quansen Sun; Jixin Liu

Robust optimisation algorithm for the measurement matrix in compressed sensing

View Fulltext

Author(s): Ying Zhou¹ ; Quansen Sun¹ ; Jixin Liu²
- Affiliations: 1: School of Computer Science and Engineering, Nanjing University of Science and Technology , No. 200 Xiao Ling Wei Street, Nanjing , People's Republic of China ;
  2: Research Center of Wideband Wireless Communication Technology, Nanjing University of Posts and Telecommunications , Nanjing , People's Republic of China
Source: Volume 3, Issue 3, September 2018, p. 133 – 139
DOI: 10.1049/trit.2018.1011 , Online ISSN 2468-2322

This is an open access article published by the IET, Chinese Association for Artificial Intelligence and Chongqing University of Technology under the Creative Commons Attribution-NonCommercial-NoDerivs License (http://creativecommons.org/licenses/by-nc-nd/3.0/)

Received 15/07/2018, Accepted 19/07/2018, Published 01/08/2018

The measurement matrix which plays an important role in compressed sensing has got a lot of attention. However, the existing measurement matrices ignore the energy concentration characteristic of the natural images in the sparse domain, which can help to improve the sensing efficiency and the construction efficiency. Here, the authors propose a simple but efficient measurement matrix based on the Hadamard matrix, named Hadamard-diagonal matrix (HDM). In HDM, the energy conservation in the sparse domain is maximised. In addition, considering the reconstruction performance can be further improved by decreasing the mutual coherence of the measurement matrix, an effective optimisation strategy is adopted in order to reducing the mutual coherence for better reconstruction quality. The authors conduct several experiments to evaluate the performance of HDM and the effectiveness of optimisation algorithm. The experimental results show that HDM performs better than other popular measurement matrices, and the optimisation algorithm can improve the performance of not only the HDM but also the other popular measurement matrices.

References

1. 1)
  - 31. Donoho, D., Huo, X.: ‘Uncertainty principles and ideal atomic decomposition’, IEEE Trans. Inf. Theory, 2001, 47, (7), pp. 2845–2862 (doi: 10.1109/18.959265).
2. 2)
  - [6]. Dimakis, A.G., Vontobel, P.O.: ‘LP decoding meets LP decoding: a connection between channel coding and compressed sensing’. 47th Annual Allerton Conf. on Communication, Control, and Computing, Allerton, 2009, pp. 8–15.
3. 3)
  - 30. Amini, A., Marvasti, F.: ‘Deterministic construction of binary, bipolar, and ternary compressed sensing matrices’, IEEE Trans. Inf. Theory, 2011, 57, (4), pp. 2360–2370 (doi: 10.1109/TIT.2011.2111670).
4. 4)
  - 24. Mallat, S., Zhang, Z.: ‘Matching pursuit in a time frequency dictionary’, IEEE Trans. Signal Process., 1993, 41, (12), pp. 3397–3415 (doi: 10.1109/78.258082).
5. 5)
  - [4]. Zhang, G., Jiao, S., Xu, X., et al: ‘Compressed sensing and reconstruction with Bernoulli matrices’. IEEE Int. Conf. on Information and Automation, Harbin, China, 2010, pp. 455–460.
6. 6)
  - [20]. Li, X., Bai, H., Hou, B.: ‘A gradient-based approach to optimization of compressed sensing systems’, Signal Process., 2017, 139, pp. 49–61 (doi: 10.1016/j.sigpro.2017.04.005).
7. 7)
  - 6. Needell, D., Vershynin, R.: ‘Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit’, Found. Comput. Math., 2009, 9, (3), pp. 317–334 (doi: 10.1007/s10208-008-9031-3).
8. 8)
  - 13. Donoho, D.L.: ‘Compressed sensing’, IEEE Trans. Inf. Theory, 2006, 52, pp. 1289–1306 (doi: 10.1109/TIT.2006.871582).
9. 9)
  - 17. Donoho, D.L., Elad, M.: ‘Maximal sparsity representation via l1 minimization’, Proc. Natl. Acad. Sci., 2003, 100, pp. 2197–2202 (doi: 10.1073/pnas.0437847100).
10. 10)
  - 22. Gribonval, R., Nielsen, M.: ‘Sparse representations in unions of bases’, IEEE Trans. Inf. Theory, 2003, 49, pp. 3320–3325 (doi: 10.1109/TIT.2003.820031).
11. 11)
  - 29. Candés, E., Tao, T.: ‘Near optimal signal recovery from random projections: universal encoding strategies’, IEEE Trans. Inf. Theory, 2006, 52, pp. 5406–5425 (doi: 10.1109/TIT.2006.885507).
12. 12)
  - [5]. Berinde, R., Indyk, P.: ‘Sparse recovery using sparse random matrices’. Preprint, 2008.
13. 13)
  - 28. Dimakis, A.G., Smarandache, R., Vontobel, P.O.: ‘LDPC codes for compressed sensing’, IEEE Trans. Inf. Theory, 2012, 58, (5), pp. 3093–3114 (doi: 10.1109/TIT.2011.2181819).
14. 14)
  - 2. Candès, E.J., Tao, T.: ‘Decoding by linear programming’, IEEE Trans. Inf. Theory, 2005, 51, (12), pp. 4203–4215 (doi: 10.1109/TIT.2005.858979).
15. 15)
  - 17. Candès, E.J., Wakin, M.B.: ‘An introduction to compressed sampling’, IEEE Signal Process. Mag., 2008, 25, (2), pp. 21–30 (doi: 10.1109/MSP.2007.914731).
16. 16)
  - [18]. Wang, Z., Arce, G.R., Paredes, J.L.: ‘Colored random projections for compressed sensing’. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, Honolulu, Hawaii, April 2007, pp. 873–876.
17. 17)
  - 1. Elad, M.: ‘Optimized projections for compressed sensing’, IEEE Trans. Signal Process., 2007, 55, (12), pp. 5695–5702 (doi: 10.1109/TSP.2007.900760).
18. 18)
  - [16]. Abolghasemi, V., Sanei, S., Ferdowsi, S., et al: ‘Segmented compressive sensing’. IEEE/SP 15th Workshop on Statistical Signal Processing, Cardiff, UK, September 2009.
19. 19)
  - [19]. Duarte-Carvajalino, J., Sapiro, G.: ‘Learning to sense sparse signals: simultaneous sensing matrix and sparsifying dictionary optimization’, IEEE Trans. Image Process., 2009, 18, (7), pp. 1395–1408 (doi: 10.1109/TIP.2009.2022459).
20. 20)
  - [17]. Wang, Z., Arce, G.R.: ‘Variable density compressed image sampling’, IEEE Trans. Image Process., 2010, 19, (1), pp. 264–270 (doi: 10.1109/TIP.2009.2032889).
21. 21)
  - [26]. Do, T.T., Gan, L., Nguyen, N., et al: ‘Sparsity adaptive matching pursuit algorithm for practical compressed sensing’. 42nd Asilomar Conf. on Signals, Systems and Computers, Asilomar, 2008, pp. 581–587.
22. 22)
  - [10]. Gan, L., Do, T.T., Tran, T.D.: ‘Fast compressive imaging using scrambled block hadamard ensemble’. 16th European IEEE Signal Processing Conf., Lausanne, Switzerland, 2008, pp. 1–5.
23. 23)
  - [21]. Cleju, N.: ‘Optimized projections for compressed sensing via rank-constrained nearest correlation matrix’, Appl. Comput. Harmon. Anal., 2014, 36, (3), pp. 495–507 (doi: 10.1016/j.acha.2013.08.005).
24. 24)
  - [8]. Yin, W., Morgan, S., Yang, J., et al: ‘Practical compressive sensing with toeplitz and circulant matrices’. Proc. SPIE, Huangshan, China, 2010, vol. 7744, p. 77440K.
25. 25)
  - [1]. Candès, E.J.: ‘Compressive sampling’. Proc. of the Int. Congress of Mathematicians, Madrid, Spain, 2006, pp. 1433–1452.
26. 26)
  - 12. Baraniuk, R.G.: ‘A lecture on compressive sensing’, IEEE Signal Process. Mag., 2007, 24, (4), pp. 118–121 (doi: 10.1109/MSP.2007.4286571).
27. 27)
  - 30. Tropp, J.A., Gilbert, A.C.: ‘Signal recovery from random measurements via orthogonal matching pursuit’, IEEE Trans. Inf. Theory, 2007, 53, (12), pp. 4655–4666 (doi: 10.1109/TIT.2007.909108).
28. 28)
  - 10. Needell, D., Tropp, J.A.: ‘CoSaMAP: Iterative signal recovery from incomplete and inaccurate samples’, Appl. Comput. Harmon. Anal., 2009, 26, (3), pp. 301–321 (doi: 10.1016/j.acha.2008.07.002).

Login

Not registered yet?

Share

Tools

Login to add to favourites

Key

Robust optimisation algorithm for the measurement matrix in compressed sensing

References

Related content