Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Feature selection using genetics-based algorithm and its application to speaker identification
Date
1999-03-19
Author
Demirekler, Mübeccel
Haydar, A
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
157
views
0
downloads
Cite This
This paper introduces the use of genetics-based algorithm in the reduction of 24 parameter set (i.e the base set) to a 5,6,7,8 or 10 parameter set, for each speaker in text-independent speaker identification. The feature selection is done by finding the best features that discriminates a person from his/her two closest neighbors. The experimental results show that there is approximately 5% increase in the recognition rate when the reduced set of parameters are used. Also the amount of calculation necessary for speaker recognition using the reduced set of features is much less than the amount of calculation required using the complete feature set in the testing phase. Hence it is more desirable to use the subset of the complete feature set found using the genetic algorithm suggested.
Subject Keywords
Covariance matrix
,
Cepstral analysis
,
Training data
,
Speaker recognition
,
Testing
,
Genetic algorithms
,
Impedance matching
,
Speech
,
Linear predictive coding
,
Gaussian distribution
URI
https://hdl.handle.net/11511/57587
DOI
https://doi.org/10.1109/icassp.1999.758129
Conference Name
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99
Collections
Graduate School of Natural and Applied Sciences, Conference / Seminar
Suggestions
OpenMETU
Core
Speaker identification through use of features selected using genetic algorithm
Haydar, A; Demirekler, Mübeccel; Yurtseven, MK (Institution of Engineering and Technology (IET), 1998-01-08)
The authors introduce the use of a genetic algorithm in the reduction of a 24 parameter (12 LPC derived cepstral coefficients +12 Delta-cepstral coefficients) set to a five, six, seven, eight or ten parameter set, for each speaker in text-independent speaker identification. The experimental results show that there is similar to 5% increase in the recognition rate when the reduced set of parameters is used.
Speaker identification by combining multiple classifiers using Dempster-Shafer theory of evidence
Altincay, H; Demirekler, Mübeccel (2003-11-01)
This paper presents a multiple classifier approach as an alternative solution to the closed-set text-independent speaker identification problem. The proposed algorithm which is based on Dempster-Shafer theory of evidence computes the first and Rth level ranking statistics. Rth level confusion matrices extracted from these ranking statistics are used to cluster the speakers into model sets where they share set specific properties. Some of these model sets are used to reflect the strengths and weaknesses of t...
Speech conversion using MELP speech coding algorithm
Salor, O; Demirekler, Mübeccel (2004-04-30)
In this work, MELP (Mixed Excitation Linear Prediction) speech coding algorithm has been used for speech conversion. Speech conversion aims to modify the speech of one speaker such that the modified speech sounds as if spoken by another speaker. Speech modeling of MELP has been used to derive a mapping the between the speech models of the two speakers. We have obtained a mapping which provides a context-free speech conversion. We have mainly considered the spectral properties of the speakers. Using the 230 ...
Occlusion aware stereo matching with o(1) complexity /
Gürbüz, Yeti Ziya; Alatan, Abdullah Aydın; Department of Electrical and Electronics Engineering (2014)
The problem of joint reduction of computational complexities of local stereo matching methods due to both cost aggregation step and correspondence search range is addressed and a novel hierarchical stereo matching algorithm is presented. The proposed approach exploits edge aware recursive volume filtering with a reduction on correspondence search range. The fastest state-of-the-art edge aware recursive filters are modified so that they become applicable to the methods to reduce the complexity in corresponde...
A Low-Complexity Graph-Based LMMSE Receiver for MIMO ISI Channels With M-QAM Modulation
Sen, Pinar; Yılmaz, Ali Özgür (2017-02-01)
In this paper, we propose a low complexity graph-based linear minimum mean-square-error (LMMSE) equalizer in order to remove inter-symbol and inter-stream interference in a multiple input multiple output (MIMO) communication. The proposed state space representation inflicted on the graph provides linearly increasing computational complexity with block length. In addition, owing to the Gaussian assumption used in the presented cycle-free factor graph, the complexity of the suggested equalizer structure is no...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Demirekler and A. Haydar, “Feature selection using genetics-based algorithm and its application to speaker identification,” presented at the 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99, Phoenix, AZ, USA, 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57587.