Three dimension double inversion recovery gray matter imaging using compressed sensing

The double inversion recovery (DIR) imaging technique has various applications such as black blood magnetic resonance imaging and gray/white matter imaging. Recent clinical studies show the promise of DIR for high resolution three dimensional (3D) gray matter imaging. One drawback in this case however is the long data acquisition time needed to obtain the fully sampled 3D spatial frequency domain (k-space) data. In this paper, we propose a method to solve this problem using the compressed sensing (CS) algorithm with contourlet transform. The contourlet transform is an effective sparsifying transform especially for images with smooth contours. Therefore, we applied this algorithm to undersampled DIR images and compared with a CS algorithm using wavelet transform by evaluating the reconstruction performance of each algorithm for undersampled k-space data. The results show that the proposed CS algorithm achieves a more accurate reconstruction in terms of the mean structural similarity index and root mean square error than the CS algorithm using wavelet transform.     

水声正交频分多址上行通信稀疏信道估计与导频优化

针对水声正交频分多址(OFDMA)上行通信中用户导频数量少、分布不均匀, 导致传统内插信道估计方法产生误码平层的问题, 提出一种稀疏信道估计与导频优化方法. 基于压缩感知(CS)理论估计稀疏信道冲激响应, 并依据CS理论中测量矩阵互相关最小化原理, 提出基于随机搜索的导频图案和导频功率联合优化算法. 仿真结果表明, 所提方法在不同多径扩展信道下的性能均优于基于线性内插的最小二乘估计、未经导频优化的CS信道估计以及单纯基于导频图案优化的CS信道估计. 水池实验分别验证了交织式和广义式子载波分配的水声OFDMA上行通信性能, 在接收信噪比高于10 dB时利用所提方法实现了两用户接入的可靠通信.     

Bayesian compressive sensing for thermal imagery using Gaussian-Jeffreys prior

Recent advances have shown a great potential to explore compressive sensing (CS) theory for thermal imaging due to the capability of recovering high-resolution information from low-resolution measurements. In this paper, we present a Bayesian CS reconstruction algorithm that makes use of a new sparsity-inducing prior, referred as Gaussian-Jeffreys prior, and demonstrate performance gain of imposing this new prior on thermal imagery where the signal-to-noise ratio is low. We first derive a hierarchical representation of the Gaussian-Jeffreys prior that facilitates computational tractability, then propose an efficient evidence approximation inference algorithm. We show that the proposed estimator is able to provide stronger sparsity-inducing power comparing to the conventional choices. Extensive numerical examples are provided with performance comparisons of different CS estimators, in particular when the compressive measurements are available via thermal imaging.     

Compressed sensing with linear-in-wavenumber sampling in spectral-domain optical coherence tomography

We propose a novel method called compressed sensing with linear-in-wavenumber sampling (k-linear CS) to retrieve an image for spectral-domain optical coherence tomography (SD-OCT). An array of points that is evenly spaced in wavenumber domain is sampled from an original interferogram by a preset k-linear mask. Then the compressed sensing based on l1 norm minimization is applied on these points to reconstruct an A-scan data. To get an OCT image, this method uses less than 20% of the total data as required in the typical process and gets rid of the spectral calibration with numerical interpolation in traditional CS-OCT. Therefore k-linear CS is favorable for high speed imaging. It is demonstrated that the k-linear CS has the same axial resolution performance with ～30 dB higher signal-to-noise ratio (SNR) as compared with the numerical interpolation. Imaging of bio-tissue by SD-OCT with k-linear CS is also demonstrated.     

A compressed sensing approach for enhancing infrared imaging resolution

