基于组合K近邻与矩阵变换的虹膜识别

研究人眼虹膜识别问题,因实际虹膜内边界并不是标准圆,引起识别精度差,影响有效的特征提取.传统利用圆模板定位的算法存在瞳孔遗留或纹理损失且定位时间长等问题,为提高虹膜定位精度,降低识别时间,提出了一种新的虹膜识别算法.首先对图像进行去除光斑等预处理,将含有虹膜图像的圆环变换为极坐标系下的矩形,在矩形坐标上以点、线检测确定虹膜轮廓,并对EMD提取纹理分布特征,根据比对距离寻找每个待测样本的K个近邻,以简单投票决策输出识别结果.基于CASIA虹膜图像库进行仿真,结果表明,识别率高达99％,并明显降低了识别时间,使虹膜定位可有效提升识别精度.     

基于加权投票K—近邻法的生物医学缩略语消歧

生物医学文献信息抽取对充分挖掘利用生物医学领域取得的重要成果,促进生物医学的进一步发展具有重要意义。本文针对生物医学缩略语的分析理解问题,提出了基于加权投票K—近邻法的生物医学缩略语消歧算法。该算法基于“One Sense Per Discourse”假设自动生成带类标实例数据,消歧特征选用能表达文本主题的全局特征词,分类算法采用加权投票K—近邻法。在包含177 762篇Medline摘要的真实语料上进行的实验表明,本文所提出的算法明显优于相关工作中的算法。此外,实验还表明,对于缩略语消歧,加权投票K—近邻法与经典K—近邻法相比,不但具有高的预测准确率,而且性能更加稳定。     

基于动态加权的粗糙子空间集成

提出一种基于动态加权的粗糙子空间集成方法EROS-DW。利用粗糙集属性约简方法获得多个特征约简子集,并据此训练基分类器。在分类阶段,根据给定待测样本的具体特征动态地为每个基分类器指派相应的权重,采用加权投票组合规则集成各分类器的输出结果。利用UCI标准数据集对该方法的性能进行测试。实验结果表明,相较于经典的集成方法,EROS-DW方法可以获得更高的分类准确率。     

基于KNN的特征自适应加权自然图像分类研究

针对自然图像类型广泛、结构复杂、分类精度不高的实际问题, 提出了一种为自然图像不同特征自动加权值的K-近邻（K-nearest neighbors, KNN）分类方法。通过分析自然图像的不同特征对于分类结果的影响, 采用基因遗传算法求得一组最优分类权值向量解, 利用该最优权值对自然图像纹理和颜色两个特征分别进行加权, 最后用自适应加权K-近邻算法实现对自然图像的分类。实验结果表明, 在用户给定分类精度需求和低时间复杂度的约束下, 算法能快速、高精度地进行自然图像分类。提出的自适应加权K-近邻分类方法对于门类繁多的自然图像具有普遍适用性, 可以有效地提高自然图像的分类性能。     

用于支持向量机拒识区域的加权k近邻法

为解决1-v-r和1-v-1支持向量机中存在的拒识区域问题,提出一种加权k近邻法。该方法计算落入拒识区域中的样本,即拒识样本到所有训练样本的距离,选择最近的k个样本为拒识样本的类别投票,并根据距离大小进行加权,得票多的类即拒识样本的所属类。实验结果表明,加权k近邻法实现了零拒识,提高了传统多分类支持向量机的分类性能。     

基于Gabor滤波的改进虹膜识别算法

为提高虹膜识别系统的性能,提出了基于Gabor滤波的改进虹膜识别方法。首先根据虹膜图像的灰度特性进行虹膜定位与归一化,然后利用多尺度Gabor滤波器进行特征提取,然后通过主成分分析法降维,并进行识别,根据识别能力的差异,计算滤波器的输出权值,最后利用加权后的距离进行虹膜识别。利用该方法对CASIA虹膜库进行识别,得到系统识别率为99.78%,等错率为0.19%。结果表明,利用改进的方法能充分发挥滤波器的识别性能,并增强系统的鲁棒性。     

基于Relief的特征加权壳近邻分类算法

壳近邻分类算法克服了k近邻分类在近邻选择上可能存在偏好的问题,使得在大数据集上的分类效果优于k近邻分类,为了进一步提高壳近邻算法的分类性能,提出了基于Relief特征加权的壳近邻分类算法.该算法在Relief算法的基础上求解训练集的特征权值,并利用特征权值来改进算法的距离度量方法和投票机制.实验结果表明,该算法在小数据和大数据上的分类性能都优于k近邻和壳近邻分类算法.     

结合多特征和跨连通道加权的面部表情识别

面部表情是人类表达情感的主要方式.本文提出一种将手工特征和深度学习特征相结合,以跨连通道加权模块为基础的面部表情识别方法.将灰度图、局部二值模式特征、Sobel特征作为三通道特征输入,以深度可分离卷积代替标准卷积;同时引入跨连通道加权模块,通过建模不同通道特征之间的关系,更加高效地进行不同层次特征的融合.本文方法在CK+和JAFFE两个常用表情数据集上进行了验证,取得了高达99.77%和99.48%的准确率,证明了本文方法的有效性与可行性.     

基于K近邻的众包数据分类算法

针对众包数据处理中的质量控制问题,提出了一种加权K近邻投票分类方法。该方法不单单只是考虑了某个样例的标记来返回一个答案,而是通过综合考虑样例的近邻来得到更加准确的答案。同时对样例的近邻加以适当的权重来进一步提高算法的性能,并保持了传统多数投票分类的简单性。K近邻投票分类算法可以有效地解决缺乏标记的情况,通过对近邻加以权重可以解决不平衡标记造成的影响,从而使算法的泛化性更强。通过各种场景下的实验,结果表明加权K近邻投票分类方法取得了很好的效果。     

基于K近邻加权的混合C均值聚类算法

该文提出了一种基于K近邻加权的混合C均值聚类算法。首先该文利用模糊C均值聚类和可能性C均值聚类的优点,设计出一种混合C均值聚类算法。然后以K近邻规则为基础,计算出样本集的加权矩阵,最后得到基于K近邻加权的混合C均值聚类算法。由于该算法考虑到了不同样本点对分类的影响程度,对较复杂的样本集合,能明显提高分类的正确性和鲁棒性。     

Weighted Picture Automata and Weighted Logics

We investigate formal power series on pictures. These are functions that map pictures to elements of a semiring and provide an extension of two-dimensional languages to a quantitative setting. We establish a notion of a weighted MSO logics over pictures. The semantics of a weighted formula will be a picture series. We introduce weighted 2-dimensional on-line tessellation automata (W2OTA) and prove that for commutative semirings, the class of picture series defined by sentences of the weighted logics coincides with the family of picture series that are computable by W2OTA. Moreover, we show that the family of behaviors of W2OTA coincide precisely with the class of picture series characterized by weighted (quadrapolic) picture automata and consequently, the notion of weighted recognizability presented here is robust. However, the weighted structures can not be used to get better decidability properties than in the language case. For every commutative semiring, it is undecidable whether a given MSO formula has restricted structure or whether the semantics of a formula has empty support.     

Weighted Fuzzy Interpolative Reasoning Based on Weighted Increment Transformation and Weighted Ratio Transformation Techniques

In this paper, we present a new weighted fuzzy interpolative reasoning method for sparse fuzzy rule-based systems. The proposed method uses weighted increment transformation and weighted ratio transformation techniques to handle weighted fuzzy interpolative reasoning in sparse fuzzy rule-based systems. It allows each variable that appears in the antecedent parts of fuzzy rules to associate with a weight between zero and one. Moreover, we also propose an algorithm that automatically tunes the optimal weights of the antecedent variables appearing in the antecedent parts of fuzzy rules. We also apply the proposed weighted fuzzy interpolative reasoning method to handle the truck backer-upper control problem. The proposed weighted fuzzy interpolative reasoning method performs better than the ones obtained by the traditional fuzzy inference system (2000), Huang and Shen's method (2008), and Chen and Ko's method (2008). The proposed method provides us with a useful way to deal with weighted fuzzy interpolative reasoning in sparse fuzzy rule-based systems.      

Locally Weighted Learning

This paper surveys locally weighted learning, a form of lazy learning and memory-based learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, assessing predictions, handling noisy data and outliers, improving the quality of predictions by tuning fit parameters, interference between old and new data, implementing locally weighted learning efficiently, and applications of locally weighted learning. A companion paper surveys how locally weighted learning can be used in robot learning and control.     

