scholarly journals Wavelet Compressive Sampling Signal Reconstruction Using Upside-Down Tree Structure

2011 ◽  
Vol 2011 ◽  
pp. 1-10
Author(s):  
Yijiu Zhao ◽  
Xiaoyan Zhuang ◽  
Zhijian Dai ◽  
Houjun Wang
Keyword(s):  
Matching Pursuit ◽  
Signal To Noise Ratio ◽  
Signal Reconstruction ◽  
Compressive Sampling ◽  
Tree Structure ◽  
Orthogonal Matching Pursuit ◽  
Reconstruction Method ◽  
Wavelet Domain ◽  
Wavelet Coefficients ◽  
Signal To Noise

This paper suggests an upside-down tree-based orthogonal matching pursuit (UDT-OMP) compressive sampling signal reconstruction method in wavelet domain. An upside-down tree for the wavelet coefficients of signal is constructed, and an improved version of orthogonal matching pursuit is presented. The proposed algorithm reconstructs compressive sampling signal by exploiting the upside-down tree structure of the wavelet coefficients of signal besides its sparsity in wavelet basis. Compared with conventional greedy pursuit algorithms: orthogonal matching pursuit (OMP) and tree-based orthogonal matching pursuit (TOMP), signal-to-noise ratio (SNR) using UDT-OMP is significantly improved.

An Effective LFM Signal Reconstruction Method for Signal Denoising

2018 ◽  
Vol 27 (09) ◽  
pp. 1850140
Author(s):  
Shan Luo ◽  
Guoan Bi ◽  
Tong Wu ◽  
Yong Xiao ◽  
Rongping Lin
Keyword(s):  
Signal To Noise Ratio ◽  
Signal Reconstruction ◽  
Experimental Results ◽  
Signal Denoising ◽  
Reconstruction Method ◽  
Signal To Noise ◽  
Time Frequency ◽  
Effective Time ◽  
Reconstructed Signal

One of the main challenges in signal denoising is to accurately restore useful signals in low signal-to-noise ratio (SNR) scenarios. In this paper, we investigate the signal denoising problem for multi-component linear frequency modulated (LFM) signals. An effective time-frequency (TF) analysis-based approach is proposed. Compared to the existing approaches, our proposed one can further increase the noise suppressing performance and improve the quality of the reconstructed signal. Experimental results are presented to show that the proposed denoising approach is able to effectively separate the multi-component LFM signal from the strong noise environments.

scholarly journals Tight recovery guarantees for orthogonal matching pursuit under Gaussian noise

2020 ◽  
Author(s):  
Chen Amiraz ◽  
Robert Krauthgamer ◽  
Boaz Nadler
Keyword(s):  
Gaussian Noise ◽  
Noise Level ◽  
High Probability ◽  
Matching Pursuit ◽  
Signal To Noise Ratio ◽  
Orthogonal Matching Pursuit ◽  
Sufficient Condition ◽  
Signal To Noise ◽  
Linear Measurements ◽  
Sparse Vector

Abstract Orthogonal matching pursuit (OMP) is a popular algorithm to estimate an unknown sparse vector from multiple linear measurements of it. Assuming exact sparsity and that the measurements are corrupted by additive Gaussian noise, the success of OMP is often formulated as exactly recovering the support of the sparse vector. Several authors derived a sufficient condition for exact support recovery by OMP with high probability depending on the signal-to-noise ratio, defined as the magnitude of the smallest non-zero coefficient of the vector divided by the noise level. We make two contributions. First, we derive a slightly sharper sufficient condition for two variants of OMP, in which either the sparsity level or the noise level is known. Next, we show that this sharper sufficient condition is tight, in the following sense: for a wide range of problem parameters, there exist a dictionary of linear measurements and a sparse vector with a signal-to-noise ratio slightly below that of the sufficient condition, for which with high probability OMP fails to recover its support. Finally, we present simulations that illustrate that our condition is tight for a much broader range of dictionaries.

scholarly journals Reduced Computational Complexity Orthogonal Matching Pursuit Using a Novel Partitioned Inversion Technique for Compressive Sensing

Electronics ◽  
2018 ◽  
Vol 7 (9) ◽  
pp. 206 ◽  
Author(s):  
Seonggeon Kim ◽  
Uihyun Yun ◽  
Jaehyuk Jang ◽  
Geunsu Seo ◽  
Jongjin Kang ◽  
...  
Keyword(s):  
Matching Pursuit ◽  
Signal To Noise Ratio ◽  
Signal Reconstruction ◽  
Orthogonal Matching Pursuit ◽  
Inversion Method ◽  
Fpga Design ◽  
The Matrix ◽  
Field Programmable ◽  
Previous Iteration ◽  
Reconstruction Time

This paper reports a field-programmable gate array (FPGA) design of compressed sensing (CS) using the orthogonal matching pursuit (OMP) algorithm. While solving the least-squares (LS) problem in the OMP algorithm, the complexity of the matrix inversion operation at every loop is reduced by the proposed partitioned inversion that utilizes the inversion result in the previous iteration. By the proposed matrix (n × n) inversion method inside the OMP, the number of operations is reduced down from O(n3) to O(n2). The OMP algorithm is implemented with a Xilinx Kintex UltraScale. The architecture with the proposed partitioned inversion involves 722 less DSP48E compared with the conventional method. It operates with a sample period of 4 ns, signal reconstruction time of 27 μs, and peak signal to noise ratio (PSNR) of 30.26 dB.

scholarly journals A Matching Pursuit Algorithm for Backtracking Regularization Based on Energy Sorting

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 231 ◽  
Author(s):  
Hanfei Zhang ◽  
Shungen Xiao ◽  
Ping Zhou
Keyword(s):  
Energy Distribution ◽  
Matching Pursuit ◽  
Signal Reconstruction ◽  
Selection Criterion ◽  
Critical Factor ◽  
Maximum Energy ◽  
Orthogonal Matching Pursuit ◽  
Support Set ◽  
Reconstruction Efficiency ◽  
Matching Pursuit Algorithm

The signal reconstruction quality has become a critical factor in compressed sensing at present. This paper proposes a matching pursuit algorithm for backtracking regularization based on energy sorting. This algorithm uses energy sorting for secondary atom screening to delete individual wrong atoms through the regularized orthogonal matching pursuit (ROMP) algorithm backtracking. The support set is continuously updated and expanded during each iteration. While the signal energy distribution is not uniform, or the energy distribution is in an extreme state, the reconstructive performance of the ROMP algorithm becomes unstable if the maximum energy is still taken as the selection criterion. The proposed method for the regularized orthogonal matching pursuit algorithm can be adopted to improve those drawbacks in signal reconstruction due to its high reconstruction efficiency. The experimental results show that the algorithm has a proper reconstruction.

Sign in / Sign up

Export Citation Format

Share Document