This paper presents a novel approach for improving infrared imaging resolution by the use of Compressed Sensing (CS). Instead of sensing raw pixel data, the image sensor measures the compressed samples of the observed image through a coded aperture mask placed on the focal plane of the optical system, and then the image reconstruction can be conducted from these samples using an optimal algorithm. The resolution is determined by the size of the coded aperture mask other than that of the focal plane array (FPA). The attainable quality of the reconstructed image strongly depends on the choice of the coded aperture mode. Based on the framework of CS, we carefully design an optimum mask pattern and use a multiplexing scheme to achieve multiple samples. The gradient projection for sparse reconstruction (GPSR) algorithm is employed to recover the image. The mask radiation effect is discussed by theoretical analyses and numerical simulations. Experimental results are presented to show that the proposed method enhances infrared imaging resolution significantly and ensures imaging quality.     

分块稀疏信号1-bit压缩感知重建方法

1-bit压缩感知理论指出:对稀疏信号进行少量线性投影并对投影信号进行1-bit量化,该1-bit信号包含足够的信息,从而能对原始信号进行高精度重建.然而,当信号难以进行稀疏表达时,传统1-bit压缩感知算法无法精确重建原始信号.前期研究表明,分块稀疏模型作为一种特殊的结构型稀疏模型,对于难以用传统稀疏模型进行表达的信号具有较好的表达作用.本文提出了一种针对分块稀疏信号的1-bit压缩感知重建方法,该方法利用分块稀疏的统计特性对信号进行数学建模,通过变分贝叶斯推断方法进行信号重建并在光电容积脉搏波(photoplethysmography)信号上进行了实验验证.实验结果表明,与现有1-bit压缩感知重建方法相比,本文方法重建精度更高,且收敛速度更快.     

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

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

Motion correction based reconstruction method for compressively sampled cardiac MR imaging

Respiratory motion during Magnetic Resonance (MR) acquisition causes strong blurring artifacts in the reconstructed images. These artifacts become more pronounced when used with the fast imaging reconstruction techniques like compressed sensing (CS). Recently, an MR reconstruction technique has been done with the help of compressed sensing (CS), to provide good quality sparse images from the highly under-sampled k-space data. In order to maximize the benefits of CS, it is obvious to use CS with the motion corrected samples. In this paper, we propose a novel CS based motion corrected image reconstruction technique. First, k-space data have been assigned to different respiratory state with the help of frequency domain phase correlation method. Then, multiple sparsity constraints has been used to provide good quality reconstructed cardiac cine images with the highly under-sampled k-space data. The proposed method exploits the multiple sparsity constraints, in combination with demon based registration technique and a novel reconstruction technique to provide the final motion free images. The proposed method is very simple to implement in clinical settings as compared to existing motion corrected methods. The performance of the proposed method is examined using simulated data and clinical data. Results show that this method performs better than the reconstruction of CS based method of cardiac cine images. Different acceleration rates have been used to show the performance of the proposed method.     

基于压缩感知理论的~(252)Cf源中子脉冲信号分析

针对252Cf源驱动核材料产生裂变中子脉冲信号具有脉冲序列特殊的"0,1"稀疏结构之特点,采用压缩感知理论,通过巧妙引入图论中的二分图模型,同时结合二分图的最小覆盖性质,适当添加约束条件,构建了稀疏均匀的观测矩阵。研究结果表明,利用压缩感知理论对"0,1"中子脉冲序列特殊稀疏结构的信号重构算法不仅可行,而且还获得了优于l1范数最小化方法重构结果,这对252Cf驱动核材料的中子脉冲信号分析与处理提供了一种新的途径或方法。     

Visually weighted reconstruction of compressive sensing MRI

