arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.07589eess.SP
收藏

用于二维谐波恢复的块稀疏恢复网络

Block-Sparse Recovery Network for Two-Dimensional Harmonic Retrieval

Rong Fu, Tianyao Huang, Lei Wang, Yimin Liu

摘要:

多维谐波恢复作为一个典型的信号处理问题,在信号处理中有着广泛的应用。块稀疏信号由于其非零项出现在簇中,近年来受到了广泛的关注。提出了一种名为Ada-BlockLISTA的展开网络,以较小的计算成本恢复块稀疏信号,该网络为每个块学习单独的权重矩阵。然而,随着网络参数的数量越来越多地与块的数量相关联,对参数减少的需求变得非常显著,特别是对于大规模MHR。基于二维谐波恢复问题中的字典特性,引入权值耦合结构来缩小Ada-BlockLISTA,在不降低性能的前提下显著减少了权值的数量.在仿真中,我们提出的块稀疏重建网络,命名为AdaBLISTA-CP,在二维谐波恢复问题中表现出优异的恢复性能和收敛速度。

英文摘要:

As a typical signal processing problem, multidimensional harmonic retrieval (MHR) has been adapted to a wide range of applications in signal processing. Block-sparse signals, whose nonzero entries appearing in clusters, have received much attention recently. An unfolded network, named Ada-BlockLISTA, was proposed to recover a block-sparse signal at a small computational cost, which learns an individual weight matrix for each block. However, as the number of network parameters is increasingly associated with the number of blocks, the demand for parameter reduction becomes very significant, especially for large-scale MHR. Based on the dictionary characteristics in two-dimensional (2D) harmonic retrieve problems, we introduce a weight coupling structure to shrink Ada-BlockLISTA, which significantly reduces the number of weights without performance degradation. In simulations, our proposed block-sparse reconstruction network, named AdaBLISTA-CP, shows excellent recovery performance and convergence speed in 2D harmonic retrieval problems.

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

↑