An efficient feature selection method for mobile devices with application to activity recognition

This paper presents a feature selection method for data classification, which combines a model-based variable selection technique and a fast two-stage subset selection algorithm. The relationship between a specified (and complete) set of candidate features and the class label is modeled using a non-linear full regression model which is linear-in-the-parameters. The performance of a sub-model measured by the sum of the squared-errors (SSE) is used to score the informativeness of the subset of features involved in the sub-model. The two-stage subset selection algorithm approaches a solution sub-model with the SSE being locally minimized. The features involved in the solution sub-model are selected as inputs to support vector machines (SVMs) for classification. The memory requirement of this algorithm is independent of the number of training patterns. This property makes this method suitable for applications executed in mobile devices where physical RAM memory is very limited.An application was developed for activity recognition, which implements the proposed feature selection algorithm and an SVM training procedure. Experiments are carried out with the application running on a PDA for human activity recognition using accelerometer data. A comparison with an information gain-based feature selection method demonstrates the effectiveness and efficiency of the proposed algorithm.     

基于自适应相似性的无监督多视图特征选择

为解决传统特征选择方法忽略视图内部特征的相关性及不同视图之间的特征关联性问题,提出一种基于自适应相似性的特征选择学习方法.在特征选择时考虑视图内部的特征相关性,对每个视图进行特征选择,通过引入图正则化,充分利用数据的局部几何特性,使同类别特征之间的联系更加紧密,达到增强算法的鲁棒性.引入L1/2稀疏范数降低噪声,提高分类模型的准确率.通过与现有的特征方法进行对比分析,提出方法在ACC和NMI上优于其它方法.     

Discriminative multi-task multi-view feature selection and fusion for multimedia analysis

Multimedia Tools and Applications - Multimedia content analysis and understanding, such as action recognition and image classification, is a fundamental research problem. One effective strategy to...     

Multi-scale joint feature network for micro-expression recognition

