Compressed Sensing with Probability-based Prior Information

Abstract

This paper deals with the design of a sensing matrix along with a sparse recovery algorithm by utilizing the probability-based prior information for compressed sensing system. With the knowledge of the probability for each atom of the dictionary being used, a diagonal weighted matrix is obtained and then the sensing matrix is designed by minimizing a weighted function such that the Gram of the equivalent dictionary is as close to the Gram of dictionary as possible. An analytical solution for the corresponding sensing matrix is derived which leads to low computational complexity. We also exploit this prior information through the sparse recovery stage and propose a probability-driven orthogonal matching pursuit algorithm that improves the accuracy of the recovery. Simulations for synthetic data and application scenarios of surveillance video are carried out to compare the performance of the proposed methods with some existing algorithms. The results reveal that the proposed CS system outperforms existing CS systems.

arXiv comment13 pages, 9 figures

References in corpus (9)

• A survey of sparse representation: algorithms and applications
• Compressed Sensing MRI Reconstruction using a Generative Adversarial Network with a Cyclic Loss
• Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
• Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems
• Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage
• Adaptive Reduced-Rank Minimum Symbol-Error-Rate Receive Processing for Large-Scale Multiple-Antenna Systems
• Joint Sensing Matrix and Sparsifying Dictionary Optimization for Tensor Compressive Sensing
• Direction Finding Algorithms with Joint Iterative Subspace Optimization
• Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximation