21世纪初中国农作物与自然植被物候时空差异

利用离散小波方法对2001~2012年MODIS EVI时序数据进行平滑,基于动态阈值法提取我国植被物候信息,探讨农作物和自然植被物候的时空变化特征。结果表明:(1)我国第一季农作物开始、峰值和结束日期主要以华北平原为中心随海拔的上升而推迟,而自然植被物候更早20d左右,且随海拔的上升先推迟后提前;(2)物候在时序上有显著变化的第一季区域,43.98%开始日期、52.83%峰值日期呈现提前趋势,多在开始晚、结束早的西南区及东北与内蒙古交界处,其余区域开始、峰值日期及81.80%结束日期呈推迟趋势,发生在开始早、结束晚的黄土高原及双季农作区;农作物物候推迟幅度小于自然植被。     

一种适用连续不确定XML数据的索引

针对连续不确定XML数据概率阈值范围查询,提出一种新的CUXI索引树。该索引树的构建方法是借鉴U树对空间数据自顶向下递归构建索引树的思想,将连续不确定XML文档中具有相同父亲的叶子节点构建二维数据矩形,在聚类的基础上来构建相应的CUXI索引树,其中叶子节点存储连续不确定数据辅助信息。为了提高查询效率,对连续不确定数据制定了过滤策略,通过遍历索引树过滤掉不满足查询范围的子树。理论和实验结果表明,此索引技术可提高查询处理的性能。     

结合肤色分割与平滑的人脸图像快速美化

目的 针对目前人脸图像美化算法存在的对于细节丰富的眼睛和头发等区域处理过度平滑,美化后的图像整体美化效果较差等问题,提出一种基于肤色分割与平滑人脸图像的美化方法。方法 首先对脸部瑕疵特性,用双指数边缘保护滤波器平滑人脸图像的瑕疵,与此同时很好保持图像边缘信息;再通过利用色度直方图自适应快速检测、修正、分割肤色区域;然后利用拟合高斯羽化皮肤区域生成蒙版,融合平滑图像和原图像,保留图像头发背景等细节信息;最后基于人像美感标准,对皮肤亮度通过拟合log曲线实现快速自适应调整人脸图像亮度,增强眼睛等细节,从而快速实现人脸图像美化方法。结果 通过与其他人像美化算法相比较,在保留边缘方面,该算法更有效地对皮肤边缘上的瑕疵进行平滑,达到更好地美化人脸图像;而在时间复杂度方面,相对于前人的算法,计算速度快12倍,实现快速美化人脸图像。结论 该算法适应能力较强,对大部分人脸图像的脸部瑕疵完美去除的同时达到背景信息不变,肤色美白自然,使整体美化效果显著;尤其是细节丰富的边缘区域平滑适度,具有一定的实用性。     

基于小波分析的MEMS加速度计输出噪声消除

目前MEMS加速度计普遍存在信噪比低、灵敏度不高等缺点,其主要原因是系统内部电路中的干扰与噪声使得有用信号完全淹没在噪声之中,其中1/f分形噪声是主要的噪声.由于1/f分形噪声在小波域中展示出某些特殊性质,且小波分析兼具时-频分析与尺度分析的功能,为了有效消除1/f分形噪声,提出了一种基于小波分析与自适应阈值滤波的多尺度滤波算法.以信噪比、均方根误差作为去噪效果的定量指标,将本文算法与Donoho小波阈值滤波算法进行比较,仿真结果表明,改进的自适应阈值滤波算法优于Donoho阈值滤波算法.运用于MEMS加速度计噪声消除上科学有效.     

基于图像分割的扭曲鼻纹识别模型仿真

鼻纹特征是当前最新研究的生物识别特征,对身份的鉴定有着重要的意义.鼻子的纹路较细小,只有在挤压过程中,才能留下纹理特征.但是,挤压过程本身对特征就形成了一定的破坏,使得特征扭曲变形,无法形成完整特征.传统的生物识别方法多是依靠完整生物特征,在鼻纹特征残缺或者挤压造成特征形变的情况下,虽然能识别出特征,但是对应过程会产生大量的干扰,造成假识别,漏识别的问题.提出采用鼻纹图像小区域分割的扭曲识别方法.针对扭曲鼻纹图像进行矩阵重组,根据重组结果进行分割,完成扭曲鼻纹图像的分类,利用自适应迭代出不同区域的识别阀值,设定识别过程中的最优阀值,最终完成扭曲鼻纹图像的识别.仿真结果表明,利用改进算法进行扭曲鼻纹图像识别,能够有效提高识别的准确率.     

改善的支持向量机图像分割分类器构造

构造分类器是图像分割中重要的处理环节,论文将先验知识引入支持向量机,对支持向量机做了改善,在改善的支持向量机基础上构造实现了一个分类器,重点是将为了检验分类器的有效性,通过对UCI机器学习数据库的数据进行的实验,实验结果表明改善的支持向量机分类准确率比支传统持向量机的准确率高。     

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

本文以中国科学院计算机网络信息中心超级计算中心（以下简称超级计算中心）客户服务工作为研究对象,运用 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.