一种新的压缩感知算法:迭代重加权算子算法(IROA)
A Novel Algorithm for Compressive Sensing: Iteratively Reweighed Operator Algorithm (IROA)
摘要:
压缩感知声称稀疏信号可以从比传统上认为需要的少得多的测量中精确地重建。保证压缩感知成功的问题之一是处理稀疏约束优化。到目前为止,已经发展出许多优秀的理论、算法和软件,例如,所谓的贪心算法及其变体、稀疏贝叶斯算法、凸优化方法等,它们的公式都由两个项组成,其中一个项是,另一个项是(大多数情况下,由于凸函数的良好特性,采用p=1)(注意:不失一般性,假设其本身是稀疏的)。值得注意的是,它们都通过第二项来指定稀疏性约束。与之不同的是,本文中的公式由两个术语组成,一个是with(),另一个是。对于每一次迭代,测量矩阵(线性算子)由前一次迭代中获得的确定重新加权,因此所提出的方法被称为迭代重新加权算子算法(IROA)。此外,为了节省计算时间,进行了另一次重新加权操作;特别是,对应于小的列已被排除。理论分析和数值模拟表明,该方法克服了已发表的算法。
英文摘要:
Compressive sensing claims that the sparse signals can be reconstructed exactly from many fewer measurements than traditionally believed necessary. One of issues ensuring the successful compressive sensing is to deal with the sparsity-constraint optimization. Up to now, many excellent theories, algorithms and software have been developed, for example, the so-called greedy algorithm ant its variants, the sparse Bayesian algorithm, the convex optimization methods, and so on. The formulations for them consist of two terms, in which one is and the other is (, mostly, p=1 is adopted due to good characteristic of the convex function) (NOTE: without the loss of generality, itself is assumed to be sparse). It is noted that all of them specify the sparsity constraint by the second term. Different from them, the developed formulation in this paper consists of two terms where one is with () and the other is . For each iteration the measurement matrix (linear operator) is reweighed by determined by which is obtained in the previous iteration, so the proposed method is called the iteratively reweighed operator algorithm (IROA). Moreover, in order to save the computation time, another reweighed operation has been carried out; in particular, the columns of corresponding to small have been excluded out. Theoretical analysis and numerical simulations have shown that the proposed method overcomes the published algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。