分段正则化正交匹配追踪算法

吴迪; 王奎民; 赵玉新; 王巍; 陈立娟

doi:10.3788/OPE.20142205.1395

您当前的位置：

首页 >

文章列表页 >

分段正则化正交匹配追踪算法

信息科学 | 更新时间：2020-08-13

- 分段正则化正交匹配追踪算法
- Stagewise regularized orthogonal matching pursuit algorithm
- 光学精密工程 2014年22卷第5期页码：1395-1402
- 作者机构：
  
  1. 哈尔滨工程大学自动化学院,黑龙江哈尔滨,150001
  2. 中国人民解放军海军驻锦州地区军事代表室,辽宁锦州,121000
  3. 中国船舶重工集团公司第七〇三研究所,黑龙江哈尔滨,150078
- 作者简介：
- 基金信息：
  
  国家自然科学基金资助项目（No.51109045）();中央高校基本科研业务费专项资金资助项目（No.HEUCFX41302）()
- DOI：10.3788/OPE.20142205.1395
  中图分类号： TN911.7;TP391.4
- 收稿日期：2013-07-23，
  
  修回日期：2013-09-10，
  
  纸质出版日期：2014-05-25
- 稿件说明：
移动端阅览
吴迪, 王奎民, 赵玉新等. 分段正则化正交匹配追踪算法[J]. 光学精密工程, 2014,22(5): 1395-1402

WU Di, WANG Kui-min, ZHAO Yu-xin etc. Stagewise regularized orthogonal matching pursuit algorithm[J]. Editorial Office of Optics and Precision Engineering, 2014,22(5): 1395-1402
吴迪, 王奎民, 赵玉新等. 分段正则化正交匹配追踪算法[J]. 光学精密工程, 2014,22(5): 1395-1402 DOI： 10.3788/OPE.20142205.1395.

WU Di, WANG Kui-min, ZHAO Yu-xin etc. Stagewise regularized orthogonal matching pursuit algorithm[J]. Editorial Office of Optics and Precision Engineering, 2014,22(5): 1395-1402 DOI： 10.3788/OPE.20142205.1395.

摘要

为了使压缩感知重构算法在实际重构信号时不需要稀疏度先验信息，本文提出了分段正则化正交匹配追踪算法。该算法根据信号重构残差量设计阈值，构建候选集。通过正则化候选集提取出用于表示信号的原子，并将其存入支撑集；当候选集为空集时，选择相关系数最大的原子加入支撑集。最后，针对支撑集中的原子求解最小二乘问题实现信号的逼近和残差量的更新。实验结果表明：针对长度为256的高斯信号和二值信号，提出的算法在稀疏度分别达到50和40时，精确重构率可达90%以上；在信号稀疏度相同的条件下，重构效果和速度整体优于现有的同类算法，具有速度快、稳定性好的特点。

Abstract

A novel reconstruction algorithm (stagewise regularized orthogonal matching pursuit) was proposed to reconstruct signals without prior sparsity information. The method constructed the candidate set by designing threshold based on the residual from signal reconstruction. The extracted signal atoms from the candidate set were merged with the previous support set. When the candidate set was a null set

the atom with the greatest correlation was directly added to the support set. Finally

the refinement of signal approximation and residual updating were achieved by solving a least-square algorithm on the support set. The experimental results for Gaussian signal and binary signal with a length of 256 show that the probability of exact reconstruction can be reached above 90% on the conditions of signal sparsity of 50 and 40

and the reconstructing effects and reconstructing speeds are better than those of similar algorithms under the same condition of signal sparsity. This algorithm is proved to be higher processing speeds and more stabile.

关键词

Keywords

references

CANDES E J, TAO T.Decoding by linear programming [J].IEEE Transactions on Information Theory,2005, 51(12):4203-4215.

DONOHO D L.Compressed sensing[J].IEEE Transactions on Information Theory,2006, 52(4):1289-1306.

