结合导航回波与压缩感知进行运动伪影矫正

在一定幅度范围内,导航回波可有效追踪刚体运动,用于矫正k空间数据,从而降低运动伪影对图像质量的影响．然而导航回波技术无法很好地矫正大幅度运动以及非刚体运动导致的图像伪影,运动时刻采集到的k空间数据只能舍弃．压缩感知通过非线性规划法,对欠采样数据进行重建,能恢复出原始信号．该文采用伪随机的方式进行数据采集,结合导航回波技术,用压缩感知对未受运动影响的数据进行图像重建,从而减少运动伪影对图像的干扰．该研究为运动伪影的矫正提供了一种新思路．     

压缩感知同步扫描重建及其采样方案的研究

压缩感知(compressed sensing,CS)-磁共振成像(magnetic resonance imaging,MRI)技术使用随机欠采样的k空间数据来重建图像,大大提高了成像速度.但典型的CS重建很费时,这也是CS-MRI临床应用的主要障碍之一.针对这一问题,该文提出了在扫描时同步进行CS图像重建的方案.在同步重建的过程中,可以实时显示重建图像的结果,用户可以根据图像质量来决定何时终止扫描,这样可以在节约扫描和重建时间的同时,更好地控制图像质量.由于预先无法确定最终的采样率,因此传统的变密度随机采样方法并不完全适用.该文设计了适用于同步重建过程的采样模式生成方案,同时提出了分段采样方法,把采样过程分为两个阶段,不同阶段使用不同的概率密度函数(probability density function,PDF)确定待采样的相位编码行.模拟实验的结果表明,与使用单一密度函数的采样方案相比,分段采样方案能够在整个同步扫描重建过程中始终获得更好的图像.     

基于非均匀螺旋线数据和布雷格曼迭代的快速磁共振成像方法

数据采集时间长是制约磁共振成像技术发展的重要瓶颈.为了解决这一问题, 本文基于压缩感知成像理论, 提出了一种结合非均匀螺旋线磁共振数据采集序列和布雷格曼迭代重建的快速磁共振成像方法, 通过欠采样缩短数据采集时间.欠采样引起混迭伪影则通过非均匀螺旋线欠采样特性和布雷格曼迭代重建去除.水模磁共振成像实验和在体磁共振成像实验结果表明: 欠采样情况下, 所提出的方法能有效去除欠采样导致的混迭伪影, 获得的图像结构信息完整的成像结果, 在缩短采样时间的同时, 具有较高的准确度. 关键词： 磁共振成像 非均匀螺旋线 全变分 布雷格曼迭代     

不同采样模式的固体DQ-SQ实验的压缩感知重建比较

为了提高固体二维双量子-单量子(DQ-SQ)谱的采集速度,根据DQ-SQ谱的自稀疏性,该文使用了一种基于压缩感知技术的重建算法.其优化的能量函数是有限差分约束的l1范数,并使用不同的权重对水平和竖直方向的有限差分项进行约束.该文分别对伪随机采样、全随机采样和e指数采样等采样模式进行了比较,发现伪随机采样表现出最佳的重建结果.进一步研究发现伪随机的极限形式,即t1截尾(t1-cutoff)采样模式效果最佳.     

一种八谱段滤光片成像系统设计

针对多光谱滤光片阵列成像采样率低,原始(Raw)数据稀疏所导致的重建图像模糊,高频信息丢失等问题,提出了一种新八谱段滤光片阵列分布方案,利用基于邻域梯度延伸方法对光谱Raw图像进行重建.首先基于二叉树生成法,在重复排列的4×4阵列中设计了一种等空间概率比的八谱段滤光片分布方案;然后针对传感器直接获取的稀疏Raw图像,计算各谱段采样点的梯度信息,在保持图像结构特征和纹理信息的基础上,利用邻域采样点的像素值和梯度值对未采样点进行重建,从而获得完整的光谱图像信息;最后,基于已重建的八谱段光谱图像,采用伪逆矩阵法重构各像素位置的31波段光谱值.结果表明,相对于主流图像重建方法,本文算法提高了重建八谱段光谱图像的峰值信噪比、复合峰值信噪比,降低了光谱均方差,更好地保留了图像的纹理和边缘,有效降低了多光谱滤光片阵列成像中的颜色伪影和图像模糊等现象.     

基于改进的分块压缩感知红外图像重建

