基于改进Demons算法的三维肺部医学影像配准研究*

为实现相同个体在不同呼吸状态下产生较大形变的三维肺部医学影像配准,提出一种基于改进Demons算法的精确有效配准方案。首先,对待配准影像进行全局非刚性配准。通过尺度不变特征变算法对影像进行特征点提取与匹配,根据匹配结果计算变换参数,完成全局配准;其次,利用改进Demons算法对全局配准后的影像进行局部非刚性配准。使用改进的方案实现了人体肺部影像配准,并且肺部整体轮廓以及内部组织的配准结果较理想。配准前,影像间的均方误差值为25835.3,经配准后影像间均方误差值降为3726.31,均方误差值下降率为85.58%。提出的方案能够有效配准三维肺部影像,为对肺部呼吸运动估计以及呼吸功能分析提供良好的基础。     

子宫肌瘤MRI影像非刚性配准研究

高强度聚焦超声(High-Intensity Focused Ultrasound,HIFU)治疗和磁共振技术结合(MRI-guided HIFU,MRgHIFU)采用MRI进行目标定位、治疗规划和能量沉积的闭环控制以保障热消融不伤及周围组织,其中图像配准是校正定位误差,实施精确治疗的重要环节。针对三维非刚性配准方法,在子宫肌瘤的治疗计划修正和跟踪方面的应用进行研究。针对前后两个不同时段采集的子宫肌瘤MR影像,分别进行基于自由形变模型(Free-From Deformation,FFD)算法和Demons算法的非刚性配准对比。实验结果表明,该基于FFD的非刚性配准算法,对于形变较小的子宫肌瘤真实数据能够取得较为合适的配准效果,重叠区域的互相关系数(CC)从配准前的0.59提高到配准后的0.74。     

基于跨接约束的高分辨率SAR 影像与光学影像配准

为了实现高分辨率SAR 影像与光学影像之间自动/半自动配准, 提出了一种新颖、稳健的匹配算法。算法首先利用仿射变换进行SAR 影像和光学影像粗匹配, 简化了整体算法的处理复杂度;然后利用影像边缘稳健性, 使用边缘提取算子分别对SAR 影像和光学影像进行边缘提取, 为后续精匹配做好了数据准备; 最后使用基于边缘纹理跨接约束进行影像之间精匹配, 方法引入了邻域配准约束机制, 很好的解决了经典匹配多峰值效应, 提高了算法稳健性和实用性。以国内机载高分辨率SAR 数据和SPOT 25 PAN 数据为例进行算法验证, 实验结果表明该算法能实现自动/半自动的高分辨率SAR 和光学影像之间的像素级配准。     

基于多薄板样条的多视角非刚性配准算法EI北大核心CSCD

为解决多视角配准中带有低频非刚性形变的深度数据容易产生累积误差、重叠区域未对齐等问题,提出一种基于多薄板样条的多视角非刚性配准算法.首先通过局部迭代最近点刚性配准算法得到重叠视角深度数据之间的对应点;然后基于多薄板样条的全局优化能量公式为每个视角求解一个薄板样条变换,使所有对应点之间距离的平方和最小;最后将优化后的薄板样条变换应用于每个视角的深度数据.通过在优化模型中引入初始点位置约束,该算法能使配准后的数据尽可能保持初始形状.为了加快求解速度,迭代地求解每个薄板样条变换,并且在优化过程中增量式地引入径向基函数.实验室结果表明,文中算法有较高的精度和效率,能够有效地减少累积误差并且提升重叠区域的对齐效果.     

基于特征约束与光流场方法的遥感图像配准

同一卫星的全色与多光谱图像由于拍摄时间不同、传感器视角有差异等原因,存在复杂的非刚性变形.针对上述问题,提出一种基于特征约束与光流场方法的配准方法.光流场方法是基于物理模型的配准方法,可以处理复杂的非刚性变形;特征约束可以提高配准精度;采用网格分割的方法分配特征点的光流场,可以提高配准的鲁棒性.以资源三号卫星图像为实验数据,实验结果表明,该方法能够取得较高精度和较好鲁棒性.     

基于多薄板样条的多视角非刚性配准算法

为解决多视角配准中带有低频非刚性形变的深度数据容易产生累积误差、重叠区域未对齐等问题,提出一种基于多薄板样条的多视角非刚性配准算法.首先通过局部迭代最近点刚性配准算法得到重叠视角深度数据之间的对应点;然后基于多薄板样条的全局优化能量公式为每个视角求解一个薄板样条变换,使所有对应点之间距离的平方和最小;最后将优化后的薄板样条变换应用于每个视角的深度数据.通过在优化模型中引入初始点位置约束,该算法能使配准后的数据尽可能保持初始形状.为了加快求解速度,迭代地求解每个薄板样条变换,并且在优化过程中增量式地引入径向基函数.实验室结果表明,文中算法有较高的精度和效率,能够有效地减少累积误差并且提升重叠区域的对齐效果.     

基于机器学习的肺部CT图像非刚性配准误差预测方法

配准误差评估通常由人工完成,耗时费力;常用的Dice测度只关注组织边缘的配准误差,难以评估组织内部配准结果。针对以上问题,提出一种基于机器学习的肺部CT图像非刚性配准误差预测方法(PREML)。该方法首先构建形变场统计特征、形变场物理保真度特征和图像相似性特征三类特征,然后通过池化方法扩充特征数量,最后使用随机森林回归方法预测非刚性配准误差,并且使用自适应随机扰动方法模拟肺部配准误差空间分布,进一步提升形变场统计特征的配准误差表征能力。在三个肺部CT图像数据集上进行训练与测试,其配准误差预测结果与金标准之间的平均绝对差异为1.245±2.500 mm,预测性能优于基线方法。结果表明,PREML方法具有预测精度高、鲁棒性强的特点,可提升配准算法在临床应用的有效性和安全性。     

简单交互式医学图像隐式曲面配准方法

对高分辨率体数据构成的医学图像进行隐式曲面配准是一件耗时的工作,对于发育未完全的儿童头骨中包含的大量不连续空洞这样的复杂情况,全自动算法一般难以处理,为此提出一种交互式的快速配准方法.首先对一定范围内体数据进行采样得到目标点集;而后将定义在模板网格上的局部最刚性变换能量引入非刚性最近点迭代配准中作为自动配准框架;在此基础上,加入用户实时交互对局部区域结果进行调整与优化.实验结果表明,对于平均120万体素采样点,该方法能够在13 s内完成配准过程,并且与marching cubes结果具有相似准确度.     

一种改进的非刚性医学图像配准算法

非刚性医学图像配准是医学影像处理和应用中重要的研究课题.对传统的基于局部仿射变换的非刚性图像配准模型进行了改进,结合图像的区域灰度信息和切比雪夫低通滤波器幅度特性提出了一种新颖的非刚性医学图像配准算法.该算法采用自适应的局部非线性正则项,比传统算法更好地保持了图像的局部细节和边缘信息,通过结合多分辨率分层细化以及由粗到细的变形技术求解策略,很好地解决了传统配准模型无法对大变形单模态图像或者存在灰度差异的多模态图像之间进行配准的问题.实验证明,该模型和算法可以很好地实现对医学图像的非刚性配准.     

基于自适应分数阶的医学图像非刚性配准

现有的医学图像配准算法对于灰度均匀、弱边缘以及弱纹理图像易陷入局部最优从而导致配准精度低下、收敛速度缓慢. 分数阶主动Demons (Fractional active Demons, FAD)算法是解决该问题的有效方法, 并且适用于图像的非刚性配准. 但FAD中的最佳分数阶阶次是人工交互选取, 并且对整幅图像都是固定不变的. 为了解决该问题, 提出一种阶次自适应的主动Demons算法并将其应用到医学图像的非刚性配准中. 算法首先根据图像的局部特征建立分数阶阶次自适应的数学模型, 并逐像素计算最优阶次, 基于该阶次构造Riemann-Liouvill (R-L)分数阶微分动态模板; 然后将自适应R-L分数阶微分引入到Active Demons算法, 在一定程度上缓解了图像配准在弱边缘和弱纹理区域易陷入局部最优问题, 从而提高了配准精度. 通过在两个医学图像库上进行实验验证, 实验结果表明该方法可以处理灰度均匀、弱纹理和弱边缘的医学图像非刚性配准, 配准精度得到较大提升.     

Fair relay selection in decode-and-forward cooperation based on outage priority

