K nearest neighbor reinforced expectation maximization method

K nearest neighbor and Bayesian methods are effective methods of machine learning. Expectation maximization is an effective Bayesian classifier. In this work a data elimination approach is proposed to improve data clustering. The proposed method is based on hybridization of k nearest neighbor and expectation maximization algorithms. The k nearest neighbor algorithm is considered as the preprocessor for expectation maximization algorithm to reduce the amount of training data making it difficult to learn. The suggested method is tested on well-known machine learning data sets iris, wine, breast cancer, glass and yeast. Simulations are done in MATLAB environment and performance results are concluded.     

From classifiers to discriminators: A nearest neighbor rule induced discriminant analysis

The current discriminant analysis method design is generally independent of classifiers, thus the connection between discriminant analysis methods and classifiers is loose. This paper provides a way to design discriminant analysis methods that are bound with classifiers. We begin with a local mean based nearest neighbor (LM-NN) classifier and use its decision rule to supervise the design of a discriminator. Therefore, the derived discriminator, called local mean based nearest neighbor discriminant analysis (LM-NNDA), matches the LM-NN classifier optimally in theory. In contrast to that LM-NNDA is a NN classifier induced discriminant analysis method, we further show that the classical Fisher linear discriminant analysis (FLDA) is a minimum distance classifier (i.e. nearest Class-mean classifier) induced discriminant analysis method. The proposed LM-NNDA method is evaluated using the CENPARMI handwritten numeral database, the NUST603 handwritten Chinese character database, the ETH80 object category database and the FERET face image database. The experimental results demonstrate the performance advantage of LM-NNDA over other feature extraction methods with respect to the LM-NN (or NN) classifier.     

基于余类零空间与最近距离的人脸识别算法

提出了一种新的人脸识别算法,即基于余类零空间与最近距离的人脸识别算法. 通过构建不同类别的人脸图像的余类零空间与子空间,可以将不同类别的人脸最大化地区别出来. 本算法的主要思想在于：测试图像与所属类别图像的子空间之间的距离最小,而与所属类别的图像的余类零空间距离最大. 本算法基于ORL数据集与AR数据集进行了测试. 从这些人脸数据集上的测试结果可以看出,本文提出的算法在PCA降维方法的基础上,比一些常见的算法所使用的判别方式更有效,如最近邻分类器（NN）所使用的最近距离判别方式、最近空间分类器（NS）所使用的最近空间距离判别方式、最近最远子空间分类器（NFS）所使用的最近最远空间距离判别方式等.     

面向存在不确定对象的组最近邻查询方法

组最近邻查询是空间对象查询领域的一类重要查询,通过该查询可找到距离给定查询点集最近的空间对象.由于图像分辨率或解析度的限制等因素,空间对象的存在不确定性广泛存在于某些涉及图像处理的查询应用中.这些对象位置数据的存在不确定性会对组最近邻查询结果产生影响.本文给出面向存在不确定对象的概率阈值组最近邻查询定义,设计了高效的查询处理机制,通过剪枝优化等手段提高概率阈值组最近邻查询效率,并进一步提出了高效概率阈值组最近邻查询算法.采用多个真实数据集对概率阈值组最近邻算法进行了实验验证,结果表明所提算法具有良好的查询效率.     

采用动态HMM概率分布模型的人眼精确定位

从含有复杂背景的单幅灰度图像中精确定位人眼仍是一个尚未完全解决的复杂问题.为了对图像中的人眼进行精确定位,提出了一种基于动态HMM概率分布模型的人眼精确定位方法,该方法采用了含状态持续时间的动态观测符号概率分布HMM模型,首先用虹膜网格采样方式和特殊的特征提取办法来抽取观测序列;然后通过对观测序列进行评估来控制采样网格大小,并动态修正观测符号概率分布.这样无需对图像进行旋转、缩放和匹配运算,即可对图像中的人眼进行精确定位.实验结果表明,该方法检测效率较高、算法鲁棒,并具有较高的定位精度.     

Optimal linear representations of images for object recognition