针对基于压缩感知理论的红外图像重建问题,提出一种基于改进的分块压缩感知红外图像重建方法。该方法首先对原始红外图像进行分块,并对每个子块用相同的观测矩阵进行随机观测,获得少量的观测数据;然后利用谱图小波变换优异的稀疏特性,将其引入平滑投影Landweber算法进行迭代优化重建,同时采用混合中值滤波进行处理以增加图像的平滑度和减少块伪影,最后输出满足要求的高质量红外图像。实验结果表明,在相同采样率下,该方法对于不同类型红外图像的重建性能均优于目前广为采用的一些小波压缩感知方法,可获得更高质量的红外图像。     

循环-托普利兹块相位掩模可压缩双透镜成像

压缩成像是压缩传感理论的重要应用领域之一,可以用比Nyquist测量数目少的测量值捕获充分信息重建稀疏或可压缩图像.在研究现有的压缩成像方法的基础上,给出一种新的循环-托普利兹块相位掩模矩阵可压缩双透镜成像方法.模拟实验结果表明新的相位掩模矩阵成像方法可以在欠采样的情况下有效地获得图像信息来重建原始图像.新方法的研究为...     

基于主成分变换的图像稀疏度估计方法

压缩感知理论基于信号的稀疏性和可压缩性, 突破传统Nyquist采样频率的限制, 以较低的数据量对信号进行采样和高概率重构. 在压缩感知理论中, 信号的稀疏度确定了稀疏采样的最低数据量, 是验证采样方法及重构方法优劣的重要参数. 在实际研究过程中, 图像稀疏度通常未知, 这就可能导致过采样或欠采样的情况, 从而无法验证采样方法及重构方法的优劣. 因此, 快速而客观地估计图像的稀疏度对于压缩感知理论研究来说意义重大. 本文分析了基于小波变换的图像稀疏化表示方法, 通过遍历采样和重构得到基于小波变换方法的图像稀疏度, 但过程复杂, 而且结果的准确性依赖于小波基和变换尺度的选择. 本文通过压缩感知理论对主成分变换进行阐述, 在基于主成分变换系数近似为正态函数的假设下, 建立了图像稀疏度与系数函数方差间的线性关系, 并通过多组图像数据进行仿真验证, 结果表明线性关系的正确性. 通过分析和仿真可以看出, 基于主成分变换的稀疏度估计方法比小波变换简单、快速、客观, 对压缩感知理论研究有重要的应用价值. 关键词： 压缩感知 稀疏度 小波变换 主成分变换     

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

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

多通道相位图像的改进型自适应重建算法

自适应重建(Adaptive Reconstruction,AR)算法被广泛应用于磁共振图像的多通道合并问题上.AR算法不需要直接采集各个线圈的灵敏度信息,而是通过通道间信号及噪声相关矩阵,估算出各个通道的灵敏度,从而保证了合并的幅值图像具有较高的信噪比(Signal-to-Noise Ratio,SNR).然而,由于AR算法没有针对相位图像的合并问题进行优化,导致重建出的相位图像具有不确定性.另外,受各通道之间相位偏移及低信噪比相位图像的影响,重建结果可能包含伪影.该文提出了一种改进型AR算法,估算并移除了各通道之间的相位偏移,同时对多通道数据的相位进行质量评估及通道重排,用以进行后续自适应重建.仿体及在体实验表明,该方法可以有效提升AR算法稳定性、消除重建图像中存在的伪影,同时保持合并后幅值图像及相位图像的高信噪比.     

Exploiting the wavelet structure in compressed sensing MRI

Sparsity has been widely utilized in magnetic resonance imaging (MRI) to reduce k-space sampling. According to structured sparsity theories, fewer measurements are required for tree sparse data than the data only with standard sparsity. Intuitively, more accurate image reconstruction can be achieved with the same number of measurements by exploiting the wavelet tree structure in MRI. A novel algorithm is proposed in this article to reconstruct MR images from undersampled k-space data. In contrast to conventional compressed sensing MRI (CS-MRI) that only relies on the sparsity of MR images in wavelet or gradient domain, we exploit the wavelet tree structure to improve CS-MRI. This tree-based CS-MRI problem is decomposed into three simpler subproblems then each of the subproblems can be efficiently solved by an iterative scheme. Simulations and in vivo experiments demonstrate the significant improvement of the proposed method compared to conventional CS-MRI algorithms, and the feasibleness on MR data compared to existing tree-based imaging algorithms.     

Magnetic resonance image reconstruction using trained geometric directions in 2D redundant wavelets domain and non-convex optimization

