2005 IEEE International Conference on Multimedia and Expo Low-complexity automatic speaker recognition in the compressed GSM AMR domain Amsterdam, Netherlands July 06-July 06 ISBN: 0-7803-9331-7
This paper presents an experimental implementation of a low-complexity speaker recognition algorithm working in the compressed speech domain. The goal is to perform speaker modeling and identification without decoding the speech bitstream to extract speaker dependent features, thus saving important system resources, for instance, in mobile devices. The compressed bitstream values of the widely used GSM AMR speech coding standard are studied to identify statistics enabling fair recognition after a few seconds of speech. Using Euclidean distance measures on elementary statistical values such as coefficient of variation and skewness of nine standard GSM AMR parameters delivers recognition accuracies close to 100% after about 20 seconds of active speech for a database of 14 speakers recorded in a normal room environment.
Index Terms:
elementary statistical value, low-complexity automatic speaker recognition, adaptive multirate code, GSM AMR, compressed domain, speaker modeling, speech bitstream, speaker dependent feature extraction, speech coding standard, Euclidean distance measure
Citation:
M. Petracca, A. Servetti, J.C. De Martin, "Low-complexity automatic speaker recognition in the compressed GSM AMR domain," icme, pp.4 pp., 2005 IEEE International Conference on Multimedia and Expo, 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb