Extensions of compressed sensing
Signal Processing - Sparse approximations in signal and image processing
Toeplitz-Structured Compressed Sensing Matrices
SSP '07 Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing
Measurement Matrix of Compressive Sensing Based on Gram-Schmidt Orthogonalization
ICIG '11 Proceedings of the 2011 Sixth International Conference on Image and Graphics
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Compressive sensing is a new way of information processing which recover the original signal through acquiring much fewer measurements with a measurement matrix. The measurement matrix has an important effect in signal sampling and reconstruction algorithm. However, there are two main problems in currently existing matrices: the difficulty of hardware implementation and high computation complexity. In this paper, we proposed a class of highly sparse and deterministic scrambled block measurement matrices based on orthogonal vectors (SBOV). It could improve sensing efficiency and reduce computation complexity. Those matrices constructed by the proposed method only need very little memory space and they could be easily implemented in hardware due to their simple entries. Some experiments show the better imaging performance comparable to scrambled block Hadamard matrix (SBH) and dense partial Hadamard matrix. SBOV matrices are simpler and sparser than SBH matrix.