一种基于像素梯度信息的背景减除法

讨论了背景模型的更新参数与模型精度的关系。通过精确的梯度背景模型值间接估计当前帧中背景像素理论上的期望梯度值。以高斯模型为基础,将当前帧背景像素的实际梯度值与其理论上的期望值进行比较,计算偏差概率,以此为基础,形成不依赖于局部纹理的梯度特征的相似性度量方法。再用梯度特征的相似度量化地调整差分图像在各像素点处的二值化阈值,实现像素值信息与梯度信息的融合使用。实验表明,本方法对前景分割有一定的改善效果。     

Comparing interpolation techniques for monthly rainfall mapping using multiple evaluation criteria and auxiliary data sources: A case study of Sri Lanka

Interpolating climatic variables such as rainfall is challenging due to the highly variable nature of meteorological processes, the effects of terrain and geography, and the difficulty in establishing a representative network of stations. While interpolation models are being adapted to include these effects, often the rainfall data contain significant gaps in coverage. In this paper, we evaluated rainfall data from an agro-ecological monitoring network for producing maps of total monthly rainfall in Sri Lanka. We compared four spatial interpolation techniques: inverse distance weighting, thin-plate splines, ordinary kriging, and Bayesian kriging. Error metrics were used to validate interpolations against independent data. Satellite data were used to assess the spatial pattern of rainfall. Results indicated that Bayesian kriging and splines performed best in low and high rainfall, respectively. Rainfall maps generated from the agro-ecological network were found to have accuracies consistent with previous studies in Sri Lanka.     

Kinematic configuration analysis of planar mechanisms based on basic kinematic chains

According to the single-link transformation principle, and based on the topological characteristic investigations to planar closed kinematic chains (PCKCs), a general study of the kinematic configuration analysis of planar mechanisms with R-pairs is conducted in this paper. Firstly, two new concepts, contract link distance sequence and basic link group code sequence, are defined, and a novel approach for identification of multi-bar basic kinematic chains (BKCs) within the kinematic chain left from the single-link transformation is proposed. Then, another two concepts, weight code and similarity code, are defined for aid to link similarity judgment and two judgment theorems are proposed as well. As a further step, weight code or similarity code of the transformed single-link will be employed for kinematic configuration analysis situation judgment. Finally, corresponding unified constraint equations are set up and solved with coefficient homotopy method, on the basis of aforementioned analysis results. The study shows that the method is reliable and effective, and it is especially applicable for the kinematic configuration analysis problem of PCKCs with multi-bars and multi-freedoms.     

一种基于聚类集成技术的混合型数据聚类算法

提出了一种基于集成技术和谱聚类技术的混合数据聚类算法CBEST。它利用聚类集成技术产生混合数据间的相似性,这种相似性度量没有对数据特征值分布模型做任何的假设。基于此相似性度量得到的待聚类数据的相似性矩阵,应用谱聚类算法得到混合数据聚类结果。大量真实和人工数据上的实验结果验证了CBEST的有效性和它对噪声的鲁棒性。与其它混合数据聚类算法的比较研究也证明了CBEST的优越性能。CBEST还能有效融合先验知识,通过参数的调节来设置不同属性在聚类中的权重。     

一种结合共同邻居和用户评分信息的相似度算法

随着互联网的发展,推荐系统逐步得到广泛应用,协同过滤(CF)是其中运用得最早.最成功的技术之一.CF首先根据用户间的相似度,找出每个用户的近邻;然后根据目标用户近邻的评分预测目标用户的评分;最后把预测评分较高的项目推荐给目标用户.因此相似度计算方法直接关系到预测结果的准确性,对推荐起着至关重要的作用.目前,学者们已从不同的角度提出了各种各样的相似度计算方法,其中共同邻居算法(common-neighbors)是一种简单有效的方法.但此法仅考虑了两用户间的共同邻居数,忽略了用户的具体评分信息.针对这个问题对共同邻居算法进行了改进,同时考虑了共同邻居数和用户的评分信息.实验结果表明,改进的共同邻居算法在一定程度上可提高评分预测的准确性.     

高维数据的相似性度量研究

数据间的相似性度量是进一步分析数据集整体特性的一个重要基础。针对高维数据的相似性度量问题,提出了一种基于子空间的相似性度量方法。该方法先将高维空间进行基于网格的划分,然后在划分后的子空间内计算数据间的相似性。理论分析表明,在合理选定网格划分参数的前提下,该方法可有效减小维度灾难对高维数据相似性度量的影响。     

一种基于视觉特征的形状渐变算法

基于建立两个平面形状特征点之间的对应关系的问题上,提出一种新的解决方法。这种方法是把特征点从源形状和目标形状中抽取出来,根据此方法来衡量两个特征点之间相似度,采用有效的动态编程的方法找出特征点之间的最优化的对应关系来解决问题。该算法简洁、快速,并有效地保留原始形体上的特征属性。     

基于视觉面距离的三维模型检索

研究计算机视觉图像优化问题,针对目前三维模型检索较低的的检索精度,为改善检索结果与人视觉上保持一致,减少计算量,提出一种新的基于视觉面距离的模型检索算法。利用模型的整体特征;根据表层视觉特性构建视觉面距离模型将三维模型映射到二维模型;由于二维傅立叶算法不仅对噪音具有很好的鲁棒性,而且对几何变换具有不变性。采用二维傅立叶变换提取二维模型特征向量对特征进行融合,从而有效地评估三维模型之间的相似度。进行仿真分析,仿真结果表明,改进方法较传统其他三维模型检索有更高的精度,并与人视觉的一致性。     

Dominance-based rough set approach and knowledge reductions in incomplete ordered information system

Many methods based on the rough set to deal with incomplete information systems have been proposed in recent years. However, they are only suitable for the incomplete systems with regular attributes whose domains are not preference-ordered. This paper thus attempts to present research focusing on a complex incomplete information system—the incomplete ordered information system. In such incomplete information systems, all attributes are considered as criterions. A criterion indicates an attribute with preference-ordered domain. To conduct classification analysis in the incomplete ordered information system, the concept of similarity dominance relation is first proposed. Two types of knowledge reductions are then formed for preserving two different notions of similarity dominance relations. With introduction of the approximate distribution reduct into the incomplete ordered decision system, the judgment theorems and discernibility matrixes associated with four novel approximate distribution reducts are obtained. A numerical example is employed to substantiate the conceptual arguments.