2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings
DOI: 10.1109/icassp.2006.1659987
|View full text |Cite
|
Sign up to set email alerts
|

Gaussian Selection with Non-Overlapping Clusters for ASR in Embedded Devices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…A Gaussian selection algorithm is used to speed up the evaluation of the acoustic model. As a small modification compared to [7], we generated the disjunct clusters using Euclidean distance, and used Mahalanobis distance between a feature vector and the cluster centroids to find the active clusters for each frame during decoding. The covariance of each centroid is calculated by averaging over all Gaussians' covariances that belong to the centroid's cluster.…”
Section: Pda Specific Speedup Techniquesmentioning
confidence: 99%
“…A Gaussian selection algorithm is used to speed up the evaluation of the acoustic model. As a small modification compared to [7], we generated the disjunct clusters using Euclidean distance, and used Mahalanobis distance between a feature vector and the cluster centroids to find the active clusters for each frame during decoding. The covariance of each centroid is calculated by averaging over all Gaussians' covariances that belong to the centroid's cluster.…”
Section: Pda Specific Speedup Techniquesmentioning
confidence: 99%
“…Gaussians belonging to this shortlist contribute to that frame likelihood computation. Many extensions of this work have been proposed in the literature (Gales et al (1999); Olsen (2000); Leppänen et al (2006)). They were focused on Gaussian codebook assignments.…”
Section: Contextual Gaussian Selectionmentioning
confidence: 99%