Sciweavers

11 search results - page 1 / 3
» Code Breaking for Automatic Speech Recognition
Sort
View
ICMCS
2006
IEEE
146views Multimedia» more  ICMCS 2006»
13 years 10 months ago
Performance Analysis of Compressed-Domain Automatic Speaker Recognition as a Function of Speech Coding Technique and Bit Rate
Compressed-domain automatic speaker recognition is based on the analysis of the compressed parameters of speech coders. The objective is to perform low-complexity on-line speaker ...
Matteo Petracca, Antonio Servetti, Juan Carlos De ...
ICMCS
2005
IEEE
128views Multimedia» more  ICMCS 2005»
13 years 10 months ago
Low-complexity automatic speaker recognition in the compressed GSM AMR domain
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 modeli...
Matteo Petracca, Antonio Servetti, Juan Carlos De ...
TASLP
2008
150views more  TASLP 2008»
13 years 4 months ago
Automatic Prosodic Event Detection Using Acoustic, Lexical, and Syntactic Evidence
With the advent of prosody annotation standards such as tones and break indices (ToBI), speech technologists and linguists alike have been interested in automatically detecting pro...
Sankaranarayanan Ananthakrishnan, Shrikanth S. Nar...
LREC
2008
146views Education» more  LREC 2008»
13 years 6 months ago
ProPOSEL: A Prosody and POS English Lexicon for Language Engineering
ProPOSEL is a prototype prosody and PoS (part-of-speech) English lexicon for Language Engineering, derived from the following language resources: the computer-usable dictionary CU...
Claire Brierley, Eric Atwell