Sparse Signal and Image Reconstruction Algorithm for Adaptive Dual Thresholds Matching Pursuit Based on Variable-step Backtracking Strategy

被引:0
作者
Jianhong Xiang
Haoyuan Li
Liangang Qi
Yu Zhong
Hanyu Jiang
机构
[1] Harbin Engineering University,College of Information and Communication Engineering
[2] Harbin Engineering University,Key Laboratory of Advanced Ship Communication and Information Technology
[3] China Electronic Technology Group(cetc-10),undefined
来源
Circuits, Systems, and Signal Processing | 2023年 / 42卷
关键词
Compressed sensing; Orthogonal least squares; Adaptive dual thresholding atom selection; Variable-step backtracking strategy; Sparse signal and image reconstruction;
D O I
暂无
中图分类号
学科分类号
摘要
The traditional greedy algorithm requires the signal sparsity as a known condition, and in most application scenarios, the signal sparsity is unknown, resulting in poor signal reconstruction accuracy. In order to solve such problems, this paper proposes an adaptive dual threshold matching pursuit algorithm based on a variable-step backtracking strategy (SBATMP). Firstly, the suboptimal set of atoms is selected through two adaptive thresholds. Then, through the variable-step backtracking strategy, the atoms are selected twice to obtain the optimal atomic set. The algorithm can improve the complete reconstruction rate of the signal under the condition of unknown sparsity, and the variable-step backtracking strategy can effectively reduce the complexity of the algorithm. Through the reconstruction simulation experiment, the one-dimensional signal reconstruction accuracy can reach 100%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document} under the condition that the ratio of the sparsity to the measured value is less than 0.25. The reconstruction speed can be improved by 0.021-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$-$$\end{document}0.186 s. For the two-dimensional image signal, the PSNR of the reconstructed image by the SBATMP algorithm is increased by 1.193–5.781dB, and the SSIM is increased by 0.0116-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$-$$\end{document}0.0645 under the compression ratio of 0.7.
引用
收藏
页码:2132 / 2148
页数:16
相关论文
共 69 条
[1]  
Baraniuk R(2007)Compressive sensing IEEE Signal Process. Magaz. 24 118-145
[2]  
Blumensath T(2007)On the difference between orthogonal matching pursuit and orthogonal least squares Tech. Report. 24 104-1121
[3]  
Davies ME(2012)Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit IEEE Trans. Informat. Theory 58 1094-982
[4]  
Donoho DL(2010)On the role of sparse and redundant representations in image processing PROCEED- IEEE 98 972-402
[5]  
Tsaig Y(2022)A compressed sensing network for acquiring human pressure information IEEE Trans. Cognit. Developm. Syst. 14 388-1309
[6]  
Drori I(2016)Sparse linear regression via generalized orthogonal least-squares IEEE 7 1305-2062
[7]  
Starck JL(2022)Idpcnn: lterative denoising and projecting cnn for mri reconstruction J Computat. Appl. Math. 406 2049-10
[8]  
Elad M(2017)Recovery of sparse signals using multiple orthogonal least squares IEEE Trans. Signal Process. 65 1-589
[9]  
Figueiredo MA(2020)Joint sparse recovery using signal space matching pursuit IEEE Transa. Inform Theory. 99 581-1
[10]  
Ma Y(2017)Near-source noise suppression of amt by compressive sensing and mathematical morphology filtering Appl. Geophys. 14 1-391