Computational Visual Media - Micro-expression recognition is a substantive cross-study of psychology and computer science, and it has a wide range of applications (e.g., psychological and clinical...     

Subspace based feature selection for pattern recognition

Feature selection is an essential topic in the field of pattern recognition. The feature selection strategy has a direct influence on the accuracy and processing time of pattern recognition applications. Features can be evaluated with either univariate approaches, which examine features individually, or multivariate approaches, which consider possible feature correlations and examine features as a group. Although univariate approaches do not take the correlation among features into consideration, they can provide the individual discriminatory power of the features, and they are also much faster than multivariate approaches. Since it is crucial to know which features are more or less informative in certain pattern recognition applications, univariate approaches are more useful in these cases. This paper therefore proposes subspace based separability measures to determine the individual discriminatory power of the features. These measures are then employed to sort and select features in a multi-class manner. The feature selection performances of the proposed measures are evaluated and compared with the univariate forms of classic separability measures (Divergence, Bhattacharyya, Transformed Divergence, and Jeffries-Matusita) on several datasets. The experimental results clearly indicate that the new measures yield comparable or even better performance than the classic ones in terms of classification accuracy and dimension reduction rate.     

A clustering based feature selection method in spectro-temporal domain for speech recognition

Spectro-temporal representation of speech has become one of the leading signal representation approaches in speech recognition systems in recent years. This representation suffers from high dimensionality of the features space which makes this domain unsuitable for practical speech recognition systems. In this paper, a new clustering based method is proposed for secondary feature selection/extraction in the spectro-temporal domain. In the proposed representation, Gaussian mixture models (GMM) and weighted K-means (WKM) clustering techniques are applied to spectro-temporal domain to reduce the dimensions of the features space. The elements of centroid vectors and covariance matrices of clusters are considered as attributes of the secondary feature vector of each frame. To evaluate the efficiency of the proposed approach, the tests were conducted for new feature vectors on classification of phonemes in main categories of phonemes in TIMIT database. It was shown that by employing the proposed secondary feature vector, a significant improvement was revealed in classification rate of different sets of phonemes comparing with MFCC features. The average achieved improvements in classification rates of voiced plosives comparing to MFCC features is 5.9% using WKM clustering and 6.4% using GMM clustering. The greatest improvement is about 7.4% which is obtained by using WKM clustering in classification of front vowels comparing to MFCC features.     

Modular neural-SVM scheme for speech emotion recognition using ANOVA feature selection method

The speech signal consists of linguistic information and also paralinguistic one such as emotion. The modern automatic speech recognition systems have achieved high performance in neutral style speech recognition, but they cannot maintain their high recognition rate for spontaneous speech. So, emotion recognition is an important step toward emotional speech recognition. The accuracy of an emotion recognition system is dependent on different factors such as the type and number of emotional states and selected features, and also the type of classifier. In this paper, a modular neural-support vector machine (SVM) classifier is proposed, and its performance in emotion recognition is compared to Gaussian mixture model, multi-layer perceptron neural network, and C5.0-based classifiers. The most efficient features are also selected by using the analysis of variations method. It is noted that the proposed modular scheme is achieved through a comparative study of different features and characteristics of an individual emotional state with the aim of improving the recognition performance. Empirical results show that even by discarding 22% of features, the average emotion recognition accuracy can be improved by 2.2%. Also, the proposed modular neural-SVM classifier improves the recognition accuracy at least by 8% as compared to the simulated monolithic classifiers.     

CGA: a new feature selection model for visual human action recognition

Neural Computing and Applications - Recognition of human actions from visual contents is a budding field of computer vision and image understanding. The problem with such a recognition system is...     

基于ASM和Gabor变换的人脸识别

人脸形状特征的变化是造成人物面貌差异的重要原因之一。主动形状模型(ASM)技术提供了检测该特征的有力手段。Gabor变换有着良好的仿生特性。它提供了理解视觉信息的有效途径。结合上述技术,采用点分布模型对人脸形状进行描述,利用ASM进行人脸特征点的搜索。以特征点上的Gabor展开系数作为人脸特征矢量,进行人脸辨识,实验结果表明,该算法能够在少量训练样本的情况下获得较高的识别率,并对光照、人物表情等变化具有较好的适应性。     

Daily living activity recognition based on statistical feature quality group selection

The benefits arising from proactive conduct and subject-specialized healthcare have driven e-health and e-monitoring into the forefront of research, in which the recognition of motion, postures and physical exercise is one of the main subjects. We propose here a multidisciplinary method for the recognition of physical activity with the emphasis on feature extraction and selection processes, which are considered to be the most critical stages in identifying the main unknown activity discriminant elements. Efficient feature selection processes are particularly necessary when dealing with huge training datasets in a multidimensional space, where conventional feature selection procedures based on wrapper methods or ‘branch and bound’ are highly expensive in computational terms. We propose an alternative filter method using a feature quality group ranking via a couple of two statistical criteria. Satisfactory results are achieved in both laboratory and semi-naturalistic activity living datasets for real problems using several classification models, thus proving that any body sensor location can be suitable to define a simple one-feature-based recognition system, with particularly remarkable accuracy and applicability in the case of the wrist.     

Channel and feature selection for a surface electromyographic pattern recognition task

The objective of this research is to select a reduced group of surface electromyographic (sEMG) channels and signal-features that is able to provide an accurate classification rate in a myoelectric control system for any user. To that end, the location of 32 sEMG electrodes placed around-along the forearm and 86 signal-features are evaluated simultaneously in a static-hand gesture classification task (14 different gestures). A novel multivariate variable selection filter method named mRMR-FCO is presented as part of the selection process. This process finds the most informative and least redundant combination of sEMG channels and signal-features among all the possible ones. The performance of the selected set of channels and signal-features is evaluated with a Support Vector Machine classifier.     

A feature selection method for a sample-based stochastic policy

Stochastic policy gradient methods have been applied to a variety of robot control tasks such as robot’s acquisition of motor skills because they have an advantage in learning in high-dimensional and continuous feature spaces by combining some heuristics like motor primitives. However, when we apply one of them to a real-world task, it is difficult to represent the task well by designing the policy function and the feature space due to the lack of enough prior knowledge about the task. In this research, we propose a method to extract a preferred feature space autonomously to achieve a task using a stochastic policy gradient method for a sample-based policy. We apply our method to a control of linear dynamical system and the computer simulation result shows that a desirable controller is obtained and that the performance of the controller is improved by the feature selection.     

新的特征选择方法

对于一个给定的待分类模式,特征选择要求人们从大量的特征中选取一个最优特征子集,以代表被分类的模式.对特征选择问题提出了基于一种特殊度量的特征选择方法,先通过对数据集的训练得到特殊的度量,然后用该度量对特征进行分类,从各类中选取一个特征,最后再用特征选择算法对所选的特征进行选择.大量实验的结果表示该方法具有较好的效果.     

Evolutionary feature and instance selection for traffic sign recognition

The problem of traffic sign recognition is generally approached by first constructing a classifier, which is trained by some relevant image features extracted from traffic signs, to recognize new unknown traffic signs. Feature selection and instance selection are two important data preprocessing steps in data mining, with the former aimed at removing some irrelevant and/or redundant features from a given dataset and the latter at discarding the faulty data. However, there has thus far been no study examining the impact of performing feature and instance selection on traffic sign recognition performance. Given that genetic algorithms (GA) have been widely used for these types of data preprocessing tasks in related studies, we introduce a novel genetic-based biological algorithm (GBA). GBA fits “biological evolution” into the evolutionary process, where the most streamlined process also complies with reasonable rules. In other words, after long-term evolution, organisms find the most efficient way to allocate resources and evolve. Similarly, we closely simulate the natural evolution of an algorithm, to find an option it will be both efficient and effective. Experiments are carried out comparing the performance of the GBA and a GA based on the German Traffic Sign Recognition Benchmark. The results show that the GBA outperforms the GA in terms of the reduction rate, classification accuracy, and computational cost.     

Robust Discriminative multi-view K-means clustering with feature selection and group sparsity learning

Multimedia Tools and Applications - With the rapid development of information technologies, more and more data are collected from multiple sources, which contain different perspectives of the data....     

Audiovisual emotion recognition using ANOVA feature selection method and multi-classifier neural networks

To make human–computer interaction more naturally and friendly, computers must enjoy the ability to understand human’s affective states the same way as human does. There are many modals such as face, body gesture and speech that people use to express their feelings. In this study, we simulate human perception of emotion through combining emotion-related information using facial expression and speech. Speech emotion recognition system is based on prosody features, mel-frequency cepstral coefficients (a representation of the short-term power spectrum of a sound) and facial expression recognition based on integrated time motion image and quantized image matrix, which can be seen as an extension to temporal templates. Experimental results showed that using the hybrid features and decision-level fusion improves the outcome of unimodal systems. This method can improve the recognition rate by about 15 % with respect to the speech unimodal system and by about 30 % with respect to the facial expression system. By using the proposed multi-classifier system that is an improved hybrid system, recognition rate would increase up to 7.5 % over the hybrid features and decision-level fusion with RBF, up to 22.7 % over the speech-based system and up to 38 % over the facial expression-based system.     

Statistical modeling and feature selection for seismic pattern recognition

Application of pattern recognition techniques to reflection seismic data is difficult for several reasons. The amount of available training data is limited by the degree of well control in the area and may not be sufficient. In contrast, seismic data sets are often extremely large, necessitating the use of the smallest possible feature set to allow quick and efficient processing. In this paper, a method to generate synthetic training data is described, which alleviates the problem of insufficient training data. A means is provided for injecting a priori geologic knowledge into the classifier, including well logs. Finally, a feature evaluation algorithm using a performance metric related to the Bayes probability of error is outlined and applied to the training data to identify effective feature sets.     

Automatic feature selection for context recognition in mobile devices

In mobile devices there exist several in-built sensor units and sources which provide data for context reasoning. More context sources can be attached via wireless network connections. Usually, the mobile devices and the context sources are battery powered and their computational and space resources are limited. This sets special requirements for the context recognition algorithms. In this paper, several classification and automatic feature selection algorithms are compared in the context recognition domain. The main goal of this study is to investigate how much advantage can be achieved by using sophisticated and complex classification methods compared with a simple method that can easily be implemented in mobile devices. The main result is that even a simple linear classification algorithm can achieve a reasonably good accuracy if the features calculated from raw data are selected in a suitable way. Usually context recognition algorithms are fitted to a particular problem instance in an off-line manner and modifying methods for on-line learning is difficult or impossible. An on-line version of the Minimum-distance classifier is presented in this paper and it is justified that it leads to considerably higher classification accuracies compared with the static off-line version of the algorithm. Moreover, we report superior performance for the Minimum-distance classifier compared to other classifiers from the view point of computational load and power consumption of a smart phone.     

Self-representation graph feature selection method for classification

This paper proposed a novel feature selection method that includes a self-representation loss function, a graph regularization term and an \({l_{2,1}}\)-norm regularization term. Different from traditional least square loss function which focuses on achieving the minimal regression error between the class labels and their corresponding predictions, the proposed self-representation loss function pushes to represent each feature with a linear combination of its relevant features, aim at effectively selecting representative features and ensuring the robustness to outliers. The graph regularization terms include two kinds of inherent information, i.e., the relationship between samples (the sample–sample relation for short) and the relationship between features (the feature–feature relation for short). The feature–feature relation reflects the similarity between two features and preserves the relation into the coefficient matrix, while the sample–sample relation reflects the similarity between two samples and preserves the relation into the coefficient matrix. The \({l_{2,1}}\)-norm regularization term is used to conduct feature selection, aim at selecting the features, which satisfies the characteristics mentioned above. Furthermore, we put forward a new optimization method to solve our objective function. Finally, we feed reduced data into support vector machine (SVM) to conduct classification on real datasets. The experimental results showed that the proposed method has a better performance comparing with state-of-the-art methods, such as k nearest neighbor, ridge regression, SVM and so on.