双树小波变换与小波树稀疏联合的低场CS-MRI算法

压缩感知理论常用在磁共振快速成像上,仅采样少量的K空间数据即可重建出高质量的磁共振图像.压缩感知磁共振成像技术的原理是将磁共振图像重建问题建模成一个包含数据保真项、稀疏先验项和全变分项的线性组合最小化问题,显著减少磁共振扫描时间.稀疏表示是压缩感知理论的一个关键假设,重建结果很大程度上依赖于稀疏变换.本文将双树复小波变换和小波树稀疏联合作为压缩感知磁共振成像中的稀疏变换,提出了基于双树小波变换和小波树稀疏的压缩感知低场磁共振图像重建算法.实验表明,本文所提算法可以在某些磁共振图像客观评价指标中表现出一定的优势.     

基于Hadamard矩阵优化排序的快速单像素成像

为提升单像素成像速度,提出了基于Hadamard矩阵优化排序的压缩采样解决方案.利用数值仿真和室外实验对提出的5种排序方法进行了对比分析.研究结果表明:按Haar小波变换系数绝对值排序时单像素成像效果最优,排序对应到Walsh序后可利用快速变换重建图像,速度达300帧/秒@64×64像素;最优排序下,采样率25%仍可重建图像,采样速度可提升4倍.针对排序方法与成像信噪比关系,从关联成像角度给出了其物理解释:测量基矩阵元邻域数值相等的区域面积等效于光场二阶相干面积,当光场二阶相干面积随测量基由大到小排序时成像效果最优.本文研究成果可用于提升单像素成像速度,具有实用价值.     

螺旋MRI的网格化数据重建算法比较

螺旋MRI的原始数据是在不均匀的 k- 空间螺旋轨迹上采样得到的,需要通过网格化算法等手段将数据变成等间距的网格数据后,才能采用FFT进行重建,最后得到供临床使用的图像. 本文对Jackson网格化算法和Claudia大矩阵算法的重建速度和图像结果进行了比较, 并得出以下结论：1）在获得相近图像质量的情况下,Claudia大矩阵重采样算法比Jackson算法要快且更方便在仪器上实现. 2）在Jackson双倍细网格算法的实现方式中,数据驱动插值比网格驱动插值更有效率. 3）在Claudia大矩阵重采样算法中,对冗余比大于310∶1的数据进行图像重建的时候,网格点的幅值不平均化比平均化后的效果还要好. 这几个结论都将有利于MRI图像重建技术的进一步提高.      

基于正则化迭代的并行磁共振图像重建算法

为了解决并行磁共振成像过程的病态性和图像信噪比下降问题,降低重建过程中噪声放大和异常值的干扰造成的图像信噪比的损失,提出了一种基于正则化共轭梯度迭代的并行磁共振成像重建算法;该算法基于最小二乘理论,引入正则化,优化方程,进而进行迭代重建;采用了不同加速因子的人脑磁共振K空间欠采样数据以验证该算法的重建性能,仿真结果表明了该算法相较于最小二乘法,能较大限度地降低噪声对重建结果的干扰,具有信噪比更高、误差更小、成像效果更好等特征;重建图像质量得到了较好的改善,对临床诊断更具有适用性。     

基于同伦l0范数最小化重建的三维动态磁共振成像

高欠采倍数的动态磁共振图像重建具有重要意义,是同时实现高时间分辨率和高空间分辨率动态对比度增强成像的重要环节.本研究提出一种结合黄金角变密度螺旋采样、并行成像和基于同伦l₀范数最小化的压缩感知的图像重建的三维动态磁共振成像方法.黄金角变密度螺旋采样轨迹被用来连续获取k空间数据,具有数据采集效率高、对运动不敏感等优点.在重建算法中,将多线圈稀疏约束应用于时间总变分域,使用基于l₀范数最小化的非线性重建算法代替传统的l₁范数最小化算法,进一步提高了欠采样率.仿真实验和在体实验表明本文所提的方法在保持图像质量的同时,也可以实现较高的空间分辨率和时间分辨率,初步验证了基于同伦l₀范数最小化重建在三维动态磁共振成像上的优势和临床价值.     

Spiral MRI和图像处理

介绍了在Bruker Biospec 47/30 超导核磁共振成象仪(4.7 T)上实现Spiral快速成像及图像处理系统. 图像处理系统基于PC技术构建而成,主要功能包括：1） 将以Spiral形式采集到的时域磁共振信号转化为适用于快速傅立叶变换的笛卡尔网格(Cartesian)形式（网格化处理）;2）二维快速傅立叶变换(2D-FFT,图像重建);3）由化学位移偏置或磁场不均匀引起得偏共振效应(off-resonance effect)的校正;4）图像分析. 该软件适用于包括以多片多回波在内的各种采样方式得到的Spiral图像的重建和分析,也适用于常规成像数据的重建和分析. 所得到的图像可以以数据方式保存以供再次读入,也能够以TIF、GIF、JPG、BM等格式辅出为图像文件.     