Compressive sensing (CS) enables the reconstruction of a magnetic resonance (MR) image from undersampled data in k-space with relatively low-quality distortion when compared to the original image. In addition, CS allows the scan time to be significantly reduced. Along with a reduction in the computational overhead, we investigate an effective way to improve visual quality through the use of a weighted optimization algorithm for reconstruction after variable density random undersampling in the phase encoding direction over k-space. In contrast to conventional magnetic resonance imaging (MRI) reconstruction methods, the visual weight, in particular, the region of interest (ROI), is investigated here for quality improvement. In addition, we employ a wavelet transform to analyze the reconstructed image in the space domain and fully utilize data sparsity over the spatial and frequency domains. The visual weight is constructed by reflecting the perceptual characteristics of the human visual system (HVS), and then applied to ?₁ norm minimization, which gives priority to each coefficient during the reconstruction process. Using objective quality assessment metrics, it was found that an image reconstructed using the visual weight has higher local and global quality than those processed by conventional methods.     

Accelerated free-breathing 3D whole-heart magnetic resonance angiography with a radial phyllotaxis trajectory,compressed sensing,and curvelet transform

PurposeTo develop and validate an accelerated free-breathing 3D whole-heart magnetic resonance angiography (MRA) technique using a radial k-space trajectory with compressed sensing and curvelet transform.MethodA 3D radial phyllotaxis trajectory was implemented to traverse the centerline of k-space immediately before the segmented whole-heart MRA data acquisition at each cardiac cycle. The k-space centerlines were used to correct the respiratory-induced heart motion in the acquired MRA data. The corrected MRA data were then reconstructed by a novel compressed sensing algorithm using curvelets as the sparsifying domain. The proposed 3D whole-heart MRA technique (radial CS curvelet) was then prospectively validated against compressed sensing with a conventional wavelet transform (radial CS wavelet) and a standard Cartesian acquisition in terms of scan time and border sharpness.ResultsFifteen patients (females 10, median age 34-year-old) underwent 3D whole-heart MRA imaging using a standard Cartesian trajectory and our proposed radial phyllotaxis trajectory. Scan time for radial phyllotaxis was significantly shorter than Cartesian (4.88 ± 0.86 min. vs. 6.84 ± 1.79 min., P-value = 0.004). Radial CS curvelet border sharpness was slightly lower than Cartesian and, for the majority of vessels, was significantly better than radial CS wavelet (P-value < 0.050).ConclusionThe proposed technique of 3D whole-heart MRA acquisition with a radial CS curvelet has a shorter scan time and slightly lower vessel sharpness compared to the Cartesian acquisition with radial profile ordering, and has slightly better sharpness than radial CS wavelet. Future work on this technique includes additional clinical trials and extending this technique to 3D cine imaging.     

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

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

Accelerated 3D Coronary Vessel Wall MR Imaging Based on Compressed Sensing with a Block-Weighted Total Variation Regularization

Coronary vessel wall magnetic resonance (MR) imaging is important for heart disease diagnosis but often suffers long scan time. Compressed sensing (CS) has been previously used to accelerate MR imaging by reconstructing an MR image from undersampled k-space data using a regularization framework. However, the widely used regularizations in the current CS methods often lead to smoothing effects and thus are unable to reconstruct the coronary vessel walls with sufficient resolution. To address this issue, a novel block-weighted total variation regularization is presented to accelerate the coronary vessel wall MR imaging. The proposed regularization divides the image into two parts: a region-of-interest (ROI) which contains the coronary vessel wall, and the other region with less concerned features. Different penalty weights are given to the two regions. As a result, the small details within ROI do not suffer from over-smoothing while the noise outside the ROI can be significantly suppressed. Results with both numerical simulations and in vivo experiments demonstrated that the proposed method can reconstruct the coronary vessel wall from undersampled k-space data with higher qualities than the conventional CS with the total variation or the edge-preserved total variation.     

鬼成像中一些数学问题

鬼成像是一种与传统成像方式不同的通过光场涨落的高阶关联获得图像信息的新型成像方式。近年来,相比传统成像方式,鬼成像所拥有的一些优点如高灵敏度、超分辨能力、抗散射等,使其在遥感、多光谱成像、热X射线衍射成像等领域得到广泛研究。随着对鬼成像的广泛研究,数学理论和方法在其中发挥的作用愈显突出。例如,基于压缩感知理论,可以进行鬼成像系统采样方式优化、图像重构算法设计及图像重构质量分析等研究工作。本文旨在探索鬼成像中的一些有趣的数学问题,主要包括:系统预处理方法、光场优化及相位恢复问题。对这些问题的研究既可以丰富鬼成像理论,又能推动它在实际应用中的发展。     

