K-NN Versus Gaussian in HMM-Based Recognition System - Archive ouverte HAL
Communication Dans Un Congrès Année : 1997

K-NN Versus Gaussian in HMM-Based Recognition System

Résumé

For many years, the K-Nearest Neighbours method (K-NN) is known as one of the best probability density function (pdf) estimator. A fast K-NN algorithm has been developed and tested on the TIMIT database with a gain in computational time of 99;8%. The K-NN decision principle has been assessed on a frame by frame phonetic identification. A method to integrate K-NN estimator pdf in a HMM-based system is proposed and tested on an acoustic-phonetic decoding task. Finally, preliminary experiments are performed on the HMM topology inference.
Fichier non déposé

Dates et versions

hal-01624700 , version 1 (26-10-2017)

Identifiants

  • HAL Id : hal-01624700 , version 1

Citer

Claude Montacié, Marie-Josée Caraty, Fabrice Lefevre. K-NN Versus Gaussian in HMM-Based Recognition System. Fifth European Conference on Speech Communication and Technology, EUROSPEECH 1997, Sep 1997, Rhodes, Greece. pp.529-532. ⟨hal-01624700⟩
53 Consultations
0 Téléchargements

Partager

More