Reducing scanning time is significantly important for MRI. Compressed sensing has shown promising results by undersampling the k-space data to speed up imaging. Sparsity of an image plays an important role in compressed sensing MRI to reduce the image artifacts. Recently, the method of patch-based directional wavelets (PBDW) which trains geometric directions from undersampled data has been proposed. It has better performance in preserving image edges than conventional sparsifying transforms. However, obvious artifacts are presented in the smooth region when the data are highly undersampled. In addition, the original PBDW-based method does not hold obvious improvement for radial and fully 2D random sampling patterns. In this paper, the PBDW-based MRI reconstruction is improved from two aspects: 1) An efficient non-convex minimization algorithm is modified to enhance image quality; 2) PBDW are extended into shift-invariant discrete wavelet domain to enhance the ability of transform on sparsifying piecewise smooth image features. Numerical simulation results on vivo magnetic resonance images demonstrate that the proposed method outperforms the original PBDW in terms of removing artifacts and preserving edges.     

Smoothly Clipped Absolute Deviation (SCAD) regularization for compressed sensing MRI Using an augmented Lagrangian scheme

PurposeCompressed sensing (CS) provides a promising framework for MR image reconstruction from highly undersampled data, thus reducing data acquisition time. In this context, sparsity-promoting regularization techniques exploit the prior knowledge that MR images are sparse or compressible in a given transform domain. In this work, a new regularization technique was introduced by iterative linearization of the non-convex smoothly clipped absolute deviation (SCAD) norm with the aim of reducing the sampling rate even lower than it is required by the conventional l₁ norm while approaching an l₀ norm.Materials and MethodsThe CS-MR image reconstruction was formulated as an equality-constrained optimization problem using a variable splitting technique and solved using an augmented Lagrangian (AL) method developed to accelerate the optimization of constrained problems. The performance of the resulting SCAD-based algorithm was evaluated for discrete gradients and wavelet sparsifying transforms and compared with its l₁-based counterpart using phantom and clinical studies. The k-spaces of the datasets were retrospectively undersampled using different sampling trajectories. In the AL framework, the CS-MRI problem was decomposed into two simpler sub-problems, wherein the linearization of the SCAD norm resulted in an adaptively weighted soft thresholding rule with a sparsity enhancing effect.ResultsIt was demonstrated that the proposed regularization technique adaptively assigns lower weights on the thresholding of gradient fields and wavelet coefficients, and as such, is more efficient in reducing aliasing artifacts arising from k-space undersampling, when compared to its l₁-based counterpart.ConclusionThe SCAD regularization improves the performance of l₁-based regularization technique, especially at reduced sampling rates, and thus might be a good candidate for some applications in CS-MRI.     

Cardiac magnetic resonance imaging using radial k-space sampling and self-calibrated partial parallel reconstruction

Radial sampling has been demonstrated to be potentially useful in cardiac magnetic resonance imaging because it is less susceptible to motion than Cartesian sampling. Nevertheless, its capability of imaging acceleration remains limited by undersampling-induced streaking artifacts. In this study, a self-calibrated reconstruction method was developed to suppress streaking artifacts for highly accelerated parallel radial acquisitions in cardiac magnetic resonance imaging. Two- (2D) and three-dimensional (3D) radial k-space data were collected from a phantom and healthy volunteers. Images reconstructed using the proposed method and the conventional regridding method were compared based on statistical analysis on a four-point scale imaging scoring. It was demonstrated that the proposed method can effectively remove undersampling streaking artifacts and significantly improve image quality (P<.05). With the use of the proposed method, image score (1–4, 1=poor, 2=good, 3=very good, 4=excellent) was improved from 2.14 to 3.34 with the use of an undersampling factor of 4 and from 1.09 to 2.5 with the use of an undersampling factor of 8. Our study demonstrates that the proposed reconstruction method is effective for highly accelerated cardiac imaging applications using parallel radial acquisitions without calibration data.     

Compressed Sensing MRI Using Sparsity Averaging and FISTA

Magnetic resonance imaging (MRI) is widely adopted for clinical diagnosis due to its non-invasively detection. However, acquisition of full k-space data limits its imaging speed. Compressed sensing (CS) provides a new technique to significantly reduce the measurements with high-quality MR image reconstruction. The sparsity of the MR images is one of the crucial bases of CS-MRI. In this paper, we present to use sparsity averaging prior for CS-MRI reconstruction in the basis of that MR images have average sparsity over multiple wavelet frames. The problem is solved using a Fast Iterative Shrinkage Thresholding Algorithm (FISTA), each iteration of which includes a shrinkage step. The performance of the proposed method is evaluated for several types of MR images. The experiment results illustrate that our approach exhibits a better performance than those methods that using redundant frame or a single orthonormal basis to promote sparsity.     

