基于加权Schatten p范数最小化的磁共振图像重构方法研究

本文提出了一种基于加权Schatten p范数最小化（Weighted Schatten p-Norm Minimization,WSNM）的磁共振图像重构算法,该方法利用磁共振图像的非局部自相似性,并结合Schatten p范数和不同秩元素重要性的加权因子,实现磁共振图像重构过程的低秩约束.此外,采用交替方向乘子算法（Alternating Direction Method of Multipliers,ADMM）来求解基于WSNM磁共振图像重构的非凸最小化问题.实验结果表明,相比于最近的磁共振重构算法,基于WSNM的磁共振图像重构方法具有更好的重建效果,可获得更高的峰值信噪比（Peak Signal to Noise Ratio,PSNR）和更好的结构相似性（Structural Similarity,SSIM）.     

基于局部多尺度低秩分解的红外小目标检测算法

针对红外低秩块模型计算复杂度大,容易误判等不足,提出了一种更加有效的红外小目标局部多尺度低秩分解检测算法。该算法首先利用非下采样金字塔变换对红外小目标图像做多尺度分解;接着,将分解出的高频子带进行融合,通过融合后的高频信息提取出目标感兴趣区域;最后,利用红外小目标背景的非局部自相关性质对感兴趣区域进行分块,并对各块进行重新排列构成一个新的矩阵;最后,对该矩阵做低秩分解,提取出红外小目标。实验结果表明,与其他低秩分解类方法相比,所提出算法速度更快,提取效果更好,是一种性能优越的方法。     

一种新的融合小波变换与低秩矩阵恢复的图像去噪算法

针对小波阈值图像去噪会引入量化噪声和阈值选取不当会损失图像本身有用信息的问题,提出一种新的融合小波变换与低秩矩阵恢复(Low Rank Matrtix Recovery,LRMR)的图像去噪算法.不同于传统的单一阈值的去噪算法,所提出的算法在单一阈值上结合了低秩矩阵恢复算法,这样不仅能进一步消除噪声,同时还能修复被噪声损坏的数据,而且更能适应各种不同的噪声环境.首先,选取固定阈值对图像矩阵进行小波去噪处理.其次,采用增广拉格朗日乘子算法最小化矩阵核范数.最后,将矩阵分解为低秩逼近矩阵和稀疏误差矩阵.实验结果表明,算法获得了较高的峰值信噪比,在不同噪声环境下有较高的鲁棒性.     

通信辐射源的潜在细微特征提取方法

为了充分挖掘高维特征空间中辐射源的细微特征, 提出一种基于全局潜在低秩表示(Global Latent Low Rank Representation, GLat-LRR)的通信辐射源潜在细微特征提取方法.首先, 提取通信辐射源信号的瞬时频率, 通过傅里叶变换将信号投影到高维特征空间; 挖掘特征样本之间全局的低秩结构和维度之间全局的潜在低秩关系, 将特征样本集作为整体应用到潜在低秩表示模型中, 利用维度之间低秩关系得到特征样本集的潜在部分矩阵, 每个列向量即为每个通信辐射源信号的潜在细微特征向量.在实际采集的同厂家同型号FM电台数据集上, 该方法提取的潜在细微特征能够显著提高通信辐射源个体识别的性能.     

基于低秩矩阵恢复的SAR图像相干斑抑制方法

针对合成孔径雷达(SAR)图像相干斑噪声的特点,提出了一种基于低秩矩阵恢复的SAR图像相干斑抑制算法。该算法首先对SAR图像进行对数变换,将SAR图像相干斑乘性噪声转化为加性噪声;然后对变换后图像等步长遍历提取图像子参考块,利用局部块匹配技术寻找子参考块的相似块组建相似子集,合并数据集中所有相似子集,构建近似低秩的矩阵;再通过低秩矩阵恢复算法将矩阵分解为低秩矩阵部分和稀疏矩阵部分;最后将低秩矩阵部分逆变换回图像块,基于图像块灰度值对图像的每个像素进行加权重构,生成相干斑抑制后的SAR图像。实验表明,文中所提出的算法能够有效抑制SAR图像中的相干斑噪声,同时很好地保留了边缘细节特征。     

基于跨尺度低秩约束的单幅图像盲超分辨率算法

