Application of Kernel-Based Feature Space Transformations and Learning Methods to Phoneme Classification
András Kocsor,László Tóth +1 more
TL;DR: It is found that the discriminative learners can attain the efficiency of HMM, and that after the transformations they can retain the same performance in spite of the severe dimension reduction.
read more
Abstract: This paper examines the applicability of some learning techniques to the classification of phonemes. The methods tested were artificial neural nets (ANN), support vector machines (SVM) and Gaussian mixture modeling (GMM). We compare these methods with a traditional hidden Markov phoneme model (HMM), working with the linear prediction-based cepstral coefficient features (LPCC). We also tried to combine the learners with linear/nonlinear and unsupervised/supervised feature space transformation methods such as principal component analysis (PCA), independent component analysis (ICA), linear discriminant analysis (LDA), springy discriminant analysis (SDA) and their nonlinear kernel-based counterparts. We found that the discriminative learners can attain the efficiency of HMM, and that after the transformations they can retain the same performance in spite of the severe dimension reduction. The kernel-based transformations brought only marginal improvements compared to their linear counterparts.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Citations
Statistical Pattern Recognition
E.R. Davies
- 01 Jan 1990
TL;DR: This chapter introduces the subject of statistical pattern recognition (SPR) by considering how features are defined and emphasizes that the nearest neighbor algorithm achieves error rates comparable with those of an ideal Bayes’ classifier.
2K
A comparison of nature inspired algorithms for multi-threshold image segmentation
TL;DR: The method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms is used, applied to multi-threshold problem.
165
A multi-threshold segmentation approach based on Artificial Bee Colony optimization
TL;DR: In this article, an image 1-D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm, each Gaussian function represents a pixel class and therefore a threshold point.
95
•Posted Content
A Multi-threshold Segmentation Approach Based on Artificial Bee Colony Optimization
TL;DR: Experimental results over multiple images with different range of complexity validate the efficiency of the proposed technique with regard to segmentation accuracy, speed, and robustness and demonstrate a better performance from the proposed algorithm.
82
Generation of suprasegmental information for speech using a recurrent neural network and binary gravitational search algorithm for feature selection
TL;DR: The present study used a recurrent neural network (RNN) for prosody generation and a modified mean opinion score scale was used to evaluate the intelligibility and naturalness of synthesized speech using the proposed method.
12
References
•Book
The Nature of Statistical Learning Theory
Vladimir Vapnik
- 01 Jan 1995
TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
46K
Statistical learning theory
Vladimir Vapnik
- 01 Jan 1998
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
30.4K
•Book
Neural networks for pattern recognition
Christopher M. Bishop
- 01 Jan 1995
TL;DR: This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
•Book
Principal Component Analysis
Ian T. Jolliffe
- 01 May 1986
TL;DR: In this article, the authors present a graphical representation of data using Principal Component Analysis (PCA) for time series and other non-independent data, as well as a generalization and adaptation of principal component analysis.
17.7K
Related Papers (5)
S. Balakrishnama,A. Ganapathiraju,J. Picone +2 more
- 25 Mar 1999
Yunzhu Wang,Yunli Chen +1 more
- 01 Apr 2017