Partial scan is a common approach for accelerating Magnetic Resonance Imaging (MRI) data acquisition. However, it is challenging to accurately reconstruct images from partial scan data (i.e., incomplete k-space matrices). Most state-of-the-art reconstruction methods apply U-Net (a classical encoder-decoder form of convolutional neural network) or cascaded U-Nets in image domain and/or k-space domain. These methods have great advantages over traditional methods where deep learning is not involved in. Nevertheless, these methods have following problems: (1) Directly applying U-Net in k-space domain is not optimal for extracting features in k-space domain; (2) Classical image-domain oriented U-Net is heavy-weight and hence is inefficient to be cascaded many times for yielding good reconstruction accuracy; (3) Classical image-domain oriented U-Net does not fully make use information of encoder network for extracting features in decoder network; and (4) Existing methods are ineffective in simultaneously extracting and fusing features in image domain and its dual k-space domain. To tackle these problems, we propose in this paper (1) an image-domain encoder-decoder sub-network called V-Net which is more light-weight for cascading and effective in fully utilizing features in the encoder for decoding, (2) a k-space domain sub-network called K-Net which is more suitable for extracting hierarchical features in k-space domain, and (3) a dual-domain reconstruction network where V-Nets and K-Nets are parallelly and effectively combined and cascaded. The effectiveness of KV-Net is demonstrated on the challenging fastMRI dataset where large-scale raw k-space training data are available and ground truth of test data is not released.
翻译:部分扫描是加速磁共振成像(MRI)数据获取的一个常见方法。 然而,从部分扫描数据(即不完整的 k- space 矩阵) 中准确地重建图像却具有挑战性。 大多数最先进的重建方法都应用了 U-Net (古典神经神经元网络的编码器- decoder 形式) 或在图像域和(或) k- 空间域中连锁的 U- Net 。这些方法与传统方法相比有很大优势,而传统方法却不涉及深层学习。 然而,这些方法存在以下问题:(1) 在 k- 空间域域直接应用 U- Net 并不是提取 k- 空间域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域(即不完整的 k- dmax- deco 域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域(即为较具有挑战性的K- m- dal- m- d- d- d- d- d- ) 域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域域,我们提议在甚的甚甚甚甚的甚的甚甚甚甚甚的甚的甚甚的甚的甚,甚的甚甚甚甚甚甚甚的甚甚甚甚甚的甚甚甚甚的甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚甚