arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.6237cs.ITmath.IT
收藏

基于扰动字典的稀疏恢复快速算法

Fast Algorithms for Sparse Recovery with Perturbed Dictionary

Xuebing Han, Hao Zhang, Gang Li

摘要:

在本文中,我们占的方法稀疏恢复大型欠定线性模型的扰动存在于测量和字典矩阵。现有方法计算量大,效率低。总体最小二乘(TLS)准则在解决线性回归问题方面具有广泛的优点,而FOCal欠定系统求解器(FOCALS)在稀疏恢复方面具有低计算复杂度。本文在TLS和FOTORS方法的基础上,提出了更快速、更鲁棒的TLS FOTORS和SD FOTORS算法。TLS-FOSS算法在求解稀疏约束下的TLS优化问题时,不仅具有近优性,而且速度快,适合于大规模计算。为了进一步降低算法的复杂度,设计了另一种次优算法D-FOTORS。SD-FOTORS可以应用于MMV(multiple-measurement-vectors)TLS模型,填补了稀疏约束下线性回归问题求解的空白。给出了TLS-FOTORS算法和SD-FOTORS算法的收敛性证明。仿真结果表明,与其他算法相比,TLS-FOTORS和SD-FOTORS在精度和稳定性方面具有优势。

英文摘要:

In this paper, we account for approaches of sparse recovery from large underdetermined linear models with perturbation present in both the measurements and the dictionary matrix. Existing methods have high computation and low efficiency. The total least-squares (TLS) criterion has well-documented merits in solving linear regression problems while FOCal Underdetermined System Solver (FOCUSS) has low-computation complexity in sparse recovery. Based on TLS and FOCUSS methods, the present paper develops more fast and robust algorithms, TLS-FOCUSS and SD-FOCUSS. TLS-FOCUSS algorithm is not only near-optimum but also fast in solving TLS optimization problems under sparsity constraints, and thus fit for large scale computation. In order to reduce the complexity of algorithm further, another suboptimal algorithm named D-FOCUSS is devised. SD-FOCUSS can be applied in MMV (multiple-measurement-vectors) TLS model, which fills the gap of solving linear regression problems under sparsity constraints. The convergence of TLS-FOCUSS algorithm and SD-FOCUSS algorithm is established with mathematical proof. The simulations illustrate the advantage of TLS-FOCUSS and SD-FOCUSS in accuracy and stability, compared with other algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