超级计算中心客户细分及差异化服务策略研究

本文以中国科学院计算机网络信息中心超级计算中心（以下简称超级计算中心）客户服务工作为研究对象,运用 K-means 算法对客户进行细分,进而对每类客户群提出相应的差异化服务策略。实施差异化服务策略可以更好地分配资源、提供更有效的客户服务。     

Segmentation of the left ventricle in cardiac cine MRI using a shape-constrained snake model

Segmentation of the left ventricle (LV) is a hot topic in cardiac magnetic resonance (MR) images analysis. In this paper, we present an automatic LV myocardial boundary segmentation method using the parametric active contour model (or snake model). By convolving the gradient map of an image, a fast external force named gradient vector convolution (GVC) is presented for the snake model. A circle-based energy is incorporated into the GVC snake model to extract the endocardium. With this prior constraint, the snake contour can conquer the unexpected local minimum stemming from artifacts and papillary muscle, etc. After the endocardium is detected, the original edge map around and within the endocardium is directly set to zero. This modified edge map is used to generate a new GVC force filed, which automatically pushes the snake contour directly to the epicardium by employing the endocardium result as initialization. Meanwhile, a novel shape-similarity based energy is proposed to prevent the snake contour from being strapped in faulty edges and to preserve weak boundaries. Both qualitative and quantitative evaluations on our dataset and the publicly available database (e.g. MICCAI 2009) demonstrate the good performance of our algorithm.     

Global structure constrained local shape prior estimation for medical image segmentation

Organ shape plays an important role in clinical diagnosis, surgical planning and treatment evaluation. Shape modeling is a critical factor affecting the performance of deformable model based segmentation methods for organ shape extraction. In most existing works, shape modeling is completed in the original shape space, with the presence of outliers. In addition, the specificity of the patient was not taken into account. This paper proposes a novel target-oriented shape prior model to deal with these two problems in a unified framework. The proposed method measures the intrinsic similarity between the target shape and the training shapes on an embedded manifold by manifold learning techniques. With this approach, shapes in the training set can be selected according to their intrinsic similarity to the target image. With more accurate shape guidance, an optimized search is performed by a deformable model to minimize an energy functional for image segmentation, which is efficiently achieved by using dynamic programming. Our method has been validated on 2D prostate localization and 3D prostate segmentation in MRI scans. Compared to other existing methods, our proposed method exhibits better performance in both studies.     

红外图像统计闭值分割方法

经典的统计阈值方法采用某种形式的类方差和作为阈值选择的准则,未考虑实际图像的特性,对目标和背景具有相似统计分布的图像的分割效果不甚理想。为此,利用阈值分割后两个类的标准偏差定义了一个新的阈值选择准则,并通过最小化此准则选择出最佳分割阈值。通过一系列实际图像上的实验结果表明,与现有的几种经典阈值分割方法相比,本方法分割图像的效果更好,尤其是对红外图像分割的效果更为明显。     

基于模糊隶属度空间约束的FCM图像分割

针对模糊C均值(FCM)算法对噪声较为敏感,提出了基于隶属度空间约束的FCM图像分割方法,该方法将隶属度空间约束关系引入到FCM目标函数,在新的目标函数中,像素点的隶属度不仅仅与FCM标准目标函数有关,还与其领域像素点的隶属度有关。由于融合了图像像素点的空间信息,反映了领域像素点间的隶属度关联信息,因此该算法具有较强的杭噪性能。     

基于一种新的目标识别的边缘爬行算法

针对机器人目标识别的实时性、快速性和鲁棒性特点,依据物体边缘大部分区域的方向缓变原理,提出了一种基于记忆的边缘爬行改进算法.爬行搜索方法的一个明显缺点是"爬虫"容易掉进"陷阱",即围绕某个局部小区域重复爬行.记忆搜索方法则有效克服了爬行搜索方法容易掉进"局部陷阱"的不足.在边缘爬行的同时,通过标号将颜色相近的不同物体分割出来.实验结果表明,与传统方法比较,该方法的边缘线更加完整、清晰,而且缩短了处理图像的时间,使目标识别的实时性和鲁棒性得到了优化.     

参数自适应的条件随机场视频分割方法

针对已有算法需要采用一系列参数经验值得到最优视频分割结果的问题,提出根据视频特征自适应地计算视频邻域关系的特征强度函数,构造参数自适应的条件随机场视频分割模型。算法的核心思想是采用视频中像素之间的邻域关系自适应计算各个模型的特征函数,通过条件随机场模型对这些特征能量函数进行约束并利用Gibbs采样算法对该模型进行求解,获得全局优化的分割结果。针对不同环境下的视频分割实验表明,该算法能够很好地逼近最优经验参数所得到的视频分割结果,从而避免定义经验值所导致的算法局限性问题。     

DNA芯片图像的自适应提取

软件内嵌探针测试是在探针函数模板的框架内编写被测对象,并对被测对象进行面向对象软件的常规测试,在观察预期结果与实际结果是否一致的同时,还要察看探针函数输出的信息,以确定对象的状态是否正确。本论文研究的重点在于探针函数的构成、探针函数的实现及内嵌探针测试方法的应用研究,意在构筑一个基本的应用框架,提供一种实用的测试方法。     

基于数学形态学边缘检测的车牌字符分割算法

汽车牌照字符分割是车牌识别过程中的关键步骤,直接影响到字符识别的效果。传统的方法对车牌图像质量要求较高,且抗干扰能力较差。提出一种基于Renyi熵和数学形态学边缘检测的车牌字符投影分割算法,首先用二维Renyi熵最大阈值法对车牌图像做二值化处理,然后用形态学腐蚀运算进行边缘检测,再去除车牌边框,最后通过投影分割提取车牌字符。仿真实验表明,基于Renyi熵最大阈值法和数学形态学边缘检测车牌图像预处理使得车牌字符边缘清晰,降低了噪声的干扰,有利于进行字符投影分割。该算法分割速度快,鲁棒性好,可获得比传统方法更好的分割效果。