. "23520" . "619419" . . . "RIV/49777513:23520/03:00000074!RIV07-GA0-23520___" . . . . "Porovn\u00E1n\u00ED n\u011Bkolika procedur verifikace \u0159e\u010Dn\u00EDka zalo\u017Een\u00FDch na GMM"@cs . . "P(GA102/02/0124), Z(MSM 235200004)" . "The paper deals with the dependence between the speaker identification performance and the amount of test data. Three speaker identification procedures based on hidden Markov models (HMMs) of phonemes are presented here. One, which is quite commonly used in the speaker recognition systems based on HMMs, uses the likelihood of the whole utterance for speaker identification. The other two that are proposed in this paper are based on the majority voting rule. The experiments were performed for two different situations: either both training and test data were obtained from the same channel, or they were obtained from different channels. All experiments show that the proposed speaker identification procedure based on the majority voting rule for sequences of phonemes allows us to reduce the amount of test data necessary for successful speaker identification."@en . . . . "\u010Cl\u00E1nek pojedn\u00E1v\u00E1 o z\u00E1vislosti mezi identifikac\u00ED \u0159e\u010Dn\u00EDka a mno\u017Estv\u00EDm dat pro testov\u00E1n\u00ED. V \u010Dl\u00E1nku jsou prezentov\u00E1ny t\u0159i identifika\u010Dn\u00ED procedury."@cs . "On the Amount of Speech Data Necessary for Successful Speaker Identification"@en . "RIV/49777513:23520/03:00000074" . "CH - \u0160v\u00FDcarsk\u00E1 konfederace" . "2"^^ . "Eurospeech" . "On the Amount of Speech Data Necessary for Successful Speaker Identification"@en . . "0" . "On the Amount of Speech Data Necessary for Successful Speaker Identification" . "[9CE59D698617]" . "3021" . "4"^^ . "On the Amount of Speech Data Necessary for Successful Speaker Identification" . "Padrta, Ale\u0161" . "2003" . "2"^^ . "speaker identification; closed set; reduction of amount of test data; HMM based approach"@en . . "1018-4074" . "Porovn\u00E1n\u00ED n\u011Bkolika procedur verifikace \u0159e\u010Dn\u00EDka zalo\u017Een\u00FDch na GMM"@cs . . . . "The paper deals with the dependence between the speaker identification performance and the amount of test data. Three speaker identification procedures based on hidden Markov models (HMMs) of phonemes are presented here. One, which is quite commonly used in the speaker recognition systems based on HMMs, uses the likelihood of the whole utterance for speaker identification. The other two that are proposed in this paper are based on the majority voting rule. The experiments were performed for two different situations: either both training and test data were obtained from the same channel, or they were obtained from different channels. All experiments show that the proposed speaker identification procedure based on the majority voting rule for sequences of phonemes allows us to reduce the amount of test data necessary for successful speaker identification." . . "Radov\u00E1, Vlasta" . . . .