Nonrigid medical image registration technique as a composition of local warpings

We introduce a new technique for nonrigid image registration based on the composition of local deformations. The warping model is analyzed in order to guarantee continuity, differentiability and a one-to-one transformation by constraining the parameters of the nonlinear spatial transformation. A genetic algorithm solves the model by global optimization, handling constraints, and maximizing the normalized mutual information. The composition of local transformations goes throughout several levels of resolution, from coarse to fine. The performance of our technique was tested in synthetic and real medical images. The proposed method was always able to improve the similarity criterion between image pairs, demonstrating the robustness of the method for several modalities of images.     

Semi-supervised image clustering with multi-modal information

How to organize and retrieve images is now a great challenge in various domains. Image clustering is a key tool in some practical applications including image retrieval and understanding. Traditional image clustering algorithms consider a single set of features and use ad hoc distance functions, such as Euclidean distance, to measure the similarity between samples. However, multi-modal features can be extracted from images. The dimension of multi-modal data is very high. In addition, we usually have several, but not many labeled images, which lead to semi-supervised learning. In this paper, we propose a framework of image clustering based on semi-supervised distance learning and multi-modal information. First we fuse multiple features and utilize a small amount of labeled images for semi-supervised metric learning. Then we compute similarity with the Gaussian similarity function and the learned metric. Finally, we construct a semi-supervised Laplace matrix for spectral clustering and propose an effective clustering method. Extensive experiments on some image data sets show the competent performance of the proposed algorithm.     

基于共享近邻的多视角谱聚类算法

为了解决谱聚类算法中相似矩阵的构造不能满足簇内数据点高度相似的问题,给出一种基于共享近邻的多视角谱聚类算法（MV-SNN）。首先,算法通过提高共享近邻个数多的两个数据点的相似度,使同簇的数据之间的相似度更高;然后,将改进后的多个视角的相似矩阵进行相加从而整合得到全局相似矩阵;最后,为了解决一般谱聚类算法在后期仍需要通过k均值聚类算法进行数据点划分的问题,给出拉普拉斯矩阵秩约束的方法,从而直接通过全局相似矩阵得到最终的类簇结构。实验结果表明,对比其他几种多视角谱聚类算法,MV-SNN算法在三个聚类衡量标准：准确度、纯度和归一化互信息上的性能提高了1%~20%,在聚类时间上减少了50%左右,可见MV-SNN算法的聚类性能更好,用时更短。     

基于共享近邻的多视角谱聚类算法

为了解决谱聚类算法中相似矩阵的构造不能满足簇内数据点高度相似的问题，给出一种基于共享近邻的多视角谱聚类算法（MV-SNN）。首先，算法通过提高共享近邻个数多的两个数据点的相似度，使同簇的数据之间的相似度更高；然后，将改进后的多个视角的相似矩阵进行相加从而整合得到全局相似矩阵；最后，为了解决一般谱聚类算法在后期仍需要通过k均值聚类算法进行数据点划分的问题，给出拉普拉斯矩阵秩约束的方法，从而直接通过全局相似矩阵得到最终的类簇结构。实验结果表明，对比其他几种多视角谱聚类算法，MV-SNN算法在三个聚类衡量标准：准确度、纯度和归一化互信息上的性能提高了1%~20%，在聚类时间上减少了50%左右，可见MV-SNN算法的聚类性能更好，用时更短。     

Automatic localization and annotation of facial features using machine learning techniques

Content-based image retrieval (CBIR) systems traditionally find images within a database that are similar to query image using low level features, such as colour histograms. However, this requires a user to provide an image to the system. It is easier for a user to query the CBIR system using search terms which requires the image content to be described by semantic labels. However, finding a relationship between the image features and semantic labels is a challenging problem to solve. This paper aims to discover semantic labels for facial features for use in a face image retrieval system. Face image retrieval traditionally uses global face-image information to determine similarity between images. However little has been done in the field of face image retrieval to use local face-features and semantic labelling. Our work aims to develop a clustering method for the discovery of semantic labels of face-features. We also present a machine learning based face-feature localization mechanism which we show has promise in providing accurate localization.     

基于人脸认知模式的相似脸搜索

