信号与信息处理

原子集校正及步长可控的稀疏度未知CS 重构

展开
  • 1. 华南理工大学电子与信息学院,广州510641
    2. 湖北工业大学电气与电子工程学院,武汉430068
曾春艳,博士,讲师,研究方向:压缩感知的重建算法,E-mail: swallow_chunyan@163.com;马丽红,教授,博导,研究方向:数字信号处理、容错编码,E-mail: eelhma@scut.edu.cn;杜明辉,教授,博导,研究方向:生物医学工程、图像重建,E-mail:ecmhdu@scut.edu.cn

收稿日期: 2012-09-10

  修回日期: 2013-06-25

  网络出版日期: 2013-06-25

基金资助

国家自然科学基金(No.60972133, No.U0735004);广东省自然科学基金团队项目基金(No.9351064101000003);广东省能源技
术重点实验室项目基金(No.2008A060301002);湖北工业大学博士科研启动基金(No.BSQD13037)资助

Atom Set Calibration and Step Control for Unknown-Sparsity Reconstruction from Compressive Sensing

Expand
  • 1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510641, China
    2. School of Electrical and Electronic Engineering, Hubei University of Technology, Wuhan 430068, China

Received date: 2012-09-10

  Revised date: 2013-06-25

  Online published: 2013-06-25

摘要

 对残差信号用类高斯分布建模,通过分析回溯型自适应正交匹配追踪(backtracking-based adaptive orthogonal matching pursuit, BAOMP) 算法的阈值选择方法与常规信号稀疏度方法的一致性和差异,提出一种改进的BAOMP 算法. 采用80–20 准则判断信号的粗匹配状态,然后对后续匹配步骤引入可变步长阈值,实现
选入原子集容量的精细调整,提高选入原子的正确匹配率,避免了残差信号的准周期性失配. 实验结果表明,与BAOMP算法相比,在500次重复实验中,改进的BAOMP算法对高斯稀疏信号的精确重建概率提高17%-26%,对自然图像的精确重建概率提高70%以上.

本文引用格式

曾春艳1,2, 马丽红1, 杜明辉1 . 原子集校正及步长可控的稀疏度未知CS 重构[J]. 应用科学学报, 2014 , 32(2) : 163 -169 . DOI: 10.3969/j.issn.0255-8297.2014.02.008

Abstract

This paper models residual signals with Gaussian-like distributions, based on which consistency between the Backtracking-based adaptive orthogonal matching pursuit (BAOMP) threshold and signal sparselevel is analyzed. An improved BAOMP (IBAOMP) method is thenproposed. Themethod estimates the
preliminary matching state usingthe 80-20 rule, and introduces a threshold with variable step size to subtly adjust atom set to raise the correct rate of selected atoms and avoid quasi-periodic mismatches of residual signals. Simulation results of 500 tests show that the exact recovery probability of IBAOMP is 17%-26% higher than BAOMP for Gaussian sparse signals, and more than70% higher than BAOMP for natural images.

参考文献

[1]  GIRYES R, ELAD M. RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT [J]. IEEE Transactions on Signal Processing, 2012, 60(3): 1465-1468.

[2]  YANG Jing Yu, PENG Yi Gang, XU Wen Li, DAI Qiong Hai. Ways to sparse representation: a comparative study[J]. Tsinghua Science and Technology, 2009, 14(4): 434-443.

[3]  TROPP J A, WRIGHT S J. Computational methods for sparse solution of linear inverse problems[J]. Proceedings of the IEEE, 2010, 98(6): 948-958.

[4]  MALLAT S G, ZHANg Zhi Feng. Matching pursuits with time-frequency dictionaries[J]. IEEE Transactions on Signal Processing, 1993, 41(12): 3397–3415.

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

[6]  VARADARAJAN B, KHUDANPUR S, TRAN T D. Stepwise optimal subspace pursuit for improving sparse recovery[J]. IEEE Signal Processing Letters, 2011, 18(1): 27-30.

[7]  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.

[8]  BLUMENSATH T, DAVIES M E. Iterative hard thresholding for compressed sensing[J]. Applied and Computational Harmonic Analysis, 2009, 27(3): 265-274.

[9]  HUANG Hong Lin, MAKUR Anamitra. Backtracking-Based Matching Pursuit Method for Sparse Signal Reconstruction[J]. IEEE Signal Processing Letters, 2011, 18(7): 391-394.

[10]  GURBUZ A C, PILANCI M, ARIKAN O. Expectation maximization based matching pursuit[C]// IEEE International Conference on Acoustics, Speech and Signal Processing, 2012:3313-3316.

[11]  DAI Wei, MILENKOVIC Olgica. Subspace pursuit for compressive sensing signal reconstruction[J]. IEEE Transactions on Information Theory, 2009, 55(5): 2230-2249.
 
文章导航

/