【摘要】 正则正交匹配追踪(ROMP)算法筛选原子的方法比较麻烦、计算量较大。为了克服ROMP算法的这个缺点,同时保留分组匹配追踪算法批量选择原子的优点,文章提出了一种改进的快速匹配追踪算法。该算法采用了一种新的批量筛选原子的方法,同时在每次迭代过程中从原子候选集中剔除已加入选定原子索引集的原子,以避免重复选入原子和增加计算量。通过实验仿真,验证了该方法的可行性,可以有效地提高算法的重构速度。更多还原

【Abstract】 The method of screening atom of regularized orthogonal matching pursuit(ROMP)is too troublesome and has a large calculation.In order to overcome the disadvantage of ROMP algorithm and preserve the advantage of batch atom selection of packet matching pursuit algorithm,we propose an improved fast matching pursuit algorithm.The algorithm uses a new method of batch atom selection and remove the selected atom of atomic index set from the atomic candidate in each iteration process in order to avoid repeating the selection of atoms and increasing the amount of computation.Simulation results show that the improved algorithm is feasible and can effectively improve the reconstruction speed.更多还原