A novel sensing matrix for cluster structured sparse signals
Hamid Nouasria, Mohamed Et‐tolba
Abstract
Hamid Nouasria, Mohamed Et‐tolba
Abstract
In Compressive Sensing (CS) technique, the original sparse signal is compressed in an adequate manner so as to ease its recovery from a reduced number of measurements. This depends potently on the sensing matrix. In this paper, we consider cluster structured sparse signals, and propose an enhanced Bernoulli sensing matrix. We show that the original data can be efficiently reconstructed by performing traditional signal recovery algorithms with the proposed sensing matrix. Moreover, the use of the new sensing matrix provides a considerable gain in terms of the rate of exact reconstruction.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In Compressive Sensing (CS) technique, the original sparse signal is compressed in an adequate manner so as to ease its recovery from a reduced number of measurements. This depends potently on the sensing matrix. In this paper, we consider cluster structured sparse signals, and propose an enhanced Bernoulli sensing matrix. We show that the original data can be efficiently reconstructed by performing traditional signal recovery algorithms with the proposed sensing matrix. Moreover, the use of the new sensing matrix provides a considerable gain in terms of the rate of exact reconstruction.
Key concepts: Compressed sensing, Computer science, Sparse matrix, Matrix (chemical analysis), Signal reconstruction, SIGNAL (programming language), Algorithm, Signal recovery