基于峰值信噪比和小波方向特性的图像奇异值去噪技术

提出一种利用小波变换子图像不同的方向特性和峰值信噪比进行奇异值分解的图像去噪算法。由于图像经过小波变换后,低频子图像集中了原图像的大部分能量噪声,故仅作简单维纳滤波;而噪声则主要集中在小波域中的三个不同方向的高频子图中,且系数较小,因此可以利用奇异值分解进行去噪处理,即用较大的奇异值和对应的特征向量重构出去噪图像,然而由于奇异值分解固有的行列方向性,对于高频对角线子图重构出的图像去噪效果不理想,故采取旋转至行列方向后再进行常用的奇异值滤波;最后将去噪后的低频和高频子图进行小波反变换重构出最终的去噪图像,其中重构所需的奇异值个数由图像的峰值信噪比确定。 实验结果表明,该方法在有效去噪的同时较好的保留了原有的高频细节信息。     

一种基于改进频域图像配准技术的超分辨力图像处理方法

为提高光电成像系统的空间分辨力,提出了一种基于改进的频率域图像配准技术的超分辨力图像处理方法。首先利用改进的频域图像配准方法估算出低分辨力图像之间的微位移量,然后采用Papoulis-Gerchberg超分辨力处理方法完成图像复原。利用不同重构方法进行了仿真及实验研究,给出了评价参数。模拟和实际显微热图像的处理结果表明:该算法可使图像质量得到改善,分辨的细节更多,可有效地提高光电成像系统的空间分辨力;处理算法简单,计算量小,可实现快速处理。该算法还可应用于其他不可控光学微扫描成像系统中,具有广泛的应用前景。     

A non-rigid medical image registration method based on improved linear elastic model

Non-rigid medical image registration is an important research project of medical image processing; it is the basis of medical image fusion. Relative to rigid image, the deformation of non-rigid image is more serious and more complicated. According to the characteristics of non-rigid medical image deformation, this paper proposes an adaptive non-rigid medical image registration algorithm. Firstly, it is based on global registration; secondly, it is about extracting feature points of global registration image and the reference image, and then generating irregular triangle grid according to extracted feature points. Finally, local accurate image registration is achieved using the minimum potential energy as a similar measure. Experimental results show that relative to the traditional non-rigid registration algorithm, this algorithm not only ensures the registration accuracy but also enhances the robustness and anti-noise of registration algorithm.     

Atlas-based automatic mouse brain image segmentation revisited: model complexity vs. image registration