Although linear representations are frequently used in image analysis, their performances are seldom optimal in specific applications. This paper proposes a stochastic gradient algorithm for finding optimal linear representations of images for use in appearance-based object recognition. Using the nearest neighbor classifier, a recognition performance function is specified and linear representations that maximize this performance are sought. For solving this optimization problem on a Grassmann manifold, a stochastic gradient algorithm utilizing intrinsic flows is introduced. Several experimental results are presented to demonstrate this algorithm.     

基于多稀疏分布特征和最近邻分类的物体识别方法

摘 要: 为提高物体识别性能,提出了一种基于多稀疏分布特征和最近邻分类的目标识别方法。首先,提取图像的梯度模值和方向特征,构建梯度模值和方向图像;然后,分别对灰度图像、梯度模值图像和梯度方向图像进行稀疏表示,提取稀疏分布特征,得到融合后的多稀疏分布特征;最后,依据最近邻分类方法进行特征分类,实现物体识别。通过在国际公认的COIL-100和PVOC-2007两个公共测试数据集下进行对比实验,对本文方法的参数选择、鲁棒性和识别性能进行综合评价。实验结果表明,采用本文方法进行物体识别的识别率高于目前经典的SIFT、SURF和ORB方法,是一种有效的物体识别方法。     

A bootstrap technique for nearest neighbor classifier design

A bootstrap technique for nearest neighbor classifier design is proposed. Our primary interest in designing a classifier is in small training sample size situations. Conventional bootstrapping techniques sample the training samples with replacement. On the other hand, our technique generates bootstrap samples by locally combining original training samples. The nearest neighbor classifier is designed on the bootstrap samples and is tested on the test samples independent of training samples. The performance of the proposed classifier is demonstrated on three artificial data sets and one real data set. Experimental results show that the nearest neighbor classifier designed on the bootstrap samples outperforms the conventional k-NN classifiers as well as the edited 1-NN classifiers, particularly in high dimensions     

Optimizing similarity search for arbitrary length time series queries

We consider the problem of finding similar patterns in a time sequence. Typical applications of this problem involve large databases consisting of long time sequences of different lengths. Current time sequence search techniques work well for queries of a prespecified length, but not for arbitrary length queries. We propose a novel indexing technique that works well for arbitrary length queries. The proposed technique stores index structures at different resolutions for a given data set. We prove that this index structure is superior to existing index structures that use a single resolution. We propose a range query and nearest neighbor query technique on this index structure and prove the optimality of our index structure for these search techniques. The experimental results show that our method is 4 to 20 times faster than the current techniques, including sequential scan, for range queries and 3 times faster than sequential scan and other techniques for nearest neighbor queries. Because of the need to store information at multiple resolution levels, the storage requirement of our method could potentially be large. In the second part, we show how the index information can be compressed with minimal information loss. According to our experimental results, even after compressing the size of the index to one fifth, the total cost of our method is 3 to 15 times less than the current techniques.     

独立分量分析在模式识别中的应用

模式识别中关键的两个环节是模式的特征提取及利用分类器分类识别。采用独立分量分析进行特征提取 ,并比较了最近邻分类器和cos分类器的分类识别性能。利用ORL人脸图像数据库进行实验 ,结果表明独立分量分析与cos分类器相结合可得到更好的识别结果。     

融合WMD矩阵与2DPCA的人脸特征抽取与识别

提出了一种融合小波矩描述子(WMD)矩阵与二维主成分分析(2DPCA)的人脸特征抽取与识别算法。该方法抽取描述人脸本质特征的WMD矩阵，利用2DPCA对该矩阵进行投影压缩降维，抽取人脸最终鉴别特征，利用最近邻分类器对特征进行分类识别。NUST603人脸库上的实验结果验证了算法的有效性。     

Per-pixel vs. object-based classification of urban land cover extraction using high spatial resolution imagery

In using traditional digital classification algorithms, a researcher typically encounters serious issues in identifying urban land cover classes employing high resolution data. A normal approach is to use spectral information alone and ignore spatial information and a group of pixels that need to be considered together as an object. We used QuickBird image data over a central region in the city of Phoenix, Arizona to examine if an object-based classifier can accurately identify urban classes. To demonstrate if spectral information alone is practical in urban classification, we used spectra of the selected classes from randomly selected points to examine if they can be effectively discriminated. The overall accuracy based on spectral information alone reached only about 63.33%. We employed five different classification procedures with the object-based paradigm that separates spatially and spectrally similar pixels at different scales. The classifiers to assign land covers to segmented objects used in the study include membership functions and the nearest neighbor classifier. The object-based classifier achieved a high overall accuracy (90.40%), whereas the most commonly used decision rule, namely maximum likelihood classifier, produced a lower overall accuracy (67.60%). This study demonstrates that the object-based classifier is a significantly better approach than the classical per-pixel classifiers. Further, this study reviews application of different parameters for segmentation and classification, combined use of composite and original bands, selection of different scale levels, and choice of classifiers. Strengths and weaknesses of the object-based prototype are presented and we provide suggestions to avoid or minimize uncertainties and limitations associated with the approach.     

基于稀疏表示的低分辨率人脸疲劳表情识别

为了有效提高低分辨率图像的人脸疲劳表情识别性能,提出一种基于稀疏表示的低分辨率人脸疲劳表情的识别方法。首先,采用肯德尔和谐系数可信度分析法构建了低分辨率人脸疲劳表情图像库TIREDFACE。其次,通过图像库中的低分辨率样本疲劳表情图像进行稀疏表示,再利用压缩感知理论寻求低分辨率测试样本的最稀疏解,采用求得的最稀疏解实现低分辨率人脸疲劳表情的分类。在低分辨率人脸视觉特征的疲劳表情图像库TIREDFACE的实验测试结果表明,将该方法用于低分辨人脸疲劳表情识别,性能优于线性法、最近邻法、支持向量机以及最近邻子空间法。可见,该方法用于低分辨率人脸疲劳表情识别时识别效果较好,精确度较高。     

The nearest subclass classifier: a compromise between the nearest mean and nearest neighbor classifier

We present the Nearest Subclass Classifier (NSC), which is a classification algorithm that unifies the flexibility of the nearest neighbor classifier with the robustness of the nearest mean classifier. The algorithm is based on the Maximum Variance Cluster algorithm and, as such, it belongs to the class of prototype-based classifiers. The variance constraint parameter of the cluster algorithm serves to regularize the classifier, that is, to prevent overfitting. With a low variance constraint value, the classifier turns into the nearest neighbor classifier and, with a high variance parameter, it becomes the nearest mean classifier with the respective properties. In other words, the number of prototypes ranges from the whole training set to only one per class. In the experiments, we compared the NSC with regard to its performance and data set compression ratio to several other prototype-based methods. On several data sets, the NSC performed similarly to the k-nearest neighbor classifier, which is a well-established classifier in many domains. Also concerning storage requirements and classification speed, the NSC has favorable properties, so it gives a good compromise between classification performance and efficiency.     

基于堆叠深度卷积沙漏网络的步态识别

提出了一种基于堆叠深度卷积沙漏网络的步态识别方法。为了解决人体建模中关节点准确定位的问题，采用基于深度卷积的沙漏网络来提取步态图上的关节点坐标，并计算肘关节与膝关节的角度作为运动特征。为了解决行走速度变化带来的影响，采用动态时间规整（Dynamic Time Warping）对特征序列进行距离计算。通过最近邻分类器对结果进行准确分类。该方法在公共CASIA-B数据集与TUM-GAID数据集上进行了验证并与其他方法进行比较，结果表明该方法有较高的识别率。     

正则化最近点优化图像集匹配的三维人脸识别

