Results 1 - 10
of
6,082
Speaker verification using Adapted Gaussian mixture models
- Digital Signal Processing
, 2000
"... In this paper we describe the major elements of MIT Lincoln Laboratory’s Gaussian mixture model (GMM)-based speaker verification system used successfully in several NIST Speaker Recognition Evaluations (SREs). The system is built around the likelihood ratio test for verification, using simple but ef ..."
Abstract
-
Cited by 1010 (42 self)
- Add to MetaCart
In this paper we describe the major elements of MIT Lincoln Laboratory’s Gaussian mixture model (GMM)-based speaker verification system used successfully in several NIST Speaker Recognition Evaluations (SREs). The system is built around the likelihood ratio test for verification, using simple
Maximum likelihood linear regression for speaker adaptation of continuous density hidden Markov models
, 1995
"... ..."
REDUCING SPEAKER MODEL SEARCH SPACE IN SPEAKER IDENTIFICATION
"... For large population speaker identification (SID) systems, likelihood computations between an unknown speaker’s test feature set and speaker models can be very time-consuming and detrimental to applications where fast SID is required. In this paper, we propose a method whereby speaker models are clu ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
For large population speaker identification (SID) systems, likelihood computations between an unknown speaker’s test feature set and speaker models can be very time-consuming and detrimental to applications where fast SID is required. In this paper, we propose a method whereby speaker models
EFFICIENT SPEAKER IDENTIFICATION USING SPEAKER MODEL CLUSTERING
"... In large population speaker identification (SI) systems, like-lihood computations between an unknown speaker’s feature set and the registered speaker models can be very time-consuming and impose a bottleneck. For applications requir-ing fast SI, this is a problem. In prior work, we proposed the use ..."
Abstract
- Add to MetaCart
In large population speaker identification (SI) systems, like-lihood computations between an unknown speaker’s feature set and the registered speaker models can be very time-consuming and impose a bottleneck. For applications requir-ing fast SI, this is a problem. In prior work, we proposed the use
Speaker Model Quantization for Unsupervised Speaker Indexing
"... Speaker indexing sequentially detects points where speaker identity changes in a multi-speaker audio stream, and classifies each detected segment according to the speaker’s identity. In unsupervised speaker indexing scenarios, there is no prior information/data about the speakers in the target data. ..."
Abstract
- Add to MetaCart
. To address this issue, a predetermined generic “speaker-independent ” model set, called Sample Speaker Models (SSM), was previously proposed. While this set can be useful for more accurate speaker modeling and clustering without any target speaker models, an optimal method for sampling the models from such a
Speaker Model Clustering for Efficient Speaker Identification
- in Large Population, IEEE Transaction on Audio, Speech and Language Processing, Volume
"... Abstract—In large population speaker identification (SI) systems, likelihood computations between an unknown speaker’s feature vectors and the registered speaker models can be very time-consuming and impose a bottleneck. For applications requiring fast SI, this is a recognized problem and improvemen ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
Abstract—In large population speaker identification (SI) systems, likelihood computations between an unknown speaker’s feature vectors and the registered speaker models can be very time-consuming and impose a bottleneck. For applications requiring fast SI, this is a recognized problem
Speaker Verification Without Background Speaker Models
"... Speaker verification concerns the problem of verifying whether a given utterance has been pronounced by a claimed authorized speaker. This problem is important because an accurate speaker verification system can be applied to many security applications. In this paper, we present a new algorithm for ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
for speaker verification called OSCILLO. By applying tolerance interval analysis in statistics, OSCILLO can verify a speaker's ID without background speaker models. This greatly reduces the space requirement of the system and the time for both training and verification. Experimental results show
Maximum Likelihood Linear Transformations for HMM-Based Speech Recognition
- COMPUTER SPEECH AND LANGUAGE
, 1998
"... This paper examines the application of linear transformations for speaker and environmental adaptation in an HMM-based speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple bias ..."
Abstract
-
Cited by 570 (68 self)
- Add to MetaCart
of the constrained model-space transform from the simple diagonal case to the full or block-diagonal case. The constrained and unconstrained transforms are evaluated in terms of computational cost, recognition time efficiency, and use for speaker adaptive training. The recognition performance of the two model
A theory of lexical access in speech production
- Behavioral and Brain Research
, 1999
"... The generation of words in speech involves a number of processing stages. There is, first, a stage of conceptual preparation; this is followed by stages of lexical selection, phonological encoding, phonetic encoding and articulation. In addition, the speaker monitors the output and, if necessary, se ..."
Abstract
-
Cited by 744 (59 self)
- Add to MetaCart
The generation of words in speech involves a number of processing stages. There is, first, a stage of conceptual preparation; this is followed by stages of lexical selection, phonological encoding, phonetic encoding and articulation. In addition, the speaker monitors the output and, if necessary
Contributing to Discourse
- Cognitive Science
, 1989
"... For people to contribute to discourse, they must do more than utter the right sentence at the right time. The basic requirement is that they odd to their common ground in on orderly way. To do this, we argue, they try to establish for each utterance the mutual belief that the addressees hove underst ..."
Abstract
-
Cited by 598 (10 self)
- Add to MetaCart
understood what the speaker meant well enough for current purposes. This is accomplished by the collective actions of the current contributor and his or her partners, and these result in units of conversation called contributions. We present a model of contributions and show how it accounts for o variety
Results 1 - 10
of
6,082