Eye pupil localization with an ensemble of randomized trees

We describe a method for eye pupil localization based on an ensemble of randomized regression trees and use several publicly available datasets for its quantitative and qualitative evaluation. The method compares well with reported state-of-the-art and runs in real-time on hardware with limited processing power, such as mobile devices.     

Margin-based ensemble classifier for protein fold recognition

Recognition of protein folding patterns is an important step in protein structure and function predictions. Traditional sequence similarity-based approach fails to yield convincing predictions when proteins have low sequence identities, while the taxonometric approach is a reliable alternative. From a pattern recognition perspective, protein fold recognition involves a large number of classes with only a small number of training samples, and multiple heterogeneous feature groups derived from different propensities of amino acids. This raises the need for a classification method that is able to handle the data complexity with a high prediction accuracy for practical applications. To this end, a novel ensemble classifier, called MarFold, is proposed in this paper which combines three margin-based classifiers for protein fold recognition.The effectiveness of our method is demonstrated with the benchmark D-B dataset with 27 classes. The overall prediction accuracy obtained by MarFold is 71.7%, which surpasses the existing fold recognition methods by 3.1–15.7%. Moreover, one component classifier for MarFold, called ALH, has obtained a prediction accuracy of 65.5%, which is 4.7–9.5% higher than the prediction accuracies for the published methods using single classifiers. Additionally, the feature set of pairwise frequency information about the amino acids, which is adopted by MarFold, is found to be important for discriminating folding patterns. These results imply that the MarFold method and its operation engine ALH might become useful vehicles for protein fold recognition, as well as other bioinformatics tasks. The MarFold method and the datasets can be obtained from: (http://www-staff.it.uts.edu.au/～lbcao/publication/MarFold.7z).     

MRMR-based ensemble pruning for facial expression recognition

Multimedia Tools and Applications - Facial expression recognition (FER) can assist the interaction between humans and devices. The combination of FER and ensemble learning can usually improve final...     

基于集成分类器的肿瘤亚型识别研究

针对肿瘤基因表达谱样本少,维数高的特点,提出一种用于肿瘤信息基因提取和亚型识别的集成分类器算法.该算法根据基因的Fisher比率值建立候选子集,再采用相关系数和互信息两种度量方法,分别构造反映基因共表达行为和调控关系的特征子集.粒子群优化算法分别与SVM和KNN构成两个基分类器,从候选子集中提取信息基因并对肿瘤亚型进行分类,最后利用绝对多数投票方法对基分类器的结果进行整合.G.Gordon肺癌亚型识别的实验结果表明了该算法的可行性和有效性.     

Keypoint recognition using randomized trees

In many 3D object-detection and pose-estimation problems, runtime performance is of critical importance. However, there usually is time to train the system, which we would show to be very useful. Assuming that several registered images of the target object are available, we developed a keypoint-based approach that is effective in this context by formulating wide-baseline matching of keypoints extracted from the input images to those found in the model images as a classification problem. This shifts much of the computational burden to a training phase, without sacrificing recognition performance. As a result, the resulting algorithm is robust, accurate, and fast-enough for frame-rate performance. This reduction in runtime computational complexity is our first contribution. Our second contribution is to show that, in this context, a simple and fast keypoint detector suffices to support detection and tracking even under large perspective and scale variations. While earlier methods require a detector that can be expected to produce very repeatable results, in general, which usually is very time-consuming, we simply find the most repeatable object keypoints for the specific target object during the training phase. We have incorporated these ideas into a real-time system that detects planar, nonplanar, and deformable objects. It then estimates the pose of the rigid ones and the deformations of the others.     

Landmark recognition with compact BoW histogram and ensemble ELM

Along with the rapid development of mobile terminal devices, landmark recognition applications based on mobile devices have been widely researched in recent years. Due to the fast response time requirement of mobile users, an accurate and efficient landmark recognition system is thus urgent for mobile applications. In this paper, we propose a landmark recognition framework by employing a novel discriminative feature selection method and the improved extreme learning machine (ELM) algorithm. The scalable vocabulary tree (SVT) is first used to generate a set of preliminary codewords for landmark images. An efficient codebook learning algorithm derived from the word mutual information and Visual Rank technique is proposed to filter out those unimportant codewords. Then, the selected visual words, as the codebook for image encoding, are used to produce a compact Bag-of-Words (BoW) histogram. The fast ELM algorithm and the ensemble approach using the ELM classifier are utilized for landmark recognition. Experiments on the Nanyang Technological University campus’s landmark database and the Fifteen Scene database are conducted to illustrate the advantages of the proposed framework.     

基于神经网络集成的汽车牌照识别

对基于神经网络集成的汽车牌照识别的原理和方法进行了研究,并着重分析了现有技术的积极因素和潜在问题,提出了一种基于神经网络集成进行车牌文字识别的方法.在特征提取时采用了多种特征提取的方法,对提取的每种特征构建一个BP神经网络分别进行训练.最终待识别的字符将被神经网络集成进行识别.实践证明,利用该方法比单个神经网络识别有更高的识别率,具有较高的使用价值.     

Bounds on the moments for an ensemble of random decision trees

Knowledge and Information Systems - An ensemble of random decision trees is a popular classification technique, especially known for its ability to scale to large domains. In this paper, we provide...     

基于Bagging集成学习的字符识别方法

针对字符识别对象的多样性,提出了一种基于Bagging集成的字符识别模型,解决了识别模型对部分字符识别的偏好现象。采用Bagging采样策略形成不同的数据子集,在此基础上用决策树算法训练形成多个基分类器,用多数投票机制对基分类器预测结果集成输出。理论分析与仿真实验结果表明,所提模型相比其他分类方法具有更好的分类能力。     

Multiobjective optimization for classifier ensemble and feature selection: an application to named entity recognition

In this paper, the concept of finding an appropriate classifier ensemble for named entity recognition is posed as a multiobjective optimization (MOO) problem. Our underlying assumption is that instead of searching for the best-fitting feature set for a particular classifier, ensembling of several classifiers those are trained using different feature representations could be a more fruitful approach, but it is crucial to determine the appropriate subset of classifiers that are most suitable for the ensemble. We use three heterogenous classifiers namely maximum entropy, conditional random field, and support vector machine in order to build a number of models depending upon the various representations of the available features. The proposed MOO-based ensemble technique is evaluated for three resource-constrained languages, namely Bengali, Hindi, and Telugu. Evaluation results yield the recall, precision, and F-measure values of 92.21, 92.72, and 92.46%, respectively, for Bengali; 97.07, 89.63, and 93.20%, respectively, for Hindi; and 80.79, 93.18, and 86.54%, respectively, for Telugu. We also evaluate our proposed technique with the CoNLL-2003 shared task English data sets that yield the recall, precision, and F-measure values of 89.72, 89.84, and 89.78%, respectively. Experimental results show that the classifier ensemble identified by our proposed MOO-based approach outperforms all the individual classifiers, two different conventional baseline ensembles, and the classifier ensemble identified by a single objective?Cbased approach. In a part of the paper, we formulate the problem of feature selection in any classifier under the MOO framework and show that our proposed classifier ensemble attains superior performance to it.     

Identifying species of individual trees using airborne laser scanner

Individual trees can be detected using high-density airborne laser scanner data. Also, variables characterizing the detected trees such as tree height, crown area, and crown base height can be measured. The Scandinavian boreal forest mainly consists of Norway spruce (Picea abies L. Karst.), Scots pine (Pinus sylvestris L.), and deciduous trees. It is possible to separate coniferous from deciduous trees using near-infrared images, but pine and spruce give similar spectral signals. Airborne laser scanning, measuring structure and shape of tree crowns could be used for discriminating between spruce and pine. The aim of this study was to test classification of Scots pine versus Norway spruce on an individual tree level using features extracted from airborne laser scanning data. Field measurements were used for training and validation of the classification. The position of all trees on 12 rectangular plots (50×20 m²) were measured in field and tree species was recorded. The dominating species (>80%) was Norway spruce for six of the plots and Scots pine for six plots. The field-measured trees were automatically linked to the laser-measured trees. The laser-detected trees on each plot were classified into species classes using all laser-detected trees on the other plots as training data. The portion correctly classified trees on all plots was 95%. Crown base height estimations of individual trees were also evaluated (r=0.84). The classification results in this study demonstrate the ability to discriminate between pine and spruce using laser data. This method could be applied in an operational context. In the first step, a segmentation of individual tree crowns is performed using laser data. In the second step, tree species classification is performed based on the segments. Methods could be developed in the future that combine laser data with digital near-infrared photographs for classification with the three classes: Norway spruce, Scots pine, and deciduous trees.     

基于多级分类器和神经网络集成的手写体汉字识别

为了提高系统的泛化能力,在分析了当前汉字识别最新发展技术的基础上,提出了一种三级识别策略的汉字识别系统模型.第一级,使用传统的外围特征法将待选字进行粗分;第二级,使用笔划密度特征法进行细分;第三级,使用一种基于球领域模型的神经网络集成算法对结果进行最后的确认.模拟算法证明,它可以更进一步地提高系统的泛化能力.     

On the pattern recognition of noisy subsequence trees

We consider the problem of recognizing ordered labeled trees by processing their noisy subsequence-trees which are “patched-up” noisy portions of their fragments. We assume that H, a finite dictionary of ordered labeled trees, is given. X* is an unknown element of H, and U is any arbitrary subsequence-tree of X*. We consider the problem of estimating X* by processing Y, which is a noisy version of U. The solution which we present is, to our knowledge, the first reported solution to the problem. We solve the problem by sequentially comparing Y with every element X of H, the basis of comparison being a new dissimilarity measure between two trees, which implicitly captures the properties of the corrupting mechanism that noisily garbles U into Y. The algorithm which incorporates this constraint has been used to test our pattern recognition system, and the experimental results obtained demonstrate good accuracy     

An ultra small individual recognition security chip

The manufacturing and distribution of goods requires good quality and inventory control. The RFID (radiofrequency identification) enabled microchip's small size and low cost make it suitable for attachment to paper media and small products, aiding counterfeit prevention and product tracking in market environments     

Modelling speech emotion recognition using logistic regression and decision trees

Speech emotion recognition has been one of the interesting issues in speech processing over the last few decades. Modelling of the emotion recognition process serves to understand as well as assess the performance of the system. This paper compares two different models for speech emotion recognition using vocal tract features namely, the first four formants and their respective bandwidths. The first model is based on a decision tree and the second one employs logistic regression. Whereas the decision tree models are based on machine learning, regression models have a strong statistical basis. The logistic regression models and the decision tree models developed in this work for several cases of binary classifications were validated by speech emotion recognition experiments conducted on a Malayalam emotional speech database of 2800 speech files, collected from ten speakers. The models are not only simple, but also meaningful since they indicate the contribution of each predictor. The experimental results indicate that speech emotion recognition using formants and bandwidths was better modelled using decision trees, which gave higher emotion recognition accuracies compared to logistic regression. The highest accuracy obtained using decision tree was 93.63%, for the classification of positive valence emotional speech as surprised or happy, using seven features. When using logistic regression for the same binary classification, the highest accuracy obtained was 73%, with eight features.     

A boosting ensemble for the recognition of code sharing in malware

Research and development efforts have recently started to compare malware variants, as it is believed that malware authors are reusing code. A number of these projects have focused on identifying functions through the use of signature-based classifiers. We introduce three new classifiers that characterize a function’s use of global data. Experiments on malware show that we can meaningfully correlate functions on the basis of their global data references even when their functions share little code. We also present an algorithm that combines existing classifiers and our new ones into an ensemble for correlating functions in two binary programs. For testing, we developed a model for comparing our work to previous signature based classifiers. We then used that model to show how our new combined ensemble classifier dominates the previously reported classifiers. The resulting ensemble can be used by malware analysts when they are comparing two binaries. This technique will allow them to correlate both functions and global data references between the two and will lead to a quick identification of any sharing that is occurring.     

Human face recognition based on ensemble of polyharmonic extreme learning machine

This paper proposes a classifier named ensemble of polyharmonic extreme learning machine, whose part weights are randomly assigned, and it is harmonic between the feedforward neural network and polynomial. The proposed classifier provides a method for human face recognition integrating fast discrete curvelet transform (FDCT) with 2-dimension principal component analysis (2DPCA). FDCT is taken to be a feature extractor to obtain facial features, and then these features are dimensionality reduced by 2DPCA to decrease the computational complexity before they are input to the classifier. Comparison experiments of the proposed method with some other state-of-the-art approaches for human face recognition have been carried out on five well-known face databases, and the experimental results show that the proposed method can achieve higher recognition rate.