![]() |
Volumn 3, Issue , 2000, Pages 1599-1602
|
An optimal Bhattacharyya centroid algorithm for Gaussian clustering with applications in automatic speech recognition
|
Author keywords
[No Author keywords available]
|
Indexed keywords
CLUSTER COMPUTING;
CLUSTERING ALGORITHMS;
GAUSSIAN DISTRIBUTION;
HIDDEN MARKOV MODELS;
MARKOV PROCESSES;
MAXIMUM LIKELIHOOD;
PROBABILITY DISTRIBUTIONS;
SIGNAL PROCESSING;
SPEECH PROCESSING;
TRELLIS CODES;
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
DECODING;
ITERATIVE METHODS;
MATHEMATICAL MODELS;
MATRIX ALGEBRA;
MAXIMUM LIKELIHOOD ESTIMATION;
OPTIMIZATION;
PROBABILITY;
SPEECH CODING;
VECTOR QUANTIZATION;
AUTOMATIC SPEECH RECOGNITION;
BHATTACHARYYA DISTANCE;
CENTROID ALGORITHM;
ERROR RATE REDUCTION;
MEMORY CONSUMPTION;
RECOGNITION ACCURACY;
RUN TIME COMPLEXITY;
VECTOR QUANTIZATION ALGORITHMS;
SPEECH RECOGNITION;
AUTOMATIC SPEECH RECOGNITION;
GAUSSIAN CLUSTERING;
HIDDEN MARKOV MODEL;
OPTIMAL BHATTACHARYYA CENTROID ALGORITHM;
|
EID: 0033708111
PISSN: 15206149
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICASSP.2000.861998 Document Type: Conference Paper |
Times cited : (17)
|
References (7)
|