The opportunistic cooperation schemes,where only the "best" relay is selected to forward the message,have been widely investigated recently for their good performance in terms of outage probability.However,the unfair selections of relays may cause unbalance power consumptions among relays,which reduces the lifetime of energy constrained networks.In this paper,we introduce a novel concept of outage priority based fairness(OPF),aiming at improving the selection fairness among relays appropriately without outage performance deterioration.Then,a cooperation scheme is proposed to meet this concept,and corresponding theoretical analysis is also provided.Afterward,based on OPF,the achievable upper bound of the fairness is derived,and an optimal cross-layer designed scheme is also provided to achieve the bound.Numerical simulations are carried out finally,which not only validate the theoretical analysis,but also show that taking advantages of the proposed schemes,the fairness among all relays,as well as the network lifetime,can be greatly improved without any loss of outage performance,especially in high SNR regime.     

Non-Rigid Multi-Modal Image Registration Using Cross-Cumulative Residual Entropy

In this paper we present a new approach for the non-rigid registration of multi-modality images. Our approach is based on an information theoretic measure called the cumulative residual entropy (CRE), which is a measure of entropy defined using cumulative distributions. Cross-CRE between two images to be registered is defined and maximized over the space of smooth and unknown non-rigid transformations. For efficient and robust computation of the non-rigid deformations, a tri-cubic B-spline based representation of the deformation function is used. The key strengths of combining CCRE with the tri-cubic B-spline representation in addressing the non-rigid registration problem are that, not only do we achieve the robustness due to the nature of the CCRE measure, we also achieve computational efficiency in estimating the non-rigid registration. The salient features of our algorithm are: (i) it accommodates images to be registered of varying contrast+brightness, (ii) faster convergence speed compared to other information theory-based measures used for non-rigid registration in literature, (iii) analytic computation of the gradient of CCRE with respect to the non-rigid registration parameters to achieve efficient and accurate registration, (iv) it is well suited for situations where the source and the target images have field of views with large non-overlapping regions. We demonstrate these strengths via experiments on synthesized and real image data.     

基于改进的Zernike矩的局部描述符与图割离散优化的非刚性多模态脑部图像配准

针对脑部图像中存在噪声和强度失真时，基于结构信息的方法不能同时准确提取图像强度信息和边缘、纹理特征，并且连续优化计算复杂度相对较高的问题，根据图像的结构信息，提出了基于改进Zernike距的局部描述符（IZMLD）和图割（GC）离散优化的非刚性多模态脑部图像配准方法。首先，将图像配准问题看成是马尔可夫随机场（MRF）的离散标签问题，并且构造能量函数，两个能量项分别由位移矢量场的像素相似性和平滑性组成。其次，采用变形矢量场的一阶导数作为平滑项，用来惩罚相邻像素间有较大变化的位移标签；用基于IZMLD计算的相似性测度作为数据项，用来表示像素相似性。然后，在局部邻域中用图像块的Zernike矩来分别计算参考图像和浮动图像的自相似性并构造有效的局部描述符，把描述符之间的绝对误差和（SAD）作为相似性测度。最后，将整个能量函数离散化，并且使用GC的扩展优化算法求最小值。实验结果表明，与基于结构表示的熵图像的误差平方和（ESSD）、模态独立邻域描述符（MIND）和随机二阶熵图像（SSOEI）的配准方法相比，所提算法目标配准误差的均值分别下降了18.78%、10.26%和8.89%，并且比连续优化算法缩短了约20 s的配准时间。所提算法实现了在图像存在噪声和强度失真时的高效精确配准。     

A hierarchical parametric algorithm for deformable multimodal image registration

Image fusion is of utmost importance for many applications in image analysis. Particularly in medical imaging, images of different modalities are necessary because they provide complementary information that must be merged for an optimal use. The fusion of these images, which can be achieved through a registration process, makes it possible to superimpose all available information on the same frame. In many cases, a rigid transformation is sufficient to align correctly the images. However, there are cases where a non-rigid transformation is needed: geometrical distortions present in one image, non-rigid motion, etc. The purpose of this paper is to propose a generic method to account for these deformations in case of multimodal images. We have applied the algorithm in the particular context of 3D medical images and present results on simulated and real data.     

一种基于边缘特征的图像配准方法