一种结合并行成像和压缩感知的快速磁共振成像新方法

压缩感知（CS）技术和并行成像技术（主要是SENSE技术、GRAPPA技术等）都能通过减少k空间数据的采集量来加快磁共振成像速度,目前已有一些将两种方法相结合进一步加速磁共振成像速度的方法（例如CS-GRAPPA）.本文针对数据采集和重建这两方面对现有CS-GRAPPA方法进行了改进,采集方式上采用了局部等间隔采集模板以满足GRAPPA重建的要求,并对采集模板进行随机放置以满足CS重建的要求;数据重建时,根据自动校正数据估算GRAPPA算法中欠采行的重建误差,并利用误差的大小确定在CS算法中保真的程度.不同磁共振图像重建实验的结果表明：与现有方法相比,本文方法能够更好地保留原有图像细节并有效减少伪影.     

基于深度神经网络的时空编码磁共振成像超分辨率重建方法

单扫描时空编码磁共振成像是一种新型超快速磁共振成像技术,它对磁场不均匀和化学位移伪影有较强的抵抗性,但是其固有的空间分辨率较低,因此通常需要进行超分辨率重建,以在不增加采样点数的情况下提高时空编码磁共振图像的空间分辨率.然而,现有的重建方法存在迭代求解时间长、重建结果有混叠伪影残留等问题.为此,本文提出了一种基于深度神经网络的单扫描时空编码磁共振成像超分辨率重建方法.该方法采用模拟样本训练深度神经网络,再利用训练好的网络模型对实际采样信号进行重建.数值模拟、水模和活体鼠脑的实验结果表明,该方法能快速重建出无残留混叠伪影、纹理信息清楚的超分辨率时空编码磁共振图像.适当增加训练样本数量以及在训练样本中加入适当的随机噪声水平,有助于改善重建效果.     

选择性双向顺序压缩感知重建动态磁共振成像

压缩感知是一种新兴技术,该技术能够用远低于奈奎斯特采样频率采集的信号恢复出原始信号. 压缩感知成像方法大大提高了心脏磁共振成像的采集速度,已有的方法主要利用动态图像时间相关及心脏的周期性运动特征,如采用在时间维做傅立叶变换或求解每帧数据跟参考帧数据的差异获取稀疏数据,满足压缩感知重建的要求. 该文提出了选择性双向顺序压缩感知重建算法,利用相邻帧的差异更小的特点,获取更加稀疏的差异数据,同时利用动态图像的周期性,以目标函数积分为判据,在时间顺序和时间逆序两个方向选择效果更好的方向进行数据重建,降低图像伪影和噪声. 该选择算法,可以在不增加重建时间的情况下,选择双向顺序重建中最佳的结果. 该文对心脏磁共振图像数据进行了数据处理实验,并且跟传统压缩感知算法、参考帧差异方法及匙孔成像方法进行了比较. 结果表明：该方法无论从视觉效果还是从统计结果上,都有很大的改善.     

基于PCAU-Net的快速多通道磁共振成像方法

多通道磁共振成像方法采用多个接收线圈同时欠采样k空间以加快成像速度,并基于后处理算法重建图像,但在较高加速因子时,其图像重建质量仍然较差．本文提出了一种基于PCAU-Net的快速多通道磁共振成像方法,将单通道实数U型卷积神经网络拓展到多通道复数卷积神经网络,设计了一种结构不对称的U型网络结构,通过在解码部分减小网络规模以降低模型的复杂度．PCAU-Net网络在跳跃连接前增加了1×1卷积,以实现跨通道信息交互．输入和输出之间利用残差连接为误差的反向传播提供捷径．实验结果表明,使用规则和随机采样模板,在不同加速因子时,相比常规的GRAPPA重建算法和SPIRiT重建方法,本文提出的PCAU-Net方法可高质量重建出磁共振复数图像,并且相比于PCU-Net方法,PCAU-Net减少了模型参数、缩短了训练时间．     

An improved gridding method for spiral MRI using nonuniform fast Fourier transform

