针对傅里叶压缩感知,动态选择最优采样与重建方案
Adaptive Selection of Sampling-Reconstruction in Fourier Compressed Sensing
- 按输入数据自适应选择最佳采样掩码和重建网络
- 在多个傅里叶CS任务上超越现有方法,提升显著
- 用独立重建网络解决采样-重建的帕累托次优问题
压缩感知(CS)旨在克服奈奎斯特采样的低效问题。传统基于优化的重建速度慢,实践中难以还原精确图像。深度学习重建虽在精度和速度上更优,但高效采样方法仍难实现,尤其在傅里叶压缩感知中。现有联合优化采样-重建方法($/mathcal{H}_1$)虽优化采样掩码,但缺乏对每张输入数据的自适应性;自适应采样($/mathcal{H}_2$)则存在优化困难与帕累托次优问题。本文提出新型自适应采样-重建选择框架($/mathcal{H}_{1.5}$),为每张输入数据选择最优采样掩码与重建网络。通过理论证明该方法潜力高于$/mathcal{H}_1$,并利用不同采样掩码对应独立重建网络,有效解决帕累托次优问题。为选择最优采样掩码,引入超分辨率空间生成模型量化输入的高频贝叶斯不确定性。实验表明,本方法在多个傅里叶压缩感知任务上显著优于$/mathcal{H}_1$与$/mathcal{H}_2$。
原文摘要 · Abstract (English)
Compressed sensing (CS) has emerged to overcome the inefficiency of Nyquist sampling. However, traditional optimization-based reconstruction is slow and can not yield an exact image in practice. Deep learning-based reconstruction has been a promising alternative to optimization-based reconstruction, outperforming it in accuracy and computation speed. Finding an efficient sampling method with deep learning-based reconstruction, especially for Fourier CS remains a challenge. Existing joint optimization of sampling-reconstruction works ($\mathcal{H}_1$) optimize the sampling mask but have low potential as it is not adaptive to each data point. Adaptive sampling ($\mathcal{H}_2$) has also disadvantages of difficult optimization and Pareto sub-optimality. Here, we propose a novel adaptive selection of sampling-reconstruction ($\mathcal{H}_{1.5}$) framework that selects the best sampling mask and reconstruction network for each input data. We provide theorems that our method has a higher potential than $\mathcal{H}_1$ and effectively solves the Pareto sub-optimality problem in sampling-reconstruction by using separate reconstruction networks for different sampling masks. To select the best sampling mask, we propose to quantify the high-frequency Bayesian uncertainty of the input, using a super-resolution space generation model. Our method outperforms joint optimization of sampling-reconstruction ($\mathcal{H}_1$) and adaptive sampling ($\mathcal{H}_2$) by achieving significant improvements on several Fourier CS problems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。