目的 人类对人脸认知模式的探索由来已久,并且已经成功应用于美容整形等研究领域。然而,目前在计算机视觉和模式识别领域,计算人脸相似度的方法没有考虑人对人脸的认知模式,使得现有方法的计算结果从人的认知习惯角度来讲并非最佳。为克服以上缺陷,提出一种基于人脸认知模式的相似脸搜索算法。方法 依据人脸认知模式,选取特征点,并计算特征量,构造各面部器官（眼睛、鼻子、嘴巴、脸型）分类模型,即面部器官形状相似性度量模型,并采用圆形LBP算子,计算两幅人脸对应器官的纹理相似度,二者综合作为相似脸搜索的依据。结果 分别用本文方法和代表相似脸搜索最高水平的Face++的方法对80幅正面、中性表情、平视角度拍摄的人脸图像进行测试。本文方法的整体准确率高于Face++方法,其中,TOP1、TOP2最相似搜索结果准确率优势明显,均高出Face++方法12%以上。结论 实验结果表明,本文方法的搜索结果更加符合人脸认知模式,可应用于正面、中性表情、平视角度拍摄的人脸图像的相似脸搜索。此外,还可以将此类基于认知模式的图像搜索思路推广应用于商业领域,如基于图像的相似网购商品搜索等。     

大规模图像集中的代表性图像选取

针对传统图像检索系统通过关键字搜索图像时缺乏语义主题多样性的问题,提出了一种基于互近邻一致性和近邻传播的代表性图像选取算法,为每个查询选取与其相关的不同语义主题的图像集合. 该算法利用互近邻一致性调整图像间的相似度,再进行近邻传播（AP）聚类将图像集分为若干簇,最后通过簇排序选取代表性图像簇并从中选取中心图像为代表性图像. 实验表明,本文方法的性能超过基于K-means的方法和基于Greedy K-means的方法,所选图像能直观有效地概括源图像集的内容,并且在语义上多样化.     

Fuzzy spectral clustering with robust spatial information for image segmentation

In recent years, spectral clustering has become one of the most popular clustering algorithms in areas of pattern analysis and recognition. This algorithm uses the eigenvalues and eigenvectors of a normalized similarity matrix to partition the data, and is simple to implement. However, when the image is corrupted by noise, spectral clustering cannot obtain satisfying segmentation performance. In order to overcome the noise sensitivity of the standard spectral clustering algorithm, a novel fuzzy spectral clustering algorithm with robust spatial information for image segmentation (FSC_RS) is proposed in this paper. Firstly, a non-local-weighted sum image of the original image is generated by utilizing the pixels with a similar configuration of each pixel. Then a robust gray-based fuzzy similarity measure is defined by using the fuzzy membership values among gray values in the new generated image. Thus, the similarity matrix obtained by this measure is only dependent on the number of the gray-levels and can be easily stored. Finally, the spectral graph partitioning method can be applied to this similarity matrix to group the gray values of the new generated image and then the corresponding pixels in the image are reclassified to obtain the final segmentation result. Some segmentation experiments on synthetic and real images show that the proposed method outperforms traditional spectral clustering methods and spatial fuzzy clustering in efficiency and robustness.     

基于非局部自相似性的谱聚类图像去噪算法

常见的图像去噪方法只是单独地利用了无噪图像或含噪图像的先验信息,并没有将这两种图像的先验信息有效地结合起来。针对这个问题,提出一种 联合无噪图像块的先验信息和含噪图像块的非局部自相似性进行去噪的图像去噪算法。首先,对无噪图像块进行谱聚类,通过谱聚类进行学习,图像中的相似块被聚集到同一类,并将学习得到的聚类信息用于含噪图像块的聚类;然后,向量化同一类中的含噪图像块并聚集形成一个矩阵,该矩阵中包含的原始图像数据构成一个低秩矩阵;再通过一个低秩逼近过程估计出相应的原始图像数据;最后,根据逼近得到的原始图像数据重建图像。实验结果表明,相较于已有的自适应正则化的非局部均值去噪算法以及基于主成分分析和局部像素聚类的两级图像去噪算法,提出的算法不仅可以获得较大的峰值信噪比,而且还能较好地保存图像的细节,取得了更好的去噪效果。     