Optimization-based image reconstruction in x-ray computed tomography by sparsity exploitation of local continuity and nonlocal spatial self-similarity

The additional sparse prior of images has been the subject of much research in problems of sparse-view computed tomography(CT) reconstruction. A method employing the image gradient sparsity is often used to reduce the sampling rate and is shown to remove the unwanted artifacts while preserve sharp edges, but may cause blocky or patchy artifacts.To eliminate this drawback, we propose a novel sparsity exploitation-based model for CT image reconstruction. In the presented model, the sparse representation and sparsity exploitation of both gradient and nonlocal gradient are investigated.The new model is shown to offer the potential for better results by introducing a similarity prior information of the image structure. Then, an effective alternating direction minimization algorithm is developed to optimize the objective function with a robust convergence result. Qualitative and quantitative evaluations have been carried out both on the simulation and real data in terms of accuracy and resolution properties. The results indicate that the proposed method can be applied for achieving better image-quality potential with the theoretically expected detailed feature preservation.     

Correlation imaging with arbitrary sampling trajectories

The presented work aims to develop a generalized linear approach to image reconstruction with arbitrary sampling trajectories for high-speed MRI. This approach is based on a previously developed image reconstruction framework, “correlation imaging”. In the presented work, correlation imaging with arbitrary sampling trajectories is implemented in a multi-dimensional hybrid space that is formed from the physical sampling space and a virtually defined space. By introducing an undersampling trajectory with both uniformity and randomness in the hybrid space, correlation imaging may take advantage of multiple image reconstruction mechanisms including coil sensitivity encoding, data sparsity and information sharing. This hybrid-space implementation is demonstrated in multi-slice 2D imaging, multi-scan imaging, and radial dynamic imaging. Since more information is used in image reconstruction, it is found that hybrid-space correlation imaging outperforms several conventional techniques. The presented approach will benefit clinical MRI by enabling correlation imaging to be used to accelerate multi-scan clinical protocols that need different sampling trajectories in different scans.     

Wavelet-based edge correlation incorporated iterative reconstruction for undersampled MRI

Undersampling k-space is an effective way to decrease acquisition time for MRI. However, aliasing artifacts introduced by undersampling may blur the edges of magnetic resonance images, which often contain important information for clinical diagnosis. Moreover, k-space data is often contaminated by the noise signals of unknown intensity. To better preserve the edge features while suppressing the aliasing artifacts and noises, we present a new wavelet-based algorithm for undersampled MRI reconstruction. The algorithm solves the image reconstruction as a standard optimization problem including a ?₂ data fidelity term and ?₁ sparsity regularization term. Rather than manually setting the regularization parameter for the ?₁ term, which is directly related to the threshold, an automatic estimated threshold adaptive to noise intensity is introduced in our proposed algorithm. In addition, a prior matrix based on edge correlation in wavelet domain is incorporated into the regularization term. Compared with nonlinear conjugate gradient descent algorithm, iterative shrinkage/thresholding algorithm, fast iterative soft-thresholding algorithm and the iterative thresholding algorithm using exponentially decreasing threshold, the proposed algorithm yields reconstructions with better edge recovery and noise suppression.     

O-space with high resolution readouts outperforms radial imaging

PurposeWhile O-Space imaging is well known to accelerate image acquisition beyond traditional Cartesian sampling, its advantages compared to undersampled radial imaging, the linear trajectory most akin to O-Space imaging, have not been detailed. In addition, previous studies have focused on ultrafast imaging with very high acceleration factors and relatively low resolution. The purpose of this work is to directly compare O-Space and radial imaging in their potential to deliver highly undersampled images of high resolution and minimal artifacts, as needed for diagnostic applications. We report that the greatest advantages to O-Space imaging are observed with extended data acquisition readouts.Theory and methodsA sampling strategy that uses high resolution readouts is presented and applied to compare the potential of radial and O-Space sequences to generate high resolution images at high undersampling factors. Simulations and phantom studies were performed to investigate whether use of extended readout windows in O-Space imaging would increase k-space sampling and improve image quality, compared to radial imaging.ResultsExperimental O-Space images acquired with high resolution readouts show fewer artifacts and greater sharpness than radial imaging with equivalent scan parameters. Radial images taken with longer readouts show stronger undersampling artifacts, which can cause small or subtle image features to disappear. These features are preserved in a comparable O-Space image.ConclusionsHigh resolution O-Space imaging yields highly undersampled images of high resolution and minimal artifacts. The additional nonlinear gradient field improves image quality beyond conventional radial imaging.