单幅图像盲超分辨率方法是在模糊核未知的情况下仅利用单幅低分辨率图像重建高分辨率图像,这是一个严重的欠定逆问题.超分辨率正则化方法通过正则化约束项引入附加信息,为低分辨率图像恢复或重建合理的高频成分.本文将跨尺度自相似性与低秩先验相结合,提出了一种基于跨尺度低秩约束的单幅图像盲超分辨率方法,采用联合建模的方法同时估计模糊核与高分辨率图像.利用高分辨率图像、低分辨率图像及其降采样图像之间的跨尺度自相似性,对于低分辨率图像中的图像块在降采样图像中搜索相似块,将该图像块在高分辨率重建图像中对应的父块与其相似块在低分辨率图像中对应的父块合并,构造跨尺度相似图像块组矩阵.由于低分辨率图像中的跨尺度相似图像块能够为重建图像块提供潜在的细节信息,因此对相似图像块组矩阵进行低秩约束,在迭代求解过程中迫使重建图像恢复高频成分,进而促使模糊核的估计更加准确.此外,低秩约束能够表示数据的全局结构,对噪声具有鲁棒性.在真实和模拟图像上的实验表明,本文的算法能够准确地估计模糊核,重建高分辨率图像的边缘和细节,优于现有的自监督盲超分辨率算法.     

基于矩阵因子重构的MIMO雷达角度估计方法

多输入多输出（MIMO）雷达中部分失效阵元会使得阵列采样数据丢失,从而导致较差的角度估计性能。为此,提出一种基于不完整矩阵因子重构的MIMO雷达角度估计方法。首先,根据协方差矩阵可分解的性质,提取维度较低的矩阵因子,并将协方差矩阵中缺失数据恢复问题转化为矩阵因子重构问题。然后,为了利用矩阵因子中元素的相关性,对不完整矩阵因子建立核范数约束下的低秩Hankel矩阵重构模型;为避免传统的核范数最小化求解中计算复杂度高的问题,采用低秩矩阵拟合方法将Hankel矩阵分解为两个维度较低的矩阵,等价表达了核范数约束。最后,利用交替方向乘子法（ADMM）对该矩阵重构模型进行求解。仿真结果表明,本文方法可以有效地重构出矩阵因子中的缺失元素,进而实现阵列协方差矩阵中丢失数据的补全,改善阵元失效下的MIMO雷达角度估计性能。     

基于截断核范数正则化的协方差矩阵估计

非均匀杂波环境导致机载雷达用于协方差矩阵估计的样本不足。本文提出了一种基于截断核范数正则化（Truncated Nuclear Norm Regularization, TNNR）的协方差矩阵估计算法以满足小样本条件下机载雷达空时自适应处理（Space Time Adaptive Processing, STAP）应用。本文利用TNNR确保所估计杂波协方差矩阵（Clutter Covariance Matrix, CCM）的低秩特性,并将NP-hard问题转换为凸优化问题。不同于常规的秩最小化算法,如核范数松弛方法,本文所提出的TNNR算法仅最小化与矩阵的秩无关的较小奇异值的和,可以更加准确地约束矩阵的秩。在此基础上本文还利用CCM的块Toeplitz结构先验信息,可确保在连续域上进行信号建模,有效避免网格点失配问题。仿真结果表明本文所提出的算法在小样本条件下可更加准确地估计CCM且STAP性能更优。     

基于低秩矩阵近似的低噪宽幅热红外成像技术

为解决强背景弱信号场景下热红外成像系统噪声制约图像信噪比的问题,提出了一种基于低秩矩阵近似理论的低噪宽幅热红外成像技术.利用面阵摆扫方式实现宽幅扫描成像并构建严格的观测矩阵,通过加权核范数最小化方法求解去噪的低秩矩阵形式.试验证明该技术具有较高的峰值信噪比与降噪鲁棒性,在宽幅成像的同时也提高了探测灵敏度.研究成果在红外弱目标识别、广域侦查等领域具有一定应用价值.     

应用残差总变分和低秩表示的视频去噪算法

为了有效地去除视频当中的高斯噪声和脉冲噪声,提出了一种新的视频去噪算法。该算法通过相似图像块组内的残差值总变分及低秩表示来同时探索图像块内的局部相似性以及图像块之间的相似性。首先,采用块匹配的方式在含噪视频中寻找最相似图像块并组合成图像块组;其次将每个相似图像组表达为一个低秩矩阵及一个稀疏矩阵之和,并同时强调低秩矩阵内的残差总变分范数最小化;最后,通过求解最优化问题获得最终的低秩矩阵,即恢复出的图像块组数据。实验结果表明,本文的算法能够有效去除视频当中含有的高斯噪声和脉冲噪声。与同类算法相比,能够获得显著的峰值信噪比提升。      

基于非局部低秩和加权全变分的图像压缩感知重构算法

