变步长自适应向前向后匹配追踪算法
首发时间:2015-12-24
摘要:针对向前向后匹配追踪算法(FBP)步长不可改变,从而使得算法重构性能不足的问题,为了提高算法的重构性能,提出了变步长自适应向前向后匹配追踪算法(VsAFBP)。首先,在迭代前,对观测矩阵进行伪逆处理,降低原子间的相关性,从而提高原子选择的准确性;然后,在每次迭代中,通过比较原子剔除前后残差的大小,自适应地进行原子剔除;最后,引入变步长思想。在迭代初期,选择较大步长来减少迭代次数,在迭代后期,改用较小步长提高重构精度。仿真结果表明无论是一维高斯随机信号还是二维图像信号VsAFBP算法的重构效果优于FBP算法。
For information in English, please click here
Variable Step Size Adaptive Forward-Backward Pursuit Algorithm
Abstract:Aiming at the problem that Forward-Backward Pursuit (FBP) alogrithm cannot change its step sizes and make the algorithm a low accuracy in reconstuction, in order to improve the recovery performance of FBP algorithm, Variable Step Size Adaptive Forward-Backward Pursuit (VsAFBP) algorithm was proposed in this paper. Firstly, before each iteration, VsAFBP did pseudo-inverse processing on observation matrix, which could reduce the coherence between the atoms, thereby improveing the accuracy of the selected atoms. Secondly, in each iteration, the proposed algorithm pruned atoms adaptively by comparing the size of residual before and after atom prunning. Finally, VsAFBP incorporated a variable step size strategy. In the early stage of iteration, a large step sizes were used to reduce the iterative times, and then the step sizes were replaced by small ones to imprve the reconstruction precision. The experimental results show that the proposed algorithm perfoms better than FBP algorithm for both one-dimensional Gaussian random signal and two-dimensional image signal.
Keywords: compressed sensing greedy algorithm sparse signal Forward-Backward Pursuit.
论文图表:
引用
No.4672200112261514****
同行评议
共计0人参与
勘误表
变步长自适应向前向后匹配追踪算法
评论
全部评论0/1000