Side information based orthogonal matching pursuit in distributed compressed sensing

Author(s):  
Wenbo Zhang ◽  
Cong Ma ◽  
Weiliang Wang ◽  
Yu Liu ◽  
Lin Zhang
2021 ◽  
Vol 8 (2) ◽  
Author(s):  
Javad Afshar Jahanshahi

Compressed Sensing (CS) has been considered a very effective means of reducing energy consumption at the energy-constrained wireless body sensor networks for monitoring the multi-lead Electrocardiogram (MECG) signals. This paper develops the compressed sensing theory for sparse modeling and effective multi-channel ECG compression. A basis matrix with Gaussian kernels is proposed to obtain the sparse representation of each channel, which showed the closest similarity to the ECG signals. Thereafter, the greedy orthogonal matching pursuit (OMP) method is used to obtain the sparse representation of the signals. After obtaining the sparse representation of each ECG signal, the compressed sensing theory could be used to compress the signals as much as possible. Following the compression, the compressed signal is reconstructed utilizing the greedy orthogonal matching pursuit (OMP) optimization technique to demonstrate the accuracy and reliability of the algorithm. Moreover, as the wavelet basis matrix is another sparsifying basis to sparse representations of ECG signals, the compressed sensing is applied to the ECG signals using the wavelet basis matrix. The simulation results indicated that the proposed algorithm with Gaussian basis matrix reduces the reconstruction error and increases the compression ratio.


2019 ◽  
Vol 55 (17) ◽  
pp. 959-961
Author(s):  
Liyang Lu ◽  
Wenbo Xu ◽  
Yupeng Cui ◽  
Yifei Dang ◽  
Siye Wang

2016 ◽  
Vol 9 (2) ◽  
pp. 169-184 ◽  
Author(s):  
Wenhui Liu ◽  
Da Gong ◽  
Zhiqiang Xu

AbstractSign truncated matching pursuit (STrMP) algorithm is presented in this paper. STrMP is a new greedy algorithm for the recovery of sparse signals from the sign measurement, which combines the principle of consistent reconstruction with orthogonal matching pursuit (OMP). The main part of STrMP is as concise as OMP and hence STrMP is simple to implement. In contrast to previous greedy algorithms for one-bit compressed sensing, STrMP only need to solve a convex and unconstrained subproblem at each iteration. Numerical experiments show that STrMP is fast and accurate for one-bit compressed sensing compared with other algorithms.


Sign in / Sign up

Export Citation Format

Share Document