Nearly optimal number of iterations for sparse signal recovery with orthogonal multi-matching pursuit
Nearly optimal number of iterations for sparse signal recovery with orthogonal multi-matching pursuit
复制标题
正交多重匹配追踪稀疏信号恢复的接近最佳迭代次数
DOI:
10.1088/1361-6420/ac2cdd
复制
发表时间:
2021-10
期刊:
影响因子:
2.1
通讯作者:
Jing Zhang
中科院分区:
文献类型:
--
作者:
Haifeng Li;Jinming Wen;Jun Xian;Jing Zhang
A signal x is called K-sparse if it has at most K nonzero entries. Recovering a K-sparse signal x from linear measurements y = Ax + w, where A is a sensing matrix and w is a noise vector, arises from numerous applications. Orthogonal multi-matching pursuit (OMMP), which is an extension of the orthogonal matching pursuit (OMP) algorithm and has better recovery performance than OMP, is a popular sparse recovery algorithm. One of the main challenges to study the recovery performance of OMMP is to investigate the optimal required number of iterations for ensuring stable reconstruction of x. This paper provides a nearly optimal number of iterations. Specifically, based on the restricted isometry property of the sensing matrix, we present a sufficient condition that can guarantee stable reconstruction of x in nearly optimal number of iterations by OMMP. Furthermore, we build an upper bound on the recovery error with fewer required iterations than existing results. Our results show that the required number of iterations to ensure stable recovery of any K-sparse signals is fewer than those required by the state-of-the-art results.
登录
查看更多内容
影响因子:
2.5
作者:
Needell, D.;Tropp, J. A.
通讯作者:
Tropp, J. A.
DOI:
10.1007/978-1-4614-4565-4_30
发表时间:
2012
期刊:
--
影响因子:
--
作者:
S. Foucart
通讯作者:
S. Foucart
影响因子:
2.1
作者:
温金明;李海锋
通讯作者:
李海锋
影响因子:
2.1
作者:
Hou Jingyao;Wang Jianjun;Zhang Feng;Huang Jianwen
通讯作者:
Huang Jianwen
影响因子:
22.7
作者:
Needell, Deanna;Tropp, Joel A.
通讯作者:
Tropp, Joel A.