Low storage space for compressive sensing: semi-tensor product approach

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Random measurement matrices play a critical role in successful recovery with the compressive sensing (CS) framework. However, due to its randomly generated elements, these matrices require massive amounts of storage space to implement a random matrix in CS applications. To effectively reduce the storage space of the random measurement matrix for CS, we propose a random sampling approach for the CS framework based on the semi-tensor product (STP). The proposed approach generates a random measurement matrix, where the dimensions of the random measurement matrix are reduced to a quarter (or 1/16, 1/64, and even 1/256) of the number of dimensions, which are used for conventional CS. We then estimate the values of the sparse vector with a modified iteratively re-weighted least-squares (IRLS) algorithm. The results of numerical simulations showed that the proposed approach can reduce the storage space of a random matrix to at least a quarter while maintaining quality of reconstruction. All results confirmed that the proposed approach significantly influences the physical implementation of the CS in images, especially on embedded system and field programmable gate array (FPGA), where storage is limited.

Cite

CITATION STYLE

APA

Wang, J., Ye, S., Ruan, Y., & Chen, C. (2017). Low storage space for compressive sensing: semi-tensor product approach. Eurasip Journal on Image and Video Processing, 2017(1). https://doi.org/10.1186/s13640-017-0199-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free