A novel classifier based on shortest feature line segment

A new approach called shortest feature line segment (SFLS) is proposed to implement pattern classification in this paper, which can retain the ideas and advantages of nearest feature line (NFL) and at the same time can counteract the drawbacks of NFL. The proposed SFLS uses the length of the feature line segment satisfying given geometric relation with query point instead of the perpendicular distance defined in NFL. SFLS has clear geometric-theoretic foundation and is relatively simple. Experimental results on some artificial datasets and real-world datasets are provided, together with the comparisons between SFLS and other neighborhood-based classification methods, including nearest neighbor (NN), k-NN, NFL and some refined NFL methods, etc. It can be concluded that SFLS is a simple yet effective classification approach.     

Center-based nearest neighbor classifier

In this paper, a novel center-based nearest neighbor (CNN) classifier is proposed to deal with the pattern classification problems. Unlike nearest feature line (NFL) method, CNN considers the line passing through a sample point with known label and the center of the sample class. This line is called the center-based line (CL). These lines seem to have more capacity of representation for sample classes than the original samples and thus can capture more information. Similar to NFL, CNN is based on the nearest distance from an unknown sample point to a certain CL for classification. As a result, the computation time of CNN can be shortened dramatically with less accuracy decrease when compared with NFL. The performance of CNN is demonstrated in one simulation experiment from computational biology and high classification accuracy has been achieved in the leave-one-out test. The comparisons with nearest neighbor (NN) classifier and NFL classifier indicate that this novel classifier achieves competitive performance.     

利用改进NFL算法对镜头进行基于内容的检索

基于镜头的分类和检索对于视频库的管理和查询非常重要.将“最近特征线”法（nearest feature line,简称NFL）用于镜头的分类和检索.将镜头中的代表帧看做是某个特征空间中的点,通过这些点间的连线表征该镜头的总体特征信息,然后计算查询图像和特征线的距离,以决定镜头与查询图像的相似度.为了更适于视频数据,对原来的NFL方法进行了改进,基于镜头内部内容活动程度对特征线进行限制、实验结果表明,改进的NFL方法比传统的NFL方法以及常用的聚类万法,如最近邻法（nearest neighbor,简称NN）和最近中心法（nearest center,简称NC）,在性能上有所提高.     

Locally nearest neighbor classifiers for pattern classification

In this paper, two novel classifiers based on locally nearest neighborhood rule, called nearest neighbor line and nearest neighbor plane, are presented for pattern classification. Comparison to nearest feature line and nearest feature plane, the proposed methods take much lower computation cost and achieve competitive performance.     

On the use of nearest feature line for speaker identification

As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are available for training. In this paper, we explore the use of NFL for speaker identification in terms of limited data and examine how the NFL performs in such a vexing problem of various mismatches between training and test. In order to speed up NFL in decision-making, we propose an alternative method for similarity measure. We have applied the improved NFL to speaker identification of different operating modes. Its text-dependent performance is better than the dynamic time warping (DTW) on the Ti46 corpus, while its computational load is much lower than that of DTW. Moreover, we propose an utterance partitioning strategy used in the NFL for better performance. For the text-independent mode, we employ the NFL to be a new similarity measure in vector quantization (VQ), which causes the VQ to perform better on the KING corpus. Some computational issues on the NFL are also discussed in this paper.     

Face recognition with adaptive local hyperplane algorithm

The paper introduces a novel adaptive local hyperplane (ALH) classifier and it shows its superior performance in the face recognition tasks. Four different feature extraction methods (2DPCA, (2D)²PCA, 2DLDA and (2D)²LDA) have been used in combination with five classifiers (K-nearest neighbor (KNN), support vector machine (SVM), nearest feature line (NFL), nearest neighbor line (NNL) and ALH). All the classifiers and feature extraction methods have been applied to the renown benchmarking face databases—the Cambridge ORL database and the Yale database and the ALH classifier with a LDA based extractor outperforms all the other methods on them. The ALH algorithm on these two databases is very promising but more study on larger databases need yet to be done to show all the advantages of the proposed algorithm.     

基于局部线性嵌入和最近特征线的人耳识别