针对传统的三维人脸识别算法受光照、表情、姿态及遮掩等变化而影响识别性能的问题,提出了一种基于正则化最近点优化图像集匹配算法。将图库图像集和探针图像集建模成正则化仿射包,利用迭代器自动确定两个图像集间的正则化最近点;利用最近子空间分类器最小化正则化最近点;根据正则化最近点之间的欧氏距离及结构计算RNP集之间的距离,利用最近邻分类器完成人脸的识别。在Honda/UCSD、BU4DFE两大视频人脸数据库上的实验验证了该算法的有效性及可靠性,实验结果表明,相比其他几种较为先进的三维人脸识别算法,该算法取得了更好的识别效果,同时,大大减少了训练及测试总完成时间。     

On the classification of remote sensing high spatial resolution image data

In this paper is investigated a methodology implementing an object-based approach to digital image classification using spectral and spatial attributes in a multiple-stage classifier structured as a binary tree. It is a well-established fact that object-based image classification is particularly appropriate when dealing with high spatial resolution image data. Following this approach, the image is initially segmented into objects that carry informational value. Next, spectral and spatial attributes are extracted from every object in the scene, and implemented into a classifier to produce a thematic map. As the combined number of spectral and spatial variables may become large compared to the number of available training samples, a reduction in the data dimensionality may be required whenever parametric classifiers are used, in order to mitigate the effects of the Hughes phenomenon. To this end the sequential feature selection (SFS) procedure is applied in a multiple-stage classifier structured as a binary tree. The advantage of a binary tree classifier lies in the fact that only one pair of classes is considered at each stage (node), allowing for an optimal selection of features. This proposed approach was tested using Quickbird image data covering an urban scene. The results are compared against results yielded by the traditional single-stage Gaussian maximum likelihood classifier. The results suggest the proposed methodology is adequate in the classification of high spatial resolution image data.     

一种复杂光照下的人脸识别算法

为提高光照变化下的人脸识别率,提出了一种基于局部对比增强（LCE）和局部相位量化（LPQ）的人脸识别方法。采用面部对称的思想结合LCE算法对受不均匀光照的人脸图像进行光照补偿;利用LPQ算子对增强后的图片进行标记,并用分块离散余弦变换（DCT）进行降维;分块计算LPQ直方图序列作为人脸图像的特征描述向量,送入最近邻分类器进行分类识别。通过Yale B和CAS_PEAL数据库上的实验,证实了所提方法的有效性。     

Adaptive Graph Embedding Discriminant Projections

Graph embedding based learning method plays an increasingly significant role on dimensionality reduction (DR). However, the selection to neighbor parameters of graph is intractable. In this paper, we present a novel DR method called adaptive graph embedding discriminant projections (AGEDP). Compared with most existing DR methods based on graph embedding, such as marginal Fisher analysis which usually predefines the intraclass and interclass neighbor parameters, AGEDP applies all the homogeneous samples for constructing the intrinsic graph, and simultaneously selects heterogeneous samples within the neighborhood generated by the farthest homogeneous sample for constructing the penalty graph. Therefore, AGEDP not only greatly enhances the intraclass compactness and interclass separability, but also adaptively performs neighbor parameter selection which considers the fact that local manifold structure of each sample is generally different. Experiments on AR and COIL-20 datasets demonstrate the effectiveness of the proposed method for face recognition and object categorization, and especially under the interference of occlusion, noise and poses, it is superior to other graph embedding based methods with three different classifiers: nearest neighbor classifier, sparse representation classifier and linear regression classifier.     

基于流形学习的三维步态鲁棒识别方法

针对过去几乎都是在单目视觉的情况下进行步态识别研究的现状,提出一种基于立体视觉的步态识别方法。首先利用立体匹配技术获得人体轮廓的三维信息,并据此构造出三维人体轮廓描述子以获取人体的步态特征。接着通过平滑、去噪等预处理手段抑制噪声的影响,并采用流形学习构建低维流形进行特征降维。最后将最近邻分类器和最近邻模板分类器用于识别过程。采用该方法在PRLABⅡ立体步态数据库和不规则测试数据集ExN上进行实验,获得较高的识别率。实验结果表明,文中所提出的方法具有与行人行走路径到摄像机之间的距离无关的特点,且对于不完整的残缺步态序列、行人行为姿态的变化、携带物品和服饰变化等具有较强的鲁棒性。