[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing 1991
DOI: 10.1109/icassp.1991.150358
|View full text |Cite
|
Sign up to set email alerts
|

Text-independent talker identification with neural networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

1995
1995
2019
2019

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 47 publications
(23 citation statements)
references
References 3 publications
0
23
0
Order By: Relevance
“…If the average output value is bigger than a threshold, the speaker is accepted (Oglesby and Mason, 1990). Rudasi and Zahorian (1991) demonstrated that by using small binary networks for distinguishing between two speakers instead of one large network with one output for each known speaker, the performance in speaker recognition was much better, since the binary networks were much more specialised. Another kind of networks, the time-delay neural networks (TDNN), were developed by Bennani and Gallinari (1991) to capture transient information using a connectionist approach.…”
Section: Gaussian Mixture Modelsmentioning
confidence: 99%
“…If the average output value is bigger than a threshold, the speaker is accepted (Oglesby and Mason, 1990). Rudasi and Zahorian (1991) demonstrated that by using small binary networks for distinguishing between two speakers instead of one large network with one output for each known speaker, the performance in speaker recognition was much better, since the binary networks were much more specialised. Another kind of networks, the time-delay neural networks (TDNN), were developed by Bennani and Gallinari (1991) to capture transient information using a connectionist approach.…”
Section: Gaussian Mixture Modelsmentioning
confidence: 99%
“…Others are not suited to handle a large number of classes. On the other hand, even when using an approach which can deal with large scale problems, an adequate decomposition of the classification problem into subproblems can be favorable to the overall computational complexity as well as to the generalization ability of the global classifier [17,3,20].…”
Section: ]mentioning
confidence: 99%
“…The spectral/temporal features result in substantially higher classification rates for vowels than can be obtained by simply concatenating multiple frames of static features. This new feature set has been used to obtain vowel classification results of 70.9% for 16 vowels of the DARPA/TIMIT data base, higher than any other previously reported results ( [1], [4], [5]). …”
Section: Discussionmentioning
confidence: 56%
“…The pattern classification approach used in this study is called a binary paired partitioning (BPP) neural network [5,6]. This classification approach partitions an N-way classification task into N*(N-1)/2 two-way classification tasks.…”
Section: Classifiermentioning
confidence: 99%