Implementing compressive fractional Fourier transformation with iterative kernel steering regression in double random phase encoding

This paper proposes a novel approach in double random phase encryption based on compressive fractional Fourier transform along with the kernel steering regression. The method increases the complexity of the image by using fractional Fourier transform and taking fewer measurements from the image data. Numerical results are given to analyze the validity of this technique. Considering natural images to be sparse in some domain, we apply a compressive sensing (CS) approach by using a TwIST algorithm. The encryption process has kernel steering regression algorithm for denoising and compressive sensing technique for image compression along with the fractional Fourier transform that makes the image in more complex form.     

Compressed sensing MR image reconstruction using a motion-compensated reference

Compressed sensing (CS)-based methods have been proposed for image reconstruction from undersampled magnetic resonance data. Recently, CS-based schemes using reference images have also been proposed to further reduce the sampling requirement. In this study, we propose a new reference-constrained CS reconstruction method that accounts for the misalignment between the reference and the target image to be reconstructed. The proposed method uses a new image model that represents the target image as a linear combination of a motion-dependent reference image and a sparse difference image. We then use an efficient iterative algorithm to jointly estimate the motion parameters and the difference image from sparsely sampled data. Simulation results from a numerical phantom data set and an in vivo data set show that the proposed method can accurately compensate the motion effects between the reference and the target images and improve reconstruction quality. The proposed method should prove useful for several applications such as interventional imaging, longitudinal imaging studies and dynamic contrast-enhanced imaging.     

Total variation based gradient descent algorithm for sparse-view photoacoustic image reconstruction

In photoacoustic imaging (PAI), reconstruction from sparse-view sampling data is a remaining challenge in the cases of fast or real-time imaging. In this paper, we present our study on a total variation based gradient descent (TV-GD) algorithm for sparse-view PAI reconstruction. This algorithm involves the total variation (TV) method in compressed sensing (CS) theory. The objective function of the algorithm is modified by adding the TV value of the reconstructed image. With this modification, the reconstructed image could be closer to the real optical energy distribution map. Additionally in the proposed algorithm, the photoacoustic data is processed and the image is updated individually at each detection point. In this way, the calculation with large matrix can be avoided and a more frequent image update can be obtained. Through the numerical simulations, the proposed algorithm is verified and compared with other reconstruction algorithms which have been widely used in PAI. The peak signal-to-noise ratio (PSNR) of the image reconstructed by this algorithm is higher than those by the other algorithms. Additionally, the convergence of the algorithm, the robustness to noise and the tunable parameter are further discussed. The TV-based algorithm is also implemented in the in vitro experiment. The better performance of the proposed method is revealed in the experiments results. From the results, it is seen that the TV-GD algorithm may be a practical and efficient algorithm for sparse-view PAI reconstruction.     

基于奇异值分解和中位数绝对偏差的拉曼成像数据去噪方法