针对人耳生物特征,通过分析早期人耳识别方法的不足,提出了一种局部线性嵌入（LLE）和最近特征线（NFL）相结合的人耳识别方法。首先依据流形学习思想,采用局部线性嵌入算法提取人耳图像特征,然后采用最近特征线分类器进行人耳识别。实验结果表明,该方法在人耳姿态变化时能够取得非常理想的识别率,提高了人耳识别的鲁棒性,增强了人耳识别技术的实用性。     

Face recognition using the nearest feature line method

We propose a classification method, called the nearest feature line (NFL), for face recognition. Any two feature points of the same class (person) are generalized by the feature line (FL) passing through the two points. The derived FL can capture more variations of face images than the original points and thus expands the capacity of the available database. The classification is based on the nearest distance from the query feature point to each FL. With a combined face database, the NFL error rate is about 43.7-65.4% of that of the standard eigenface method. Moreover, the NFL achieves the lowest error rate reported to date for the ORL face database.     

基于ICA和NFL分类的局部人脸识别方法

目前已存在很多基于统计的人脸整体识别方法，独立元分析方法就是一种基于信号高阶统计特性的方法。但由于人脸光照、姿态、信息缺损等外部不可避免因素会引起整个人脸灰度图像产生很大的变化，因而会对这类整体统计性方法的稳定性产生很大影响。为此提出了一种基于独立元分析和最近邻特征线的局部人脸识别方法。首先，通过对人眼的手工定位并依据人脸几何特征完成对人脸图像的截取和局部分块，从而移除发型等无用信息；然后对每个局部图像进行PCA／ICA特征提取；最后的识别阶段，通过最近邻特征线方法得到各自识别距离，并通过对各部分设置合理的权重来综合判定。实验结果表明，作为一种有效的识别方法，分块独立元方法在识别率、识别的稳定性、应用的灵活性等方面都优于传统的整体识别方法。     

Object recognition based on image sequences by using inter-feature-line consistencies

An image sequence-based framework for appearance-based object recognition is proposed in this paper. Compared with the methods of using a single view for object recognition, inter-frame consistencies can be exploited in a sequence-based method, so that a better recognition performance can be achieved. We use the nearest feature line (NFL) method (IEEE Trans. Neural Networks 10 (1999) 439) to model each object. The NFL method is extended in this paper by further integrating motion-continuity information between features lines in a probabilistic framework. The associated recognition task is formulated as maximizing an a posteriori probability measure. The recognition problem is then further transformed to a shortest-path searching problem, and a dynamic-programming technique is used to solve it.     

Performance evaluation of the nearest feature line method in image classification and retrieval

A method, the nearest feature line (NFL) method, is used in image classification and retrieval and its performance is evaluated and compared with other methods by extensive experiments. The NFL method is demonstrated to make efficient use of knowledge about multiple prototypes of a class to represent that class.     

基于特征加权的KNNFP改进算法及在故障诊断中的应用

针对传统K最近邻特征投影(KNNFP)算法中假设各维特征对分类的贡献相同而导致分类性能下降的问题,提出一种基于特征加权的KNNFP改进算法(WKNNFP).改进算法利用ReliefF算法确定特征的权值,使样本的分类效果更好,同时还可以分析各特征对分类的贡献程度,并利用改进算法对轴承故障进行诊断.结果表明,改进算法的诊断...     

基于平面线段的反向最近邻查询

反向最近邻查询是空间数据库空间查询的研究热点。目前反向最近邻查询的查询粒度都是基于一维的点．在一些空间物体不能抽象为点的情况下将其抽象为点进行反向最近邻查询,查询结果不能达到一定的精度。该文在分析基于平面线段的最近邻查询和R树结构的基础上提出了一种改进的R树－Rcd树,并给出了基于Rcd树的平面线段反向最近邻查询算法．该方法能实现平面线段的反向最近邻查询。     

基于特征点的单应矩阵鲁棒估计