为准确有效地实现自然图像的压缩感知(CS)重构,该文提出一种基于图像非局部低秩(NLR)和加权全变分(WTV)的CS重构算法。该算法考虑图像的非局部自相似性(NSS)和局部光滑特性,对传统的全变分(TV)模型进行改进,只对图像的高频分量设置权重,并用一种差分曲率的边缘检测算子来构造权重系数。此外,算法以改进的TV模型与NLR模型为约束构建优化模型,并分别采用光滑非凸函数和软阈值函数来求解低秩和全变分优化问题,很好地利用了图像的自身性质,保护了图像的细节信息,并提高了算法的抗噪性和适应性。仿真结果表明,与基于NLR的CS算法相比,相同采样率下,该文所提算法的峰值信噪比最高可提高2.49 dB,且抗噪性更强,验证了算法的有效性。     

TRIO a technique for reconstruction using intensity order: application to undersampled MRI

Long acquisition times are still a limitation for many applications of magnetic resonance imaging (MRI), specially in 3-D and dynamic imaging. Several undersampling reconstruction techniques have been proposed to overcome this problem. These techniques are based on acquiring less samples than specified by the Nyquist criterion and estimating the nonacquired data by using some sort of prior information. Most of these reconstruction methods use prior information based on estimations of the pixel intensities of the images and therefore they are prone to introduce spatial or temporal blurring. Instead of using the pixel intensities, we propose to use information that allows us to sort the pixels of an image from darkest to brightest. The set of order relations which sort the pixels of an image has been called intensity order. The intensity order of an image can be estimated from low-resolution images, adjacent slices in volumetric acquisitions, temporal correlation in dynamic sequences or from prior reconstructions. Our technique for reconstruction using intensity order (TRIO) consists of looking for an image that satisfies the intensity order and minimizes the discrepancy between the acquired and reconstructed data. Results show that TRIO can effectively reconstruct 2-D-cine cardiac MR images (under-sampling factor of 4), estimating correctly the temporal evolution of the objects. Furthermore, TRIO is used as a second stage reconstruction after reconstructing with other techniques, keyhole, sliding window and k-t BLAST, to estimate the order information. In all cases the images are improved by TRIO.     

基于非局部双边随机投影低秩逼近图像去噪算法

该文提出一种基于非局部双边随机投影的低秩逼近图像去噪新方法。首先,对每个图像块通过非局部搜索寻找相似匹配块簇,然后对相似匹配块簇进行双边随机投影,用投影后的低秩结构恢复原图像。实验结果表明,所提方法比奇异值分解方法有较低的计算复杂度,比单边随机投影方法有较小的重构误差。特别是和3维块匹配方法相比,所提方法能保持相近的信噪比和较好的视觉质量。     

Opportunistic interference alignment for three‐tier partially connected heterogeneous networks

With the expected increase in the number of connected devices, heterogeneous networks (HetNets) technology has gained great attention in next generation wireless networks. The deployment of such low power nodes in the same geographical area and using the same allocated frequency introduces significant interference among different nodes in the network. In this paper, we propose a two‐stage opportunistic interference alignment (OIA) scheme for the three‐tier downlink HetNet that targets user scheduling along with mitigating intertier and intratier interference signals. Two cascaded precoding matrices as well as two cascaded postcoding matrices are used to perform the two‐stage interference alignment (IA) operation. The outer precoding/postcoding matrix pair are designed using the rank‐constrained rank minimization (RCRM) to minimize the interference among the users associated to the same tier. Simulations show that the proposed scheme outperforms other conventional schemes in terms of the sum rate and the sum achieved degrees of freedom (DoF).     

Registration and tracking to integrate X-ray and MR images in an XMR facility

We describe a registration and tracking technique to integrate cardiac X-ray images and cardiac magnetic resonance (MR) images acquired from a combined X-ray and MR interventional suite (XMR). Optical tracking is used to determine the transformation matrices relating MR image coordinates and X-ray image coordinates. Calibration of X-ray projection geometry and tracking of the X-ray C-arm and table enable three-dimensional (3-D) reconstruction of vessel centerlines and catheters from bi-plane X-ray views. We can, therefore, combine single X-ray projection images with registered projection MR images from a volume acquisition, and we can also display 3-D reconstructions of catheters within a 3-D or multi-slice MR volume. Registration errors were assessed using phantom experiments. Errors in the combined projection images (two-dimensional target registration error--TRE) were found to be 2.4 to 4.2 mm, and the errors in the integrated volume representation (3-D TRE) were found to be 4.6 to 5.1 mm. These errors are clinically acceptable for alignment of images of the great vessels and the chambers of the heart. Results are shown for two patients. The first involves overlay of a catheter used for invasive pressure measurements on an MR volume that provides anatomical context. The second involves overlay of invasive electrode catheters (including a basket catheter) on a tagged MR volume in order to relate electrophysiology to myocardial motion in a patient with an arrhythmia. Visual assessment of these results suggests the errors were of a similar magnitude to those obtained in the phantom measurements.     

Efficient Spatially-Variant Single-Pixel Imaging Using Block-Based Compressed Sensing

Single-pixel imaging is an important alternative to conventional camera. Only a single-pixel detector is needed to capture image data by measuring the correlation of the target scene and a series of sensing patterns. Conventionally, Nyquist-Shannon theorem requires measurements not less than the image pixels for an error-free reconstruction. Compressed sensing (CS) enables image reconstructions with fewer measurements but the image quality and computational cost remain the primary concerns. This paper presents an efficient single-pixel imaging technique based on blocked-based CS in which the sensing matrices are designed based on spatially-variant resolution (SVR). The proposed method decreases the number of measurements as well as the image reconstruction time using the SVR sensing patterns. Furthermore, it takes advantage of block-based CS to reduce the expenses of computational resources. The proposed method is evaluated and compared to conventional uniform resolution (UR) image reconstruction in terms of image quality and reconstruction time. The results show that the proposed method consistently reduces the reconstruction time and able to give better image quality at lower sampling ratio (SR). This provides an efficient reconstruction for single-pixel imaging which is desirable in practical application and situations where low sampling rate is required.

     

Toeplitz-Based Iterative Image Reconstruction for MRI With Correction for Magnetic Field Inhomogeneity

In some types of magnetic resonance (MR) imaging, particularly functional brain scans, the conventional Fourier model for the measurements is inaccurate. Magnetic field inhomogeneities, which are caused by imperfect main fields and by magnetic susceptibility variations, induce distortions in images that are reconstructed by conventional Fourier methods. These artifacts hamper the use of functional MR imaging (fMRI) in brain regions near air/tissue interfaces. Recently, iterative methods that combine the conjugate gradient (CG) algorithm with nonuniform FFT (NUFFT) operations have been shown to provide considerably improved image quality relative to the conjugate-phase method. However, for non-Cartesian k-space trajectories, each CG-NUFFT iteration requires numerous k-space interpolations; these are operations that are computationally expensive and poorly suited to fast hardware implementations. This paper proposes a faster iterative approach to field-corrected MR image reconstruction based on the CG algorithm and certain Toeplitz matrices. This CG-Toeplitz approach requires k-space interpolations only for the initial iteration; thereafter, only fast Fourier transforms (FFTs) are required. Simulation results show that the proposed CG-Toeplitz approach produces equivalent image quality as the CG-NUFFT method with significantly reduced computation time.     

Time-resolved interventional cardiac C-arm cone-beam CT: an application of the PICCS algorithm

Time-resolved cardiac imaging is particularly interesting in the interventional setting since it would provide both image guidance for accurate procedural planning and cardiac functional evaluations directly in the operating room. Imaging the heart in vivo using a slowly rotating C-arm system is extremely challenging due to the limitations of the data acquisition system and the high temporal resolution required to avoid motion artifacts. In this paper, a data acquisition scheme and an image reconstruction method are proposed to achieve time-resolved cardiac cone-beam computed tomography imaging with isotropic spatial resolution and high temporal resolution using a slowly rotating C-arm system. The data are acquired within 14 s using a single gantry rotation with a short scan angular range. The enabling image reconstruction method is the prior image constrained compressed sensing (PICCS) algorithm. The prior image is reconstructed from data acquired over all cardiac phases. Each cardiac phase is then reconstructed from the retrospectively gated cardiac data using the PICCS algorithm. To validate the method, several studies were performed. Both numerical simulations using a hybrid motion phantom with static background anatomy as well as physical phantom studies have been used to demonstrate that the proposed method enables accurate reconstruction of image objects with a high isotropic spatial resolution. A canine animal model scanned in vivo was used to further validate the method.     

基于全变分扩展方法的压缩感知磁共振成像算法研究

针对全变分算法在压缩感知磁共振成像(CS-MRI)重构过程中存在阶梯效应的问题,该文研究3种基于全变分扩展方法的CS-MRI成像算法,即高阶全变分、总广义变分和组合稀疏全变分,并将其与平移不变离散小波稀疏基相结合,建立稀疏模型,采用快速复合分裂算法求解CS-MRI重构的凸优化问题。同时,讨论了全变分及其扩展方法对两种不同磁共振图像数据和径向欠采样模式重构CS-MRI的精度。实验结果表明,基于全变分扩展的重构算法能有效解决全变分重建中存在阶梯效应的缺点;另外,相比高阶全变分和总广义变分重构算法,组合稀疏全变分方法具有更好的重建效果,获得更高重构信噪比。