The algorithm of Liu and Nguyen [IEEE Microw. Guided Wave Lett. 8 (1) (1998) 18; SIAM J. Sci. Comput. 21 (1) (1999) 283] for nonuniform fast Fourier transform (NUFFT) has been extended to two dimensions to reconstruct images using spiral MRI. The new gridding method, called LS_NUFFT, minimizes the reconstruction approximation error in the Least Square sense by generated convolution kernels that fit for the spiral k-space trajectories. For analytical comparison, the LS_NUFFT has been fitted into a consistent framework with the conventional gridding methods using Kaiser-Bessel gridding and a recently proposed generalized FFT (GFFT) approach. Experimental comparison was made by assessing the performance of the LS_NUFFT with that of the standard direct summation method and the Kaiser-Bessel gridding method, using both digital phantom data and in vivo experimental data. Because of the explicitly optimized convolution kernel in LS_NUFFT, reconstruction results showed that the LS_NUFFT yields smaller reconstruction approximation error than the Kaiser-Bessel gridding method, but with the same computation complexity.     

On NUFFT-based gridding for non-Cartesian MRI

For MRI with non-Cartesian sampling, the conventional approach to reconstructing images is to use the gridding method with a Kaiser-Bessel (KB) interpolation kernel. Recently, Sha et al. [L. Sha, H. Guo, A.W. Song, An improved gridding method for spiral MRI using nonuniform fast Fourier transform, J. Magn. Reson. 162(2) (2003) 250-258] proposed an alternative method based on a nonuniform FFT (NUFFT) with least-squares (LS) design of the interpolation coefficients. They described this LS_NUFFT method as shift variant and reported that it yielded smaller reconstruction approximation errors than the conventional shift-invariant KB approach. This paper analyzes the LS_NUFFT approach in detail. We show that when one accounts for a certain linear phase factor, the core of the LS_NUFFT interpolator is in fact real and shift invariant. Furthermore, we find that the KB approach yields smaller errors than the original LS_NUFFT approach. We show that optimizing certain scaling factors can lead to a somewhat improved LS_NUFFT approach, but the high computation cost seems to outweigh the modest reduction in reconstruction error. We conclude that the standard KB approach, with appropriate parameters as described in the literature, remains the practical method of choice for gridding reconstruction in MRI.     

Composite MR image reconstruction and unaliasing for general trajectories using neural networks

In rapid parallel magnetic resonance imaging, the problem of image reconstruction is challenging. Here, a novel image reconstruction technique for data acquired along any general trajectory in neural network framework, called “Composite Reconstruction And Unaliasing using Neural Networks” (CRAUNN), is proposed. CRAUNN is based on the observation that the nature of aliasing remains unchanged whether the undersampled acquisition contains only low frequencies or includes high frequencies too. Here, the transformation needed to reconstruct the alias-free image from the aliased coil images is learnt, using acquisitions consisting of densely sampled low frequencies. Neural networks are made use of as machine learning tools to learn the transformation, in order to obtain the desired alias-free image for actual acquisitions containing sparsely sampled low as well as high frequencies. CRAUNN operates in the image domain and does not require explicit coil sensitivity estimation. It is also independent of the sampling trajectory used, and could be applied to arbitrary trajectories as well. As a pilot trial, the technique is first applied to Cartesian trajectory-sampled data. Experiments performed using radial and spiral trajectories on real and synthetic data, illustrate the performance of the method. The reconstruction errors depend on the acceleration factor as well as the sampling trajectory. It is found that higher acceleration factors can be obtained when radial trajectories are used. Comparisons against existing techniques are presented. CRAUNN has been found to perform on par with the state-of-the-art techniques. Acceleration factors of up to 4, 6 and 4 are achieved in Cartesian, radial and spiral cases, respectively.     

Data consistency criterion for selecting parameters for k-space-based reconstruction in parallel imaging

k-space-based reconstruction in parallel imaging depends on the reconstruction kernel setting, including its support. An optimal choice of the kernel depends on the calibration data, coil geometry and signal-to-noise ratio, as well as the criterion used. In this work, data consistency, imposed by the shift invariance requirement of the kernel, is introduced as a goodness measure of k-space-based reconstruction in parallel imaging and demonstrated. Data consistency error (DCE) is calculated as the sum of squared difference between the acquired signals and their estimates obtained based on the interpolation of the estimated missing data. A resemblance between DCE and the mean square error in the reconstructed image was found, demonstrating DCE's potential as a metric for comparing or choosing reconstructions. When used for selecting the kernel support for generalized autocalibrating partially parallel acquisition (GRAPPA) reconstruction and the set of frames for calibration as well as the kernel support in temporal GRAPPA reconstruction, DCE led to improved images over existing methods. Data consistency error is efficient to evaluate, robust for selecting reconstruction parameters and suitable for characterizing and optimizing k-space-based reconstruction in parallel imaging.     

