一种广义的主成分分析特征提取方法

提出了一种广义的PCA特征提取方法。该方法先将图像矩阵进行重组,根据重组的图像矩阵构造出总体散布矩阵,然后求出最佳投影向量进行特征提取。它是2DPCA和模块2DPCA的进一步推广,可以建立任意维数的散布矩阵,得到任意维数的投影向量。实验表明,随着总体散布矩阵维数的减小,广义PCA的特征提取能力更强,特征提取的速度也更快。     

基于图像分块的二维投影特征提取能力研究

人脸识别研究的主要目的是提高识别率,关键技术在于提取有效的人脸特征。提出了分块多投影和分块双向多投影二维特征提取方法。分块多投影特征提取方法,针对现有分块单投影特征提取方法中每一子图均采用相同投影矩阵,而对人脸局部信息不加以区别,利用二维主成分分析方法,构造了分块多投影矩阵,使不同的子图投影到不同的子空间,与传统二维主成分方法和分块单投影方法相比,有效地利用人脸局部信息,降低了特征维数,提高了识别率,在ORL人脸库上实验表明了其有效性。     

组合2DFLDA监督的非负矩阵分解和独立分量分析的特征提取方法*

通过对投影非负矩阵分解(NMF)和二维Fisher线性判别的分析,针对NMF的特征提取存在无监督学习以及特征维数高的问题,提出了组合2DFLDA监督的非负矩阵分解和独立分量分析(SPGNMFICA)的特征提取方法。首先对样本进行投影梯度的非负矩阵分解,将得到的NMF子图像进行二维Fisher线性判别,主要反映类间差异信息构建子空间;对子空间的向量进行独立分量分析(ICA),得到独立分量特征空间;其次将样本在独立分量特征空间上进行投影;最后使用径向基网络对投影系数进行识别。通用人脸库ORL和YALE的识别实验证明,该算法是一种有效的特征提取和识别方法。     

一种基于图的人脸特征提取方法

当前主流特征提取方法主要从全局特征或局部特征出发实现降维。为了能充分反映样本的全局特征和局部特征,提出基于图的人脸特征提取方法。该方法首先通过对训练样本进行学习得到最佳投影方向,该方向保证投影后的样本类内紧密而类间松散;然后将测试样本映射到最佳投影方向上并利用最近邻分类器进行样本类属判定。标准人脸库上的比较实验结果证明了所提方法的有效性。     

基于改进的保局投影视频特征提取

提出一种视频镜头特征提取方法。针对保局投影变换要预先指定降维后的维数和近邻参数K,根据降维前后的结构误差提出确定最佳降维维数的方法,结合各个数据点邻域的统计特征实现近邻参数K的动态选择。在此基础上,将多个视频镜头的高维特征投影到低维空间获得最佳投影矩阵,新的视频特征根据此投影矩阵进行降维处理。对比实验结果表明,通过保局投影变换提取出来的特征比其它特征更加有利于视频的镜头分割。     

从Parzen窗核密度估计到特征提取方法:新的研究视角

当前主流特征提取方法大致有2种研究思路:1)从高维数据的几何性质出发,根据某种寻优准则得到基于原始空间特征的一组特征数更少的新特征;2)从降维误差角度出发,保证降维前后数据所呈现的某种偏差达到最小.试图从降维过程中数据分布特征的变化入手,基于广泛使用的Parzen窗核密度估计方法,来审视和揭示Parzen窗估计与典型特征提取方法 LPP、LDA和PCA之间的关系,从而说明这些特征提取方法可统一在Parzen窗框架下进行研究,为特征提取方法的研究提供了一个新的视角.     

基于投影归一化的字符特征提取方法

提出了一种基于投影归一化的字符特征提取方法,该方法首先对字符图像进行横向扫描和纵向扫描生成行投影向量和列投影向量,然后通过对行投影向量和列投影向量进行维数和密度的归一化处理生成双投影归一化向量作为特征向量。聚类和识别实验表明双投影归一化向量不仅计算简单,而且对同种字体不同字号的英文字符识别可达到较好的结果。     

基于大间距准则和图像矩阵双向投影的人脸特征提取方法

传统基于降维技术的人脸特征提取需要将图像转换成更高维的向量, 从而加剧维数灾难问题, 对于采用Fisher优化准则的特征提取, 这也会使小样本问题更加突出. 基于图像的矩阵表示, 本文提出了一种新的基于大间距准则和矩阵双向投影技术的人脸特征提取方法(Maximum margin criterion and image matrix bidirectional projection, MMC-MBP). 该方法一方面在计算散度矩阵时引入了能保持数据局部性的Laplacian矩阵, 以保持数据的流形结构, 从而提高识别正确率; 另一方面采用了有效且稳定的大间距的优化准则即最大化矩阵迹差, 能克服利用Fisher准则所带来的小样本问题; 更重要的, MMC-MBP方法给出了求解最优双向投影矩阵的迭代计算过程, 该迭代求解过程能保证目标函数的单调递增性、收敛性以及投影矩阵的收敛性, 从而成功解决了传统基于张量(矩阵)投影技术的特征提取方法特征维数过高或者无收敛解的问题. 最后广泛而系统的人脸识别实验表明, MMC-MBP的迭代求解过程能很快收敛, 且相比Eigenfaces, Fisherfaces, Laplacianfaces等脸识别方法, 具有更高的识别正确率, 是一种有效的人脸特征提取方法.     

基于局部相似性的视频镜头分割*

为了进一步提高视频镜头的分割精度,提出了一种基于局部相似性的视频镜头分割方法。首先为了有效地进行视频特征降维,提出了改进的保局投影算法,利用仿射传播聚类算法得到具有相同模式的相似样本,根据相似样本构建连接矩阵,并根据降维前后模式的相关系数确定最佳降维维数,该算法有效地保留了数据的局部分布信息;然后利用具有相同模式的相似样本构建局部支持向量机检测镜头边界。实验结果表明,该方法利用样本的局部相似性特点,在视频特征提取和镜头边界检测两个阶段提高了镜头分割精度。     

基于核方法与流形学习的运动想象脑电信号特征提取算法

针对脑电信号的非线性特点及传统的特征提取方法存在忽略特征信号空间和邻域结构信息的问题,提出一种核-双向二维判别局部保留投影特征提取算法。首先采用滤波器组共空间模式算法获得频-空特征集,再使用核-双向二维判别局部保留投影算法进行特征提取,最后使用支持向量机进行分类。实验通过k折交叉验证评估算法的性能。在两个四分类运动想象竞赛数据集上分别获得了平均76.11%、74.54%和最高88.33%、87.14%的准确率。实验结果表明该方法打破了线性方法的局限性,有效地克服了传统提取方法空间信息描述不足的问题,更好地获取了非线性特征空间的补充信息,提供了更高精度的样本近似特征。     

Supervised optimal locality preserving projection

In the past few years, the computer vision and pattern recognition community has witnessed a rapid growth of a new kind of feature extraction method, the manifold learning methods, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure. Among these methods, locality preserving projection (LPP) is one of the most promising feature extraction techniques. Unlike the unsupervised learning scheme of LPP, this paper follows the supervised learning scheme, i.e. it uses both local information and class information to model the similarity of the data. Based on novel similarity, we propose two feature extraction algorithms, supervised optimal locality preserving projection (SOLPP) and normalized Laplacian-based supervised optimal locality preserving projection (NL-SOLPP). Optimal here means that the extracted features via SOLPP (or NL-SOLPP) are statistically uncorrelated and orthogonal. We compare the proposed SOLPP and NL-SOLPP with LPP, orthogonal locality preserving projection (OLPP) and uncorrelated locality preserving projection (ULPP) on publicly available data sets. Experimental results show that the proposed SOLPP and NL-SOLPP achieve much higher recognition accuracy.     

Local structure based supervised feature extraction

In the past few years, the computer vision and pattern recognition community has witnessed the rapid growth of a new kind of feature extraction method, the manifold learning methods, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure. Among them, locality preserving projection (LPP) is one of the most promising feature extraction techniques. However, when LPP is applied to the classification tasks, it shows some limitations, such as the ignorance of the label information. In this paper, we propose a novel feature extraction method, called locally discriminating projection (LDP). LDP utilizes class information to guide the procedure of feature extraction. In LDP, the local structure of the original data is constructed according to a certain kind of similarity between data points, which takes special consideration of both the local information and the class information. The similarity has several good properties which help to discover the true intrinsic structure of the data, and make LDP a robust technique for the classification tasks. We compare the proposed LDP approach with LPP, as well as other feature extraction methods, such as PCA and LDA, on the public available data sets, FERET and AR. Experimental results suggest that LDP provides a better representation of the class information and achieves much higher recognition accuracies.     

Kernel class-wise locality preserving projection

In the recent years, the pattern recognition community paid more attention to a new kind of feature extraction method, the manifold learning methods, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure. Among them, locality preserving projection (LPP) is one of the most promising feature extraction techniques. However, when LPP is applied to the classification tasks, it shows some limitations, such as the ignorance of the label information. In this paper, we propose a novel local structure based feature extraction method, called class-wise locality preserving projection (CLPP). CLPP utilizes class information to guide the procedure of feature extraction. In CLPP, the local structure of the original data is constructed according to a certain kind of similarity between data points, which takes special consideration of both the local information and the class information. The kernelized (nonlinear) counterpart of this linear feature extractor is also established in the paper. Moreover, a kernel version of CLPP namely Kernel CLPP (KCLPP) is developed through applying the kernel trick to CLPP to increase its performance on nonlinear feature extraction. Experiments on ORL face database and YALE face database are performed to test and evaluate the proposed algorithm.     

Supervised Discriminant Projection with Its Application to Face Recognition

In the past few decades, many face recognition methods have been developed. Among these methods, subspace analysis is an effective approach for face recognition. Unsupervised discriminant projection (UDP) finds an embedding subspace that preserves local structure information, and uncovers and separates embedding corresponding to different manifolds. Though UDP has been applied in many fields, it has limits to solve the classification tasks, such as the ignorance of the class information. Thus, a novel subspace method, called supervised discriminant projection (SDP), is proposed for face recognition in this paper. In our method, the class information was utilized in the procedure of feature extraction. In SDP, the local structure of the original data is constructed according to a certain kind of similarity between data points, which takes special consideration of both the local information and class information. We test the performance of the proposed method SDP on three popular face image databases (i.e. AR database, Yale database, and a subset of FERET database). Experimental results show that the proposed method is effective.     

基于l2,0范数稀疏性和模糊相似性的图优化无监督组特征选择方法

基于图的无监督特征选择方法大多选择投影矩阵的l_2,1范数稀疏正则化代替非凸的l_2,0范数约束,然而l_2,1范数正则化方法根据得分高低逐个选择特征,未考虑特征的相关性.因此,文中提出基于l_2,0范数稀疏性和模糊相似性的图优化无监督组特征选择方法,同时进行图学习和特征选择.在图学习中,学习具有精确连通分量的相似性矩阵.在特征选择过程中,约束投影矩阵的非零行个数,实现组特征选择.为了解决非凸的l_2,0范数约束,引入元素为0或1的特征选择向量,将l_2,0范数约束问题转化为0-1整数规划问题,并将离散的0-1整数约束转化为2个连续约束进行求解.最后,引入模糊相似性因子,拓展文中方法,学习更精确的图结构.在真实数据集上的实验表明文中方法的有效性.     

基于SR-树的空间对象最近邻查询

最近邻查询是空间数据库的重要应用之一,最近邻查询概念的扩展,即时象的相似性查询中,利用以往的定位查询以厦范围查询方法不能很好的解决最近邻查询的问题,在分析NN查询的基本概念和存储区域的基础上,提出区别于以往NN查询的基于SR-树的多时象NN查询方法,根据某几个查询点,找出离它们最近的一个点或者是七个点,在某种意义上是寻求一种最优方案。     

基于空间关系的图像检索方法研究

对基于空间关系的图像检索方法进行了全面的论述,提出了图像对象空间关系的形式化描述,通过邻近和邻近距阵以及数学期望和均方差,给出了一种在图像进行投影变换和旋转变换中保持不变的图像相似匹配算法,并为图像数据库检索提供了有力的支持。     

Projection and bidirectional projection measures of single-valued neutrosophic sets and their decision-making method for mechanical design schemes

Abstract

Projection measure is one of important tools for handling decision-making problems. First, the paper proposes projection and bidirectional projection measures between single-valued neutrosophic sets, and then the comparison of numerical examples shows that the bidirectional projection measure is superior to the general projection measure in measuring closeness degree between two vectors. Next, we develop their decision-making method for selecting mechanical design schemes under a single-valued neutrosophic environment. Through the projection measure or bidirectional projection measure between each alternative and the ideal alternative with single-valued neutrosophic information, all the alternatives can be ranked and the best one can be selected as well. Finally, the proposed decision-making method is applied to the selection of design schemes of punching machine and its effectiveness and advantages are demonstrated by comparison with relative methods.     

基于Top-k映射的本体匹配方法

针对本体之间的异构问题,提出一种基于Top-k映射的本体匹配方法。该方法是对现有匹配方法的一种扩展,它以相似度计算为基础,从元素级和结构级计算2个概念之间的相似度,并在匹配过程中同时产生k个映射而不是一个最佳映射。实验结果表明,该算法在查全率和查准率方面都有很好的表现,并且其查准率要优于GLUE方法。     

基于信息熵和几何轮廓相似度的多变量决策树

现有的多变量决策树在分类准确性与树结构复杂性两方面优于单变量决策树,但其训练时间却高于单变量决策树,使得现有的多变量决策树不适用于快速响应的分类任务.针对现有多变量决策树训练时间高的问题,提出了基于信息熵和几何轮廓相似度的多变量决策树(IEMDT).该算法利用几何轮廓相似度函数的一对一映射特性,将n维空间样本点投影到一维空间的数轴上,进而形成有序的投影点集合,然后通过类别边界和信息增益计算最优分割点集将有序投影点集合划分为多个子集,接着分别对每个子集继续投影分割,最终生成决策树.在8个数据集上的实验结果表明：IEMDT具有较低的训练时间,并且具有较高的分类准确性.