基于多代表点近邻传播的大数据图像分割算法

基于多代表点近邻传播聚类算法,提出一种有效的大数据图像的快速分割算法。 该算法首先运用均值漂移算法将彩色图像分割成很多小的同质区域,然后计算每个区域中所有 像素的颜色向量平均值,并用区域数目代替原图像像素点数目,选用区域间的距离作为相似度 的测度指标,最后应用多代表点近邻传播聚类算法在区域相似度矩阵上进行二次聚类,得到最 终的图像分割结果。实验结果证明,提出的算法在大数据图像的分割中取得了较为满意的分割 效果,且分割效率较高。     

互信息在图像检索中的应用

介绍了一种用互信息来衡量相似性图像检索方法.该方法首先生成一种在统计上有代表性的视觉模式,使用这种模式的分布作为图像内容的描述符;基于该内容描述,设计了其互信息的计算方法以衡量图像的相似性.实验结果表明,在图像检索中,相对于其它如KL散度和L2规范等方法,互信息是一种更为有效的衡量相似性的方法.     

Image‐to‐Geometry Registration: a Mutual Information Method exploiting Illumination‐related Geometric Properties

This work concerns a novel study in the field of image‐to‐geometry registration. Our approach takes inspiration from medical imaging, in particular from multi‐modal image registration. Most of the algorithms developed in this domain, where the images to register come from different sensors (CT, X‐ray, PET), are based on Mutual Information, a statistical measure of non‐linear correlation between two data sources. The main idea is to use mutual information as a similarity measure between the image to be registered and renderings of the model geometry, in order to drive the registration in an iterative optimization framework. We demonstrate that some illumination‐related geometric properties, such as surface normals, ambient occlusion and reflection directions can be used for this purpose. After a comprehensive analysis of such properties we propose a way to combine these sources of information in order to improve the performance of our automatic registration algorithm. The proposed approach can robustly cover a wide range of real cases and can be easily extended.     

基于公理模糊集与粒计算的人脸语义提取方法

在人脸检索和验证领域,人类更倾向于通过描述对象特征的“语义”或“概念”来对人脸进行相似性判别,而传统的图像检索已无法满足这一需求。因此,本文提出了一种基于公理模糊集(axiomatic fuzzy sets, AFS)与信息粒的人脸语义提取方法(IAFSGD)。首先,对人脸图像进行校正并检测人脸关键点,进而基于关键点提取人脸特征;然后,对人脸面部特征样本进行聚类,构建类中心,在AFS框架下求取每类的信息粒,并通过得到的信息粒对人脸图像再次进行分类,从而得到最终的聚类结果和具有可解释性的面部语义描述;最后,将本文提出的算法在Multi-PIE、AR、FEI人脸数据库进行实验验证。实验结果表明,与FCM(fuzzy c-means)、CAN(clustering with adaptive neighbors)、FCMGD、AFSGD、KTM(K-means tree)算法相比,本文提出的语义提取方法可以获得与人类感知更为接近的聚类结果,且结果具备很好的可解释性。     

Change detection in synthetic aperture radar images based on unsupervised artificial immune systems

In this paper, we propose a novel change detection method for synthetic aperture radar images based on unsupervised artificial immune systems. After generating the difference image from the multitemporal images, we take each pixel as an antigen and build an immune model to deal with the antigens. By continuously stimulating the immune model, the antigens are classified into two groups, changed and unchanged. Firstly, the proposed method incorporates the local information in order to restrain the impact of speckle noise. Secondly, the proposed method simulates the immune response process in a fuzzy way to get an accurate result by retaining more image details. We introduce a fuzzy membership of the antigen and then update the antibodies and memory cells according to the membership. Compared with the clustering algorithms we have proposed in our previous works, the new method inherits immunological properties from immune systems and is robust to speckle noise due to the use of local information as well as fuzzy strategy. Experiments on real synthetic aperture radar images show that the proposed method performs well on several kinds of difference images and engenders more robust result than the other compared methods.     

基于谱聚类的聚类集成算法

