Dimension Selection and Compression Reconstruction Algorithm of Measurement Matrix Based on Edge Density

This paper is based on the sparse representation of signals in orthogonal space. Data collection and compressed are combined by compressed sensing theory. The image signal can be reconstructed by fewer observations which we obtained it under the measurement matrix. Compressive sensing theory breaks through the limitation of data sampling. In the theory of compressed sensing, the selection of measurement matrix plays a key role in whether the compressed signal can be reconstructed or not. In this paper, different measurement matrices are selected to achieve the compressive sensing and their similarity coefficient matrices are analyzed to compare the different performance. This paper focus on the coefficient selection of random measurement matrix. To find the relationship between the image structure similarity coefficient and the other characteristic indexes. An algorithm for dimension design of measurement matrix is proposed. A high performance algorithm for image compression perception and image restoration is implemented.

[1]  Xiaoling Zhang,et al.  Compressed sensing Linear array SAR 3-D imaging via sparse locations prediction , 2014, 2014 IEEE Geoscience and Remote Sensing Symposium.

[2]  Xicheng Tan,et al.  A Parallel Nonlocal Means Algorithm for Remote Sensing Image Denoising on an Intel Xeon Phi Platform , 2017, IEEE Access.

[3]  Felix Krahmer,et al.  Blind deconvolution and compressed sensing , 2016, 2016 4th International Workshop on Compressed Sensing Theory and its Applications to Radar, Sonar and Remote Sensing (CoSeRa).

[4]  Jie Song,et al.  A new fast and parallel MRI framework based on contourlet and compressed sensing sensitivity encoding (CS-SENSE) , 2016, 2016 International Conference on Machine Learning and Cybernetics (ICMLC).

[5]  Long Wu,et al.  A scheme of feature analysis in SAR imaging based on compressed sensing , 2016, 2016 IEEE International Geoscience and Remote Sensing Symposium (IGARSS).

[7]  Valerio Cambareri,et al.  A greedy blind calibration method for compressed sensing with unknown sensor gains , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Axel Flinth,et al.  Sparse blind deconvolution and demixing through ℓ1,2-minimization , 2016, Advances in Computational Mathematics.

[9]  Aditya Gupta,et al.  Data compression using Shannon-fano algorithm implemented by VHDL , 2014, 2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014).

[10]  Ke Lu,et al.  Compressed Sensing of a Remote Sensing Image Based on the Priors of the Reference Image , 2015, IEEE Geoscience and Remote Sensing Letters.

[11]  Qun Zhang,et al.  Measurement Matrix Optimization for ISAR Sparse Imaging Based on Genetic Algorithm , 2016, IEEE Geoscience and Remote Sensing Letters.

[12]  Ke Lu,et al.  Nonlocal Low-Rank-Based Compressed Sensing for Remote Sensing Image Reconstruction , 2016, IEEE Geoscience and Remote Sensing Letters.

[13]  Qun Zhang,et al.  A cognitive signals reconstruction algorithm based on compressed sensing , 2015, 2015 IEEE 5th Asia-Pacific Conference on Synthetic Aperture Radar (APSAR).

[14]  Boularbah Souissi,et al.  SAR Images Compressed Sensing Based on Recovery Algorithms , 2018, IGARSS 2018 - 2018 IEEE International Geoscience and Remote Sensing Symposium.

[15]  George Strawn.  Claude Shannon: Mastermind of Information Theory , 2014, IT Professional.