Targeted-ROI imaging in electron paramagnetic resonance imaging

Electron paramagnetic resonance imaging (EPRI) is a technique that has been used for in vivo oxygen imaging of small animals. In continuous wave (CW) EPRI, the measurement can be interpreted as a sampled 4D Radon transform of the image function. The conventional filtered-backprojection (FBP) algorithm has been used widely for reconstructing images from full knowledge of the Radon transform acquired in CW EPRI. In practical applications of CW EPRI, one often is interested in information only in a region of interest (ROI) within the imaged subject. It is desirable to accurately reconstruct an ROI image only from partial knowledge of the Radon transform because acquisition of the partial data set can lead to considerable reduction of imaging time. The conventional FBP algorithm cannot, however, reconstruct accurate ROI images from partial knowledge of the Radon transform of even dimension. In this work, we describe two new algorithms, which are referred to as the backprojection filtration (BPF) and minimum-data filtered-backprojection (MDFBP) algorithms, for accurate ROI-image reconstruction from a partial Radon transform (or, truncated Radon transform) in CW EPRI. We have also performed numerical studies in the context of ROI-image reconstruction of a synthetic 2D image with density similar to that found in a small animal EPRI. This demonstrates both the inadequacy of the conventional FBP algorithm and the success of BPF and MDFBP algorithms in ROI reconstruction. The proposed ROI imaging approach promises a means to substantially reduce image acquisition time in CW EPRI.     

逆合成孔径成像激光雷达实包络成像算法

逆合成孔径激光成像雷达受激光调制技术以及回波相位信息易受大气湍流破坏的限制,采用常规的相位相干积累类方法得到目标二维高分辨图像很困难.针对这一情况,提出了一种基于逆Radon变换的实包络成像算法.利用回波距离脉冲压缩后的实包络信息,实现方位向的非相干积累,最终得到二维高分辨图像.通过该算法,成像系统可以使用非相干激光信号,在脉冲重复频率较低且存在大气湍流的情况下,也可以获得高质量的成像结果.仿真实验验证了此算法的有效性和优越性.     

炉膛三维温度场重建中Tikhonov正则化和截断奇异值分解算法比较

在煤粉锅炉诊断中火焰辐射能图像扮演着越来越重要的角色, 通过电荷耦合器件(CCD)获得的辐射能图像可以重建出炉内火焰三维温度场, CCD 用于获取视场角内的辐射能图像. 温度场重建的矩阵方程是一个严重病态的方程, 本文使用两种算法(Tikhonov正则化算法和截断奇异值分解(TSVD)算法)来重建温度场. 应用广义交叉检验算法来选取正确的正则化参数. 数值模拟的环境为一个10 m×10 m×10 m的三维炉膛, 系统被划分为10×10×10的1000个网格, 每个网格单元都是边长为1 m的立方体. 在正问题求解所得到的CCD接受信号基础上加上不同随机误差以模拟测量时的CCD接受信号. 研究两种算法重建后的温度重建误差、两者的重建时间, 以及最高温度的重建效果. 初步的研究结果显示, 一般情况下基于Tikhonov算法重建的温度场比基于TSVD算法重建的温度场误差要小, 计算所需时间短, 最高温度重建更准确.     

Singular Value Decomposition Using Jacobi Algorithm in pMRI and CS

Parallel magnetic resonance imaging (pMRI) and compressed sensing (CS) have been recently used to accelerate data acquisition process in MRI. Matrix inversion (for rectangular matrices) is required to reconstruct images from the acquired under-sampled data in various pMRI algorithms (e.g., SENSE, GRAPPA) and CS. Singular value decomposition (SVD) provides a mechanism to accurately estimate pseudo-inverse of a rectangular matrix. This work proposes the use of Jacobi SVD algorithm to reconstruct MR images from the acquired under-sampled data both in pMRI and in CS. The use of Jacobi SVD algorithm is proposed in advance MRI reconstruction algorithms, including SENSE, GRAPPA, and low-rank matrix estimation in L + S model for matrix inversion and estimation of singular values. Experiments are performed on 1.5T human head MRI data and 3T cardiac perfusion MRI data for different acceleration factors. The reconstructed images are analyzed using artifact power and central line profiles. The results show that the Jacobi SVD algorithm successfully reconstructs the images in SENSE, GRAPPA, and L + S algorithms. The benefit of using Jacobi SVD algorithm for MRI image reconstruction is its suitability for parallel computation on GPUs, which may be a great help in reducing the image reconstruction time.