谱聚类是近年来出现的一类性能优越的聚类算法,能对任意形状的数据进行聚类, 但算法对尺度参数比较敏感,利用聚类集成良好的鲁棒性和泛化能力,本文提出了基于谱聚类的聚类集成算法.该算法首先利用谱聚类算法的内在特性构造多样性的聚类成员; 然后,采用连接三元组算法计算相似度矩阵,扩充了数据点之间的相似性信息;最后,对相似度矩阵使用谱聚类算法得到最终的集成结果. 为了使算法能扩展到大规模应用,利用Nystrm采样算法只计算随机采样数据点之间以及随机采样数据点与剩余数据点之间的相似度矩阵,从而有效降低了算法的计算复杂度. 本文算法既利用了谱聚类算法的优越性能,同时又避免了精确选择尺度参数的问题.实验结果表明:较之其他常见的聚类集成算法,本文算法更优越、更有效,能较好地解决数据聚类、图像分割等问题.     

基于半监督的超像素谱聚类彩色图像分割算法

近年来谱聚类算法被广泛应用于图像分割领域,而相似性矩阵的构造是谱聚类算法的关键步骤。 针对传统谱聚类算法计算复杂度高难以应用到大规模图像分割处理的问题,提出了基于半监督的超像素谱聚类彩色图像分割算法。该算法利用超像素将彩色图像进行预分割,利用用户提供的少量标记信息构造预分割区域的基于半监督的模糊相似性测度,利用该相似性测度构造预分隔区域的相似性矩阵并通过规范切图谱划分准则对预分割区域进行划分得到最终的图像分割结果。由于少量标记信息和模糊理论的引入,提高了传统谱聚类的分割性能,对比实验也表明该算法在分割效果和计算复杂度上都有较大的改善。     

改进的谱聚类算法在图像分割中的应用

为了消除传统的谱聚类图像分割算法存在的缺陷,提出一种改进的谱聚类图像分割算法.该算法提出余弦相似性加权矩阵,充分利用图像的纹理信息和空间临近信息构造相似性矩阵.在谱映射过程中,利用Nystr(o)m逼近策略估计相似性矩阵及其主特征向量.最后利用优化的K-means算法与优化的粒子群算法相结合的算法对得到的低维向量子空间进行聚类,避免直接采用K-means算法对初始值敏感,易陷入局部最优的缺点.实验证明该算法在运行时间和分割精度方面较传统谱聚类算法均有明显的提高.     

黎曼流形上的多模态医学图像配准

针对传统多模态配准方法忽视图像的结构信息和像素间的空间关系,并假定灰度全局一致的前提。本文提出了一种在黎曼流形上的多模态医学图像配准算法。首先采用线性动态模型捕捉图像的高维空间的非线性结构和局部信息,然后通过参数化动态模型构造出一种李群群元,形成黎曼流形,继而将流形嵌入到高维的再生核希尔伯特空间,再在核空间上学习出相似性测度。仿真和临床数据实验结果表明本文算法在刚体配准和仿射配准精度上均优于传统互信息方法和基于邻域的相似性测度学习方法。     

复杂高维数据的密度峰值快速搜索聚类算法

机器学习的无监督聚类算法已被广泛应用于各种目标识别任务。基于密度峰值的快速搜索聚类算法(DPC)能快速有效地确定聚类中心点和类个数,但在处理复杂分布形状的数据和高维图像数据时仍存在聚类中心点不容易确定、类数偏少等问题。为了提高其处理复杂高维数据的鲁棒性,文中提出了一种基于学习特征表示的密度峰值快速搜索聚类算法(AE-MDPC)。该算法采用无监督的自动编码器(AutoEncoder)学出数据的最优特征表示,结合能刻画数据全局一致性的流形相似性,提高了同类数据间的紧致性和不同类数据间的分离性,促使潜在类中心点的密度值成为局部最大。在4个人工数据集和4个真实图像数据集上将AE-MDPC与经典的K-means,DBSCAN,DPC算法以及结合了PCA的DPC算法进行比较。实验结果表明,在外部评价指标聚类精度、内部评价指标调整互信息和调整兰德指数上,AE-MDPC的聚类性能优于对比算法,而且提供了更好的可视化性能。总之,基于特征表示学习且结合流形距离的AE-MDPC算法能有效地处理复杂流形数据和高维图像数据。