稀疏信号恢复的自适应算法
Adaptive Algorithm for Sparse Signal Recovery
摘要:
Spike和Slab先验在诱导稀疏信号恢复的稀疏性中起着关键作用。使用这样的先验导致硬非凸和混合整数规划问题。大多数现有的算法来解决优化问题涉及简化假设,松弛或高计算费用。我们提出了一种新的自适应交替方向乘子法(AADMM)算法直接解决所提出的优化问题。该算法是基于信号的支撑和非零元素的一对一映射性质。在算法的每一步,我们通过向其添加索引或从其移除索引来更新支持,并使用交替方向乘法器方法来恢复与更新的支持相对应的信号。合成数据和真实世界的图像上的实验表明,所提出的AADMM算法提供了优越的性能和计算成本更低,相比最近开发的迭代凸细化(ICR)算法。
英文摘要:
Spike and slab priors play a key role in inducing sparsity for sparse signal recovery. The use of such priors results in hard non-convex and mixed integer programming problems. Most of the existing algorithms to solve the optimization problems involve either simplifying assumptions, relaxations or high computational expenses. We propose a new adaptive alternating direction method of multipliers (AADMM) algorithm to directly solve the presented optimization problem. The algorithm is based on the one-to-one mapping property of the support and non-zero element of the signal. At each step of the algorithm, we update the support by either adding an index to it or removing an index from it and use the alternating direction method of multipliers to recover the signal corresponding to the updated support. Experiments on synthetic data and real-world images show that the proposed AADMM algorithm provides superior performance and is computationally cheaper, compared to the recently developed iterative convex refinement (ICR) algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。