赵瑞珍, 刘晓宇, 孙民贵. 基于稀疏表示的小波去噪[J]. 中国科学:信息科学, 2009, 52(8):1371-1377. ZHAO R ZH, LIU X Y, SUN M G, et al..Wavelet denoising via sparse representation [J].Scientia Sinica Informations, 2009, 52(8):1371-1377.(in Chinese)

苏可心,韩广良,孙海江. 基于SURF的抗视角变换图像匹配算法[J]. 液晶与显示, 2013, 28(4):626-632. SU K X, HAN G L, SUN H J. Anti-viewpoint changing image matching algorithm based on SURF [J].Chinese Journal of Liquid and Crystals and Display,2013, 28(4):626-632. (in Chinese)

吴新杰,黄国兴, 王静文. 压缩感知在ECT流型辨识中的应用[J]. 光学精密工程, 2013, 21(4):1062-1068. WU X J, HUANG G X, WANG J W. Application of compressed sensing in flow pattern identification of ECT [J].Opt. Precision Eng.,2013,21(4):1062-1068. (in Chinese)

张砚,汪源源,李伟,等. 基于全变分法重建光声图像[J]. 光学精密工程, 2012,20(1):204-212. ZHANG Y, WANG Y Y, LI W, et al.. Reconstruction of photoacoustic image based on total variation [J].Opt. Precision Eng.,2012,20(1):204-212. (in Chinese)

朱延万, 赵拥军, 孙兵. 一种改进的稀疏度自适应匹配追踪算法[J]. 信号处理, 2012, 28(1):80-86. ZHU Y W, ZHAO Y J, SUN B.A modified sparsity adaptive matching pursuit algorithm [J].Signal Processing, 2012, 28(1):80-86.(in Chinese)

CHEN S S, DONOHO D L, SAUNDERS M A.Atomic decomposition by basis pursuit [J].SIAM J.Sci.Comput.,2001,20(1):129-159.

MALLAT S, ZHANG Z.Matching Pursuit with time-frequency dictionaries[J].IEEE Trans.Sig.Proc., 1993, 41(12):3397-3415.

TROPP J, GILBERT A.Signal recovery from random measurements via orthogonal matching pursuit [J].IEEE Transactions on Information Theory,2007, 53(12):4655-4666.

DONOHO D L, TSAIG Y, DRORIL, et al..Sparse solution of underdetermined systems of liner equations by stagewise orthogonal matching pursuit [J].IEEE Transactions on Information Theory,2012, 58(2):1094-1121.

NEEDELL D, VERSHYNIN R.Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit [J].IEEE J.Sel.Topics Signal Process, 2010, 4(2):310-316.

NEEDELL D, TROPP J A.CoSaMP:Iterative signal recovery from incomplete and inaccurate samples [J].Applied and Computational Harmonic Analysis,2009,26(3):301-321.

DAI W, MILENKOVIC O.Subspace pursuit for compressive sensing signal reconstruction.2008 5th International Symposium on Turbo Codes and Related Topics, 2008, 402-407.

THONG T D, LU G, NAM N, et al..Sparsity adaptive matching pursuit algorithm for practical compressed sensing.Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, California, 2008, 10:581-587.

BARANIUKR R.Compressive sensing[J].IEEE Signal Processing Magazine, 2007, 24(4):118-126.

雷洋.压缩感知OMP重构算法稀疏字典中匹配原子的选择方法.广州:华南理工大学硕士论文, 2011. LEI Y. Atom selection in sparse dictionary with compressive sensing OMP reconstruction algorithm.Guang zhou:Graduate South China University of Technology, 2011.(in Chinese)

WU H L, WANG S.Adaptive sparsity matching pursuit algorithm for sparse reconstruction[J].IEEE Signal Processing Letters, 2012, 19(8):471-474.

浏览量

484

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

双超混沌系统结合压缩感知和Fibonacci变换的彩色图像加密

面向光学遥感影像的高效编码与重构

基于测量基优化的低采样率单像素成像

改进Zigzag遍历与哈希的Lorenz混沌构建

基于压缩感知的频域OCT图像稀疏重构