Weighted ordinal means

The concept of weighted ordinal arithmetic means and other related weighted ordinal means is studied. Based on the relevant results on the scale [0, 1], new types of weighted ordinal means are proposed. In some cases these ordinal means coincide with those proposed by Godo and Torra, but not in the case when ordinal means introduced by them are not idempotent. Based on divisible ordinal t-conorms and modifying the approach of Godo and Torra, we show how the previously introduced weighted ordinal means can be obtained without exploiting the formal similarity of the structure of continuous t-conorms on [0, 1] and divisible ordinal t-conorms.     

特征加权的CLSVSM

运用空间向量对文本信息进行合理且有效的表示对文本聚类以及检索的结果有较大影响。共现潜在语义向量空间模型（CLSVSM）深度挖掘了文本特征词之间的共现潜在语义信息并且提升了文本聚类的性能。本文在CLSVSM基础上先引入特征词词频信息,再将引入的词频作为权重赋予CLSVSM的共现强度,最终构建特征加权的CLSVSM。特征加权的CLSVSM在中文数据上的聚类效果如下：在F值方面,相比CLSVSM和Word2vec文本模型分别提高将近2.4%、5.2%,在熵值上相比90%CLSVSM_K和Word2vec文本模型分别降低了将近3.1%、9.0%,相比词频CLSVSM和TF-IDF模型在聚类效果上都有所提高。在英文数据上聚类效果也与其他模型相当。特征加权的CLSVSM的稳定性有待提高,受限于关键词词频信息表达完整程度。     

加权Catmull-Clark曲面

文中给出一种加权的 Catm ull- Clark剖分方法 .算法首先对初始多边形网格作一次不同于 Catmull- Clark方法的带权因子的剖分 ,再对生成网格实施 Catmull- Clark剖分 ,从而得到可控形状的 C1光滑曲面 .通过对第 1步中的权因子赋不同的值 ,能方便地控制生成曲面与其原始控制网格的逼近精度 .实验表明 ,本算法非常简洁 ,比传统 Catm ull- Clark方法具有更多的自由度 .     

Weighted multi-model control

A multi-model control which combines the basic controls of the different models, according to the quality of representation of each model, is proposed. A real-time application of this technique to a non-linear thermal process is carried out and the results are given compared to the results of the same application of the other technique where one model only is selected, under the same conditions. This comparison shows the advantages of the combined control signal.     

Methods for Computing Weighted Pseudoinverses and Weighted Normal Pseudosolutions with Singular Weights

The paper surveys articles that construct and investigate direct and iterative methods for computing weighted pseudoinverses and weighted normal pseudosolutions with singular weights. The methods considered in the paper are mainly constructed based on the authors’ articles devoted to the development of the theory of weighted pseudoinversion aimed at investigating the characteristics of both weighted pseudoinverses and weighted normal pseudosolutions with singular weights. The paper uses the following results obtained and investigated by the authors: expansions of weighted pseudoinverses into matrix power series and products, limit representations of such matrices, and determination of decompositions of weighted pseudoinverses based on weighted singular value decompositions of matrices with singular weights.     

加权多步预报控制

本文提出了一类加权多步预报控制(WLPC)算法.这种算法是由极小化一个很一般的 加权二次型性能指标得到的.由于权因子可以根据闭环极点配置、前馈零点增补和动态性能 要求任意选取,所以可保证闭环系统的稳定性和对建模误差的鲁棒性.文中给出了这方面结 果的理论证明和仿真实例.     

加权门限秘密共享

提出了一种基于模运算的加权的门限秘密共享方案,当参与者的权重之和大于等于门限值时可以恢复秘密,而小于门限值时则不能.目前仅有的关于加权秘密共享方案都是基于分解结构的,其缺点是参与者需要掌握多个子秘密,并且各个子秘密使用场合不相同,管理和使用不太方便.方案中每个参与者只需要保存一个子秘密,简化了密钥管理与使用.该方案适用于强调管理方便性的环境.在某些情况下,还可以调整权重和门限参数来减小问题的规模,但达到的效果跟原来的系统一致,为此,提出了控制结构的等价性的概念,并提出了一种基于整数规划的参数调整算法.