采用一种基于边缘特征的图像配准方法,首先通过小波变换来提取图像的边缘,然后将人工选择的边缘点代入仿射变换模型,得到配准参数（每选择一组不同的边缘点,就会得到不同的配准参数）。在不同的配准参数条件下,计算两幅图像的交互方差。取交互方差最小时所对应的配准参数为最终的配准参数。最后再利用仿射变换模型对待配准图像进行平移、旋转、缩放得到最终的配准图像。     

Image fusion enhancement of deformable human structures using a two-stage warping-deformable strategy: A content-based image retrieval consideration

In medical image registration and content-based image retrieval, the rigid transformation model is not adequate for anatomical structures that are elastic or deformable. For human structures such as abdomen, registration would involve global features such as abdominal wall as well as local target organs such as liver or spleen. A general non-rigid registration may not be sufficient to produce image matching of both global and local structures. In this study, a warping-deformable model is proposed to register images of such structures. This model uses a two-stage strategy for image registration of abdomen. In the first stage, the global-deformable transformation is used to register the global wall. The warping-transformation is used in second stage to register the liver. There is a good match of images using the proposed method (mean similarity index = 0.73545).The image matching correlation coefficients calculated from eight pairs of CT and MR images of abdomen indicates that the warping-deformable transformation gives better matching of images than those without transformation (p < 0.001, paired t-test). This study has established a model for image registration of deformable structures. This is particularly important for data mining of image content retrieval for structures which are non-rigid. The result obtained is very promising but further clinical evaluation is needed     

Efficient multi-modal image registration using local-frequency maps

Fusing of multi-modal data involves automatically estimating the coordinate transformation required to align the multi-modal image data sets. Most existing methods in literature are not fast enough for practical use (taking more than 30 min to 1 h for estimating non-rigid deformations). We propose a very fast algorithm based on matching local-frequency image representations, which naturally allows for processing the data at different scales or resolutions, a very desirable property from a computational efficiency view point. For the rigid motion case, this algorithm involves minimizing – over all rigid transformations – the expectation of the squared difference between the local-frequency representations of the source and target images. In the non-rigid deformations case, we propose to approximate the non-rigid motion by piece-wise rigid motions and use a novel and fast PDE-based morphing technique that estimates this non-rigid alignment. We present implementation results for synthesized and real (rigid) misalignments between CT and MR brain scans. In both the cases, we validate our results against ground truth registrations which for the former case are known and for the latter are obtained from manual registration performed by an expert. Currently, these manual registrations are used in daily clinical practice. Finally, we present examples of non-rigid registration between T1-weighted MR and T2-weighted MR brain images wherein validation is only qualitatively achieved. Our algorithm's performance is comparable to the results obtained from algorithms based on mutual information in the context of accuracy of estimated rigid transforms but is much faster in computational speed. Accepted: 13 November 2001     

基于边缘最优映射的红外和可见光图像自动配准算法

针对同一场景的红外和可见光图像间一致特征难以提取和匹配的难题, 提出了一种在多尺度空间中基于边缘最优映射的自动配准算法. 在由粗至细的尺度空间中, 算法分别采用仿射模型和投影模型作为参考图像和待配准图像间的空间变换模型. 在每个尺度层上, 首先基于相位一致性方法提取两幅图像的边缘结构, 并在相应的空间变换模型下将在待配准图像中提取的二值边缘映射到参考图像的边缘强度图上; 接着采用并行遗传算法寻找一组全局最优的模型参数, 使两幅图像间的结构相似度最大. 在各层的寻优结束之后, 使用Powell算法对全局寻优后的模型参数进行局部精化. 实验结果表明, 该算法能够充分利用图像间的视觉相似结构, 有效地实现红外和可见光图像的自动配准.     

融合SIFT特征的熵图估计医学图像非刚性配准

配准准确性是医学图像配准算法的一项重要指标,像素灰度是目前图像配准中广泛使用的特征,但是灰度特征来源单一,而且忽略空间信息,在一些情况下容易产生误配。针对这个问题,本文提出一种融合SIFT特征的熵图估计医学图像非刚性配准算法。该算法首先使用基于互信息的刚性配准算法对两幅待配准图像进行粗配;然后,在采样点上提取像素灰度和SIFT高维特征,并在此基础上构造k-最邻近图(kNNG);最后,使用k-最邻近图来估计α互信息(αMI)。实验结果表明:和传统的基于互信息和像素灰度的刚性配准算法,基于熵图估计和单一像素灰度特征的非刚性配准算法相比,本文提出的算法具有更高的配准准确性。