Conference Paper

Pattern Classiffication using SVM with GMM Data Selection Training Methode

Electr. Eng. Dept., Amirkabir Univ. of Technol., Tehran, Iran
DOI: 10.1109/ICSPC.2007.4728496 Conference: Signal Processing and Communications, 2007. ICSPC 2007. IEEE International Conference on
Source: IEEE Xplore


In pattern recognition, support vector machines (SVM) as a discriminative classifier and Gaussian mixture model as a generative model classifier are two most popular techniques. Current state-of-the-art systems try to combine them together for achieving more power of classification and improving the performance of the recognition systems. Most of recent works focus on probabilistic SVM/GMM hybrid methods but this paper presents a novel method for SVM/GMM hybrid pattern classification based on training data selection. This system uses the output of the Gaussian mixture model to choose training data for SVM classifier. Results on databases are provided to demonstrate the effectiveness of this system. We are able to achieve better error-rates that are better than the current systems.

Full-text preview

Available from:
  • Source
    • "Basically , there are a few approaches aiming to recover the intersected manifolds. For instance, Souvenir et al. [31] implement a variant of K-means [7] [8] [32] where the cluster centers are considered as manifolds . Guo et al. [19] propose to minimize a (combinatorial) energy that includes local orientation information by using a tabu search. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Abstract The massive amount of high-dimensional data in science and engineering demands new trends in data analysis. Subspace techniques have shown remarkable success in numerous problems in computer vision and data mining, where the goal is to recover the low-dimensional structure of data in an ambient space. Traditional subspace methods like PCA and ICA assume that the data is coming from a single manifold. However, the data might come from several (possibly intersected) manifolds (surfaces). This has caused the development of new nonlinear techniques to cluster subspaces of high-dimensional data. In this paper, we propose a new algorithm for subspace clustering of data, where the data consists of several possibly intersected manifolds. To this end, we first propose a curvature constraint to find the shortest path between data points and then use it in Isomap for subspace learning. The algorithm chooses several landmark nodes at random and then checks whether there is a curvature constrained path between each landmark node and all other nodes in the neighborhood graph. It builds a binary feature vector for each point where each entry represents the the connectivity of that point to a particular landmark. Then the binary feature vectors could be used as a input of conventional clustering algorithms such as hierarchical clustering. The performed experiments on both synthetic and real data sets confirm the performance of our algorithm.
    Full-text · Article · Sep 2015 · Pattern Recognition Letters
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Location awareness is of primary importance in a wealth of applications such as transportation, mobile health systems, augmented reality and navigation. For example, in busy transportation areas (such as airports) providing clear, personalised notifications and directions, can reduce delays and improve the passenger journeys. Currently some applications provide easy access to information. These travel related applications can become context aware via the availability of accurate indoor/outdoor positioning. However, there are barriers that still have to overcome. One such barrier is the time required to set up and calibrate indoor positioning systems, another is the challenge of scalability with regard to the processing requirements of indoor positioning algorithms. This paper investigates the relationship between the calibration data and positioning system accuracy and analyses the performance of a k-Nearest Neighbour (k-NN) based positioning algorithm using real GSM data. Furthermore, the paper proposes a positioning scheme based on Gaussian Mixture Models (GMM). Experimental results show that the proposed GMM algorithm (without post-filtering) provides high levels of localization accuracy and successfully copes with the scalability problems that the conventional k-NN approach faces.
    Full-text · Article · Jan 2012 · The Open Transportation Journal
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we explain a fully automatic system for airplane detection and tracking based on wavelet transform and Support Vector Machine (SVM). By using 50 airplane images in different situations, models are developed to recognize airplane in the first frame of a video sequence. To train a SVM classifier for classifying pixels belong to objects and background pixels, vectors of features are built. The learned model can be used to detect the airplane in the original video and in the novel images. For original video, the system can be considered as a generalized tracker and for novel images it can be interpreted as method for learning models for object recognition. After airplane detection in the first frame, the feature vectors of this frame are used to train the SVM classifier. For new video frame, SVM is applied to test the pixels and form a confidence map. The 4th level of Daubechies's wavelet coefficients corresponding to input image are used as features. Conducting simulations, it is demonstrated that airplane detection and tracking based on wavelet transform and SVM classification result in acceptable and efficient performance. The experimental results agree with the theoretical results.
    Full-text · Conference Paper · Apr 2009
Show more