Regular Backtracking Fast Orthogonal Matching Pursuit Algorithm Based on Dice Coefficient Forward Prediction

被引:0
|
作者
Chen P. [1 ]
Chen J. [1 ]
Wang X. [1 ]
Fang Y. [2 ]
Wang F. [3 ]
机构
[1] School of Advanced Manufacturing, Fuzhou University, Quanzhou
[2] School of Information Engineering, Guangdong University of Technology, Guangzhou
[3] School of Information Engineering, Quanzhou Normal University, Quanzhou
基金
中国国家自然科学基金;
关键词
Compressed sensing; Dice coefficient; Greedy algorithms; Regular backtracking; Signal reconstruction;
D O I
10.11999/JEIT230558
中图分类号
学科分类号
摘要
In order to improve the success rate and reconstruction accuracy of the compressed sensing reconstruction algorithm, the Look Ahead and Regular Backtracking Orthogonal Matching Pursuit based on Dice coefficient (DLARBOMP) is proposed. In this algorithm, from the perspective of matching criteria and atom selection in the pre-selection stage, the Dice coefficient is used to replace the atomic inner product to calculate the correlation value and preserve the characteristics of the original signal, to select the atom that best matches the residual and improve the reconstruction accuracy. At the same time, to reduce backtracking time in the reconstruction process, regularization is used to select multiple atoms instead of a single atom in each iteration, achieving a balance between reconstruction accuracy and time. Finally, the experimental results of sparse one-dimensional signal and two-dimensional image signal reconstruction show that the proposed DLARBOMP algorithm considers both performance and efficiency when reconstructing one-dimensional signal, and enhances the Peak Signal-to-Noise Ratio (PSNR) when reconstructing two-dimensional compressed image signal, as compared to Orthogonal Matching Pursuit (OMP) and the state-of-the-art greedy algorithms. © 2024 Science Press. All rights reserved.
引用
收藏
页码:1488 / 1498
页数:10
相关论文
共 30 条
  • [1] JIN Jian, GU Yuantao, MEI Shunliang, An introduction to compressive sampling and its applications[J], Journal of Electronics & Information Technology, 32, 2, pp. 470-475, (2010)
  • [2] YIN Jianping, WANG Zhijun, Ammunition Theory, pp. 132-139, (2014)
  • [3] DONOHO D L., Compressed sensing[J], IEEE Transactions on Information Theory, 52, 4, pp. 1289-1306, (2006)
  • [4] CANDES E J, ROMBERG J, TAO T., Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information[J], IEEE Transactions on Information Theory, 52, 2, pp. 489-509, (2006)
  • [5] CANDES E J., Compressive sampling[C], International Congress of Mathematicians, pp. 1433-1452, (2006)
  • [6] HIRSCH L, GONZALEZ M G, REY VEGA L., A comparative study of time domain compressed sensing techniques for optoacoustic imaging[J], IEEE Latin America Transactions, 20, 6, pp. 1018-1024, (2022)
  • [7] YANG Kai, Research on channel estimation based on compressed sensing, University of Electronic Science and Technology of China, pp. 22-23, (2018)
  • [8] DAVE P, JOSHI A., Prediction based method for faster compressive sensing reconstruction using OMP[C], The 2019 2nd IEEE Middle East and North Africa Communications Conference (MENACOMM), pp. 1-4, (2019)
  • [9] MALLAT S G, ZHANG Zhifeng, Matching pursuits with time-frequency dictionaries[J], IEEE Transactions on Signal Processing, 41, 12, pp. 3397-3415, (1993)
  • [10] TROPP J A, GILBERT A C., Signal recovery from random measurements via orthogonal matching pursuit[J], IEEE Transactions on Information Theory, 53, 12, pp. 4655-4666, (2007)