提出了一种基于特征点的单应矩阵鲁棒估计算法.在图像的尺度空间中提取特征点,并对特征点进行亚像素定位.同时赋予主方向.根据邻域信息计算得到特征向量后,利用最近邻特征点距离与次近邻特征点距离之比得到初始匹配点对.用RANSAC(Random Sample Consensus)算法匹配特征点对,同时计算得到两幅图像之间的单应...     

基于平面线段的反向最近邻查询

反向最近邻查询是空间数据库空间查询的研究热点。目前反向最近邻查询的查询粒度都是基于一维的点,在一些空间物体不能抽象为点的情况下将其抽象为点进行反向最近邻查询,查询结果不能达到一定的精度。该文在分析基于平面线段的最近邻查询和R树结构的基础上提出了一种改进的R树—Rcd树,并给出了基于Rcd树的平面线段反向最近邻查询算法,该方法能实现平面线段的反向最近邻查询。     

基于KD-Tree搜索和SURF特征的图像匹配算法研究

针对图像匹配时进行特征检测和匹配的搜索时间长的问题,文章研究了基于KD-Tree搜索和SURF特征的图像匹配算法。该算法首先提取得到图像的SURF特征并生成特征描述向量,然后为这些特征描述向量建立KD-Tree索引,最后通过计算每个特征点的与其距离最近的若干个KD-Tree上的最近邻点,完成特征匹配工作。实验结果表明,与SIFT算法相比,SURF算法进行特征检测的速度要快2～3倍;与全局最近邻搜索相比,基于KD-Tree索引的近似最近邻搜索大大减少了计算量,较大地提高了SURF算法的匹配速度。     

一种改进的SIFT图像配准方法

针对普通SIFT算法效率因128维的特征点描述算子而降低的问题,提出一种改进的SIFT算法,利用圆环的特性同时对每一个特征向量进行序列化,以保证物体旋转不变性,在降低描述算子维数的基础上,利用遍历搜索查找样本特征点的最近邻和次近邻特征点。实验结果表明,当图像存在不同程度的几何变形、辐射畸变和噪声影响时,改进算法更稳定、更快速。     

On multi-type reverse nearest neighbor search

This paper presents a study of the Multi-Type Reverse Nearest Neighbor (MTRNN) query problem. Traditionally, a reverse nearest neighbor (RNN) query finds all the objects that have the query point as their nearest neighbor. In contrast, an MTRNN query finds all the objects that have the query point in their multi-type nearest neighbors. Existing RNN queries find an influence set by considering only one feature type. However, the influence from multiple feature types is often critical for strategic decision making in many business scenarios, such as site selection for a new shopping center. To that end, we first formalize the notion of the MTRNN query by considering the influence of multiple feature types. We also propose R-tree based algorithms to find the influence set for a given query point and multiple feature types. Finally, experimental results are provided to show the strength of the proposed algorithms as well as design decisions related to performance tuning.     

一种基于遗传算法优化的大数据特征选择方法

提出了一种基于遗传算法的大数据特征选择算法。该算法首先对各维度的特征进行评估,根据每个特征在同类最近邻和异类最近邻上的差异度调整其权重,基于特征权重引导遗传算法的搜索,以提升算法的搜索能力和获取特征的准确性;然后结合特征权重计算特征的适应度,以适应度作为评价指标,启动遗传算法获取最优的特征子集,并最终实现高效准确的大数据特征选择。通过实验分析发现,该算法能够有效减小分类特征数,并提升特征分类准确率。     

空间数据库平面线段近邻查询问题研究

空间数据库的近邻查询近几年受到人们越来越多的关注.近邻查询根据程度不同可分为点与点的近邻查询、点与线段、线段与线段的近邻查询.目前,前两者研究的较多,后者没有查到相关文献.提出平面线段与线段的近邻查询问题.有针对性地解决一些空间物体无法抽象为点的情况.平面线段的近邻查询在现实中有着广泛的应用价值.根据平面线段与线段是否相交分为两类;不相交的平面线段再根据位置关系分成9种情况.分别对上述各种情况进行讨论研究.给出了线段近邻查询的筛选规则、定理和查询算法,进行了实验分析和比较,新方法实现了平面线段与线段的近邻查询,具有较高的查询效率.