拉曼成像是一种无损伤、无需标记的光谱成像技术,它可以提供样品的不同组分的分子指纹信息以及空间分布特征,相比其他成像技术有着更重要的应用。但是拉曼散射的截面积小,灵敏度低,加上在很多实验中为了观察某些组分的动态分布而缩短扫描时间,导致最终得到的成像数据被噪声干扰,因此往往需要对信号进行去噪处理。常规的算法一般都是基于一个给定的数学模型对光谱进行处理,容易造成过滤波,使得信号失真;另外,在处理拉曼成像数据时,常规算法往往是对数据进行逐条光谱去噪,从而忽略了多条光谱之间的相互关系,导致最终的拉曼图像仍然受许多噪点干扰。因此,提出了一种基于奇异值分解和中位数绝对偏差的拉曼成像的信号处理方法,用于拉曼成像数据的去噪处理。该方法首先对拉曼成像数据进行奇异值分解,获得一个奇异值矩阵与两个正交矩阵;然后通过中位数绝对偏差法对奇异值矩阵中的各奇异值进行离群值检测,选取前k个被连续标记的离群值作为要保留的奇异值,并将其余的奇异值赋值为零,得到新的奇异值矩阵;最后用新的奇异值矩阵与两个正交矩阵重新求解得到去噪后的拉曼成像数据。实验中,首先验证了中位数绝对偏差法确定前k个奇异值的正确性,其次分别从处理后的图像质量和信号波形两方面对比了该算法与常规算法的去噪效果。结果证明,中位数绝对偏差法可以快速地确定出合理的k值大小,而且,依据该k值处理后的成像数据不仅在成像质量上消除了大量的噪点,使得组分的空间分布特征清晰可见,也在信号波形上较完美地保留了微小谱峰,并恢复光谱信号。该算法不同于常规算法,能同时对整个拉曼成像数据进行处理,并保留光谱之间的统计特征,是一种更加有效的拉曼成像数据的去噪方法。     

基于统计光学的正负热光非定域成像

本文, 基于经典统计光学, 建立符合热光特性的统计模型, 通过数值模拟证明了吴令安和Meyers提出的图像重构算法, 并进行了定性的理论分析. 在关联成像获得的数据样本中, 根据桶探测器的光强涨落进行分组, 分别以某个阈值作为下限和上限, 再将分组后的独立样本和相应的面探测器信号进行强度关联, 则可以得到物体的正像或负像. 然而, 不经过关联运算, 直接对分组后的面探测器信号进行算数平均也可以得到物体的正像或负像, 同时成像的对比度得到较大提高. 这种分组对应的非定域成像进一步说明强度涨落在热光成像中的重要性. 最后以字符掩膜版作为成像物体, 分别运用关联成像和分组对应正负成像算法重构物体的图像, 实验结果证明这种新的正负算法可以提高非定域成像的对比度. 关键词： 统计光学 热光 关联成像 正负非定域成像     

A simple application of compressed sensing to further accelerate partially parallel imaging

Compressed sensing (CS) and partially parallel imaging (PPI) enable fast magnetic resonance (MR) imaging by reducing the amount of k-space data required for reconstruction. Past attempts to combine these two have been limited by the incoherent sampling requirement of CS since PPI routines typically sample on a regular (coherent) grid. Here, we developed a new method, “CS+GRAPPA,” to overcome this limitation. We decomposed sets of equidistant samples into multiple random subsets. Then, we reconstructed each subset using CS and averaged the results to get a final CS k-space reconstruction. We used both a standard CS and an edge- and joint-sparsity-guided CS reconstruction. We tested these intermediate results on both synthetic and real MR phantom data and performed a human observer experiment to determine the effectiveness of decomposition and to optimize the number of subsets. We then used these CS reconstructions to calibrate the generalized autocalibrating partially parallel acquisitions (GRAPPA) complex coil weights. In vivo parallel MR brain and heart data sets were used. An objective image quality evaluation metric, Case-PDM, was used to quantify image quality. Coherent aliasing and noise artifacts were significantly reduced using two decompositions. More decompositions further reduced coherent aliasing and noise artifacts but introduced blurring. However, the blurring was effectively minimized using our new edge- and joint-sparsity-guided CS using two decompositions. Numerical results on parallel data demonstrated that the combined method greatly improved image quality as compared to standard GRAPPA, on average halving Case-PDM scores across a range of sampling rates. The proposed technique allowed the same Case-PDM scores as standard GRAPPA using about half the number of samples. We conclude that the new method augments GRAPPA by combining it with CS, allowing CS to work even when the k-space sampling pattern is equidistant.