通过提示的Lipschitz约束网络实现多视角稀疏视图CT重建
Prompting Lipschitz-constrained network for multiple-in-one sparse-view CT reconstruction
AI总结:
本文提出LipNet和PromptCT框架,通过显式证明的Lipschitz约束网络和提示模块,实现多视角稀疏视图CT重建的高质量与低存储成本。
摘要:
尽管深度学习在稀疏视图计算机断层扫描(SVCT)重建算法中取得了显著进展,这些方法仍面临两个主要限制:(i)由于其经验设计的性质,难以明确证明深度展开算法的先验网络满足Lipschitz约束。(ii)在多视角情况下,为每个设置训练单独模型会带来巨大的存储成本,阻碍了实际临床应用。为了解决这些问题,我们详细阐述了一个可以显式证明的Lipschitz约束网络,称为LipNet,并集成了一个显式提示模块,以提供不同稀疏采样设置的判别知识,使单个模型能够处理多种稀疏视图配置。此外,我们开发了一种节省存储空间的深度展开框架,用于多视角SVCT重建,称为PromptCT,该框架将LipNet作为其先验网络,以确保其相应迭代算法的收敛性。在模拟和真实数据实验中,PromptCT在多视角SVCT重建中优于基准重建算法,实现了高质量的重建,同时具有较低的存储成本。在理论方面,我们明确证明了LipNet满足边界性质,进一步证明了其Lipschitz连续性,并随后分析了所提出迭代算法的收敛性。数据和代码可在https://github.com/shibaoshun/PromptCT上公开获取。
英文摘要:
Despite significant advancements in deep learning-based sparse-view computed tomography (SVCT) reconstruction algorithms, these methods still encounter two primary limitations: (i) It is challenging to explicitly prove that the prior networks of deep unfolding algorithms satisfy Lipschitz constraints due to their empirically designed nature. (ii) The substantial storage costs of training a separate model for each setting in the case of multiple views hinder practical clinical applications. To address these issues, we elaborate an explicitly provable Lipschitz-constrained network, dubbed LipNet, and integrate an explicit prompt module to provide discriminative knowledge of different sparse sampling settings, enabling the treatment of multiple sparse view configurations within a single model. Furthermore, we develop a storage-saving deep unfolding framework for multiple-in-one SVCT reconstruction, termed PromptCT, which embeds LipNet as its prior network to ensure the convergence of its corresponding iterative algorithm. In simulated and real data experiments, PromptCT outperforms benchmark reconstruction algorithms in multiple-in-one SVCT reconstruction, achieving higher-quality reconstructions with lower storage costs. On the theoretical side, we explicitly demonstrate that LipNet satisfies boundary property, further proving its Lipschitz continuity and subsequently analyzing the convergence of the proposed iterative algorithms. The data and code are publicly available at https://github.com/shibaoshun/PromptCT.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。