Although many atlas-based segmentation methods have been developed and validated for the human brain, limited work has been done for the mouse brain. This paper investigated roles of image registration and segmentation model complexity in the mouse brain segmentation. We employed four segmentation models [single atlas, multiatlas, simultaneous truth and performance level estimation (STAPLE) and Markov random field (MRF) via four different image registration algorithms (affine, B-spline free-form deformation (FFD), Demons and large deformation diffeomorphic metric mapping (LDDMM)] for delineating 19 structures from in vivo magnetic resonance microscopy images. We validated their accuracies against manual segmentation. Our results revealed that LDDMM outperformed Demons, FFD and affine in any of the segmentation models. Under the same registration, increasing segmentation model complexity from single atlas to multiatlas, STAPLE or MRF significantly improved the segmentation accuracy. Interestingly, the multiatlas-based segmentation using nonlinear registrations (FFD, Demons and LDDMM) had similar performance to their STAPLE counterparts, while they both outperformed their MRF counterparts. Furthermore, when the single-atlas affine segmentation was used as reference, the improvement due to nonlinear registrations (FFD, Demons and LDDMM) in the single-atlas segmentation model was greater than that due to increasing model complexity (multiatlas, STAPLE and MRF affine segmentation). Hence, we concluded that image registration plays a more crucial role in the atlas-based automatic mouse brain segmentation as compared to model complexity. Multiple atlases with LDDMM can best improve the segmentation accuracy in the mouse brain among all segmentation models tested in this study.     

Rapid Diffusion Weighted Imaging with Enhanced Resolution

In this paper, a new, fast compressively sensed diffusion magnetic resonance image enhancement technique is presented. This algorithm aims to overcome two major obstacles—image resolution limitation and algorithm reconstruction time efficiency-by combining a highly sparse k–q-space sampling pattern with super-resolution (SR) image enhancement. Similar to the RoSA (rotating single-shot acquisition) acceleration scheme, the presented algorithm takes advantage of simultaneous k–q-space sampling procedures being able to implement directly with no hardware modifications. The method sequentially processes compressively sensed k-space’s semi-PROPELLER blades with respect to appropriately synchronized diffusion directions. The dMR image structure is expressed as a kind of minimum-spanning tree. It fades out distortions of the image’s features. Moreover, as contrasted with numerous other super-resolution algorithms, the presented method overcomes the simplifying motion model as well as blur kernel and noise estimation issues. The simulation and experimental studies have been conducted using a dMRI scanner as well as a phantom input. Combining super-resolution with time-efficient data sets resulted in a reduction of motion artifacts, improving edge delineation as well as spatial resolution.     

基于约束优化的闪光照相图像重建算法

针对闪光照相图像受模糊及噪声影响的问题,提出了一种基于约束优化的闪光照相图像重建算法。该算法建立基于平行束投影的正向成像矩阵,并通过嵌入模糊矩阵表达成像过程中的模糊因素,采用最速下降法求解重建问题。在算法中设计了预优矩阵以提高迭代重建速度,利用客体密度值非负、密度分布分段光滑并含有阶跃性边界的先验知识,设计和采用了非负约束、光滑约束及广义变分边界约束条件。对仿真FTO客体图像及实际闪光照相图像的重建结果表明,基于约束优化的重建算法具有良好的边界保持能力及噪声抑制能力,可以有效提高图像重建质量。     

Image registration guided,sparsity constrained reconstructions for dynamic MRI

It is generally a challenging task to reconstruct dynamic magnetic resonance (MR) images with high spatial and high temporal resolutions, especially with highly incomplete k-space sampling. In this work, a novel method that combines a non-rigid image registration technique with sparsity-constrained image reconstruction is introduced. Employing a multi-resolution free-form deformation technique with B-spline interpolations, the non-rigid image registration accurately models the complex deformations of the physiological dynamics, and provides artifact-suppressed high spatial-resolution predictions. Based on these prediction images, the sparsity-constrained data fidelity-enforced image reconstruction further improves the reconstruction accuracy. When compared with the k-t FOCUSS with motion estimation/motion compensation (MEMC) technique on volunteer scans, the proposed method consistently outperforms in both the spatial and the temporal accuracy with variously accelerated k-space sampling. High fidelity reconstructions for dynamic systolic phases with reduction factor of 10 and cardiac perfusion series with reduction factor of 3 are presented.     

基于似然函数最速下降的红外与可见光图像配准

为了实现红外与可见光图像的自动配准,提出了基于似然函数最速下降迭代的图像配准算法.该算法以图像边缘作为配准点特征,将异源图像配准转化为边缘点集配准.基于点集的高斯混合模型建立了边缘点集配准似然函数,以该函数作为目标函数,仿射变换参量作为优化变量,利用最速下降方法进行最优变换参量求解,从而实现边缘点集配准.同时,将多分辨率金字塔引入迭代配准框架下,实现了高分辨率图像配准的加速.实验结果表明:该算法精度高,运算速度快,可以很好地完成可见光与红外图像的自动配准.     

基于相位一致性和Hough变换的多源图像配准方法

由于红外图像与可见光图像对比度不同,常用基于梯度幅值的特征匹配方法难以正确配准。在分析红外图像与可见光图像成像机制的基础上,提出了一种结合相位一致性边缘检测与Hough变换的多源图像配准新方法。该算法首先采用高通滤波和平台直方图均衡方法对红外图像进行预处理以提高红外图像的对比度,再利用具有图像对比度不变性的相位一致性边缘检测法提取两幅图像的边缘,结合Hough变换选取图像空间中最长的线作为特征,采用改进相位相关法作为相似性度量,在对数极坐标域下计算出两幅图像的几何变形参数。仿真实验结果表明,该方法能够以较高查准率实现红外与可见光图像自动配准,并具有较强的鲁棒性。     

A robust method for the reconstruction of disparity maps based on multilevel processing of stereo color image pairs

A novel method for the reconstruction of disparity maps (DMs) with robust properties to nonideal registration conditions, reflections, and noise in stereo color image pairs has been substantiated for the first time. The novel approach proposes a scheme for image DM reconstruction where Jaccard distance metric is used as a proximity criterion in stereo image pair matching. A physical interpretation of the method that allows the quality of the formed DMs to be improved significantly is given. A processing block diagram has been developed in accordance with the novel approach. Simulations of the novel DM reconstruction method have shown an advantage of the proposed DM reconstruction scheme in terms of generally recognized criteria, such as the structural similarity index measure and the bad matching pixels, and when visually comparing the formed DMs.     

基于多相组重建的航空图像超分辨率算法

为提高航空图像的空间分辨率, 提出一种基于多相组重建的超分辨率算法. 融合图像间的互补信息, 将多帧低分辨率图像作为图像基, 参考帧分解为多相组, 利用差异采样特性构建图像基与参考帧之间的的多相组线性关系重建得到高分辨率图像的多项组, 经图像多相分解逆变换获得融合的高分辨率图像. 根据该融合图像的局部内容和结构信息自适应调整控制核核函数, 应用改进的控制核回归算法去除图像模糊和噪声得到清晰的超分辨率图像. 与传统算法相比, 该算法无需图像配准和迭代过程, 计算效率极大地提高. 实验结果表明, 本文算法能够有效提高航空图像的空间分辨率, 在定量评价指标和主观视觉效果方面都有显著提高.     

图像超分辨率重建技术与方法综述

图像超分辨率重建可以利用多幅具有互补信息的低分辨率图像重构一幅高分辨率的图像,该技术已经成为图像处理领域的研究热点。介绍了图像超分辨率重建的基本原理,阐述了超分辨率重建技术与其它相关图像处理技术的关系;系统地总结了图像超分辨率重建中常用的运动估计方法、运算方式和质量评价方法。     

基于亚像素扫描的超分辨技术在高分辨X射线显微镜中的应用

在不改变现有硬件条件的情况下,开展超分辨扫描重建方法,可以在不增加系统成本的基础上提高高分辨X射线显微镜的成像性能.设计了基于亚像素扫描的超分辨扫描模式,按照设计的调制方式进行亚像素位移的移动,采集多幅具有互补信息的低分辨率图像;然后基于系统的点扩散函数,对高分辨率图像进行复原;最后结合POCS超分辨重建算法重建出高分辨图像.实验结果表明,10倍光耦探测器下的衬度噪声比提高了20%左右,空间分辨力提高了0.2μm(约15%),细节分辨能力超过探测器像素尺寸1.35μm的限制,可以看到在低分辨率图像中看不到的细节.实验说明用超分辨技术提高高分辨X射线显微镜的分辨率是有意义的.     

An adaptive super-resolution method based on regional pixel information and ringing artifacts suppression

Multi-frame image super-resolution (SR) aims to utilize information from a set of low-resolution (LR) images to compose a high-resolution (HR) one. In this paper, a novel multi-frame image super-resolution algorithm is proposed based on regional pixel information and ringing artifacts suppression. Firstly, a new regularization term which adopts Regional Adaptive Weight Coefficients (RAWC) is produced to keep edges and flat regions. After detailed analysis, an iterative process is given for image reconstruction. Then an adaptive term according to the local variance of iterative correction image is designed to evaluate the ringing artifacts. Finally, the original iteration is updated by adding the restraint term for better visual effects and lower noise of reconstructive HR image. Thorough experimental results show the proposed algorithm is effective for SR reconstruction and ringing artifacts suppression.     

Simulation and experiment research of face recognition with modified multi-method morphological correlation algorithm

Morphological definition of similarity degree of gray-scale image and general definition of morphological correlation (GMC) are proposed. Hardware and software design for a compact joint transform correlator are presented in order to implement GMC. Two kinds of modified general morphological correlation algorithm are proposed. The gray-scale image is decomposed into a set of binary image slices in certain decomposition method. In the first algorithm, the edge of each binary joint image slice is detected, width adjustability of which is investigated, and the joint power spectrum of the edge is summed. In the second algorithm, the joint power spectrum of each pair is binarized or thinned and then summed in one situation, and the summation of the joint power spectrums of these pairs is binarized or thinned in the other situation. Computer-simulation results and real face image recognition results indicate that the modified algorithm can improve the discrimination capabilities with respect to the gray-scale face images of high similarity.     

Random noise filtering method based on the inter-frame registration

One of the problems to be solved in image processing is how to eliminate image noise effectively. In this work, we brought forward a random noise filtering method based on the inter-frame registration. Firstly, we calculated the relative displacement of the adjacent frames by a registration algorithm. Then we divided the image into the overlapping area and the non-overlapping area according to the relative displacement. Finally, we do noise reduction processing for these two areas respectively. The experiments results indicate that the proposed method can reduce noise in both spatial and time domain of video images. The main advantage is that it cannot only remove noise, but also effectively protect the image edge and detail information. Besides, it not only maintains the de-noising effect of traditional inter-frame algorithm, but also is suitable for moving targets. It has better real-time performance and wider application range.     

Magnetic resonance image enhancement using highly sparse input

Lately, the Magnetic Resonance scans have struggled with its own inherent limitations, such as spatial resolution as well as long examination times. In this paper, a novel, rapid compressively-sensed magnetic resonance high resolution image resolution algorithm is presented. This technique addresses these two key issues by employing a highly-sparse sampling scheme and super-resolution reconstruction (SRR) method. Due to highly challenging requirements for the accuracy of diagnostic images registration, the presented technique exploits image priors, deblurring, parallel imaging, and a discrete dense displacement sampling for the deformable human body and motion analysis. The clinical trials as well as phantom based studied have been conducted. It has been proven that the proposed algorithm is able to enhance image spatial resolution, reduce motion artefacts and scan times.     

Resolution enhancement in MRI

We consider the problem of super-resolution reconstruction (SRR) in MRI. Subpixel-shifted MR images were taken in several fields of view (FOVs) to reconstruct a high-resolution image. A novel algorithm is presented. The algorithm can be applied locally and guarantees perfect reconstruction in the absence of noise. Results that demonstrate resolution improvement are given for phantom studies (mathematical model) as well as for MRI studies of a phantom carried out with a GE clinical scanner. The method raises questions that are discussed in the last section of the paper. Open questions should be answered in order to apply this method for clinical purposes.     

A CUDA-based reverse gridding algorithm for MR reconstruction

MR raw data collected using non-Cartesian method can be transformed on Cartesian grids by traditional gridding algorithm (GA) and reconstructed by Fourier transform. However, its runtime complexity is O(K× N²), where resolution of raw data is N× N and size of convolution window (CW) is K. And it involves a large number of matrix calculation including modulus, addition, multiplication and convolution. Therefore, a Compute Unified Device Architecture (CUDA)-based algorithm is proposed to improve the reconstruction efficiency of PROPELLER (a globally recognized non-Cartesian sampling method). Experiment shows a write–write conflict among multiple CUDA threads. This induces an inconsistent result when synchronously convoluting multiple k-space data onto the same grid. To overcome this problem, a reverse gridding algorithm (RGA) was developed. Different from the method of generating a grid window for each trajectory as in traditional GA, RGA calculates a trajectory window for each grid. This is what “reverse” means. For each k-space point in the CW, contribution is cumulated to this grid. Although this algorithm can be easily extended to reconstruct other non-Cartesian sampled raw data, we only implement it based on PROPELLER. Experiment illustrates that this CUDA-based RGA has successfully solved the write–write conflict and its reconstruction speed is 7.5 times higher than that of traditional GA.     

基于AM测度及混合优化算法的图像配准方法

介绍了一种基于边缘特征的图像配准方法。首先利用Canny算子提取图像的边缘;然后以AM测度作为配准准则,在优化AM峰值和配准参数的时候,先用遗传算法将配准参数收敛到最优值附近,再使用Powell法进行局部搜索;最后对待配准图像进行刚体变换及双线性插值,从而实现图像配准。实验结果表明,此优化方法不仅提高了计算速度,而且提高了配准精度,配准结果达到了亚像素级水平。