Adaptive Threshold Estimation of Open Set Voiceprint Recognition Based on OTSU and Deep Learning ()

Xudong Li^{1,2}, Xinjia Yang^{1,2}, Linhua Zhou^{1,2*}

^{1}School of Science, Changchun University of Science and Technology, Changchun, China.

^{2}Provincial Demonstration Center for Experimental Mathematics Education (Changchun University of Science and Technology), Changchun, China.

**DOI: **10.4236/jamp.2020.811197
PDF
HTML XML
478
Downloads
1,235
Views
Citations

Aiming at the problem of open set voiceprint recognition, this paper proposes an adaptive threshold algorithm based on OTSU and deep learning. The bottleneck technology of open set voiceprint recognition lies in the calculation of similarity values and thresholds of speakers inside and outside the set. This paper combines deep learning and machine learning methods, and uses a Deep Belief Network stacked with three layers of Restricted Boltzmann Machines to extract deep voice features from basic acoustic features. And by training the Gaussian Mixture Model, this paper calculates the similarity value of the feature, and further determines the threshold of the similarity value of the feature through OTSU. After experimental testing, the algorithm in this paper has a false rejection rate of 3.00% for specific speakers, a false acceptance rate of 0.35% for internal speakers, and a false acceptance rate of 0 for external speakers. This improves the accuracy of traditional methods in open set voiceprint recognition. This proves that the method is feasible and good recognition effect.

Share and Cite:

Li, X. , Yang, X. and Zhou, L. (2020) Adaptive Threshold Estimation of Open Set Voiceprint Recognition Based on OTSU and Deep Learning. *Journal of Applied Mathematics and Physics*, **8**, 2671-2682. doi: 10.4236/jamp.2020.811197.

1. Introduction

Voiceprint recognition is a biometric authentication technology that recognizes the identity based on the human body’s own voice characteristics. According to different recognition methods, voiceprint recognition can be divided into two categories: voiceprint verification and voiceprint identification. Voiceprint confirmation is to judge whether a certain speech is spoken by a specific speaker, and voiceprint identification is to judge which person in the set of persons to be identified speaks a certain speech. Voiceprint recognition is generally expounded from two aspects. One is closed-set voiceprint recognition, that is, all the speaker’s voices already exist in the model library, and the voice features to be tested are matched with all the speakers in the model library, and the one with highest matching degree is the one to be asked; the other is open-set voiceprint recognition, that is, the voice feature to be tested may not be in the trained model library, which requires a threshold to decide whether to accept or reject. There are two commonly used thresholds: classic threshold and dynamic threshold. The classical threshold [1] is determined by the two error rates of false rejection rate (False Rejection Rate, FRR) and false acceptance rate (False Acceptance Rate, FAR) of falsely rejecting speakers within the set. Generally, the corresponding threshold is used when FRR and FAR have the same value, but sufficient training samples are required to achieve good results. If the training data sample is too small, the point where FRR and FAR are equal may not be obtained, so the threshold is less robust, resulting in reduced system recognition performance. Dynamic threshold [2] is to train a model for each trained speaker in the training stage, calculate the corresponding threshold for each speaker, and compare the test voice with each threshold during recognition. Firstly, the amount of calculation is large and the training time is long; secondly, when the number of training speaker increases, an infinite number of distributions cannot be distinguished in a limited space, and the possibility of overlapping distributions increases. In the testing phase, the voice to be tested must be matched with all the trained models, which also has the problem of time-consuming and high space complexity. This paper intends to determine the threshold by calculating the similarity of the training speech, so as to avoid the problems of poor robustness of the classical threshold and the large amount of calculation of the dynamic threshold matching distance.

The essence of voiceprint recognition is the process of converting acoustic signals into electrical signals and then performing pattern recognition. The original speech signal is a time-varying signal that contains a lot of redundant information, it must undergo a certain transformation to remove the redundant information in the speech, extract the personality parameters that can characterize the speaker, and then recognize it through pattern recognition and recognition algorithm. The features used for voiceprint recognition are mainly time-domain feature parameters such as energy or amplitude in the time domain, zero-crossing rate, and transform domain feature parameters obtained by performing certain transformations on the original speech signal after framing the original speech signal. Such as linear prediction coefficient, linear prediction cepstrum coefficient [3], and Mel cepstrum coefficient [4]. There are many models for voiceprint recognition, such as dynamic time warping method [5], Hidden Markov Model method [6], vector quantization method [7] and artificial neural network [8] are widely used in voiceprint recognition. In the 1990s, the introduction of Gaussian Mixture-General Background Model and Support Vector Machine [9] enabled voiceprint recognition to enter a new stage of development. Joint factor analysis based on i-vector technology [10], disturbance attribute interference algorithm, eigen channel analysis, these methods improve the robustness of voiceprint recognition. In recent years, DNN [11] [12] has been successfully applied in acoustic modeling. Based on the powerful learning ability of deep learning and the ability to mine deep features of data, voiceprint recognition has gradually transitioned from traditional machine learning to deep learning. Scholars are still trying to combine machine learning and deep learning to achieve better results.

Traditional voiceprint recognition generally uses Gaussian Mixed Model (GMM) [13] [14] and Gaussian Mixture-General Background Model. Because it is very sensitive to noise and belongs to shallow and incomplete learning, the accuracy of model recognition decreases as the number of people increases, the robustness is poor, and the convergence is difficult. DNN has strong expression ability and a high tolerance for noise. Therefore, Deep Belief Network (DBN) is used to extract deep acoustic features and then GMM is used to recognize voiceprints, thereby improving the accuracy of open set voiceprint recognition. Based on the deep acoustic features, this paper proposes an algorithm for determining the adaptive threshold. The experimental results show that the threshold determined by the algorithm has a good performance in the performance of open set voiceprint recognition.

2. OTSU-Based Approach for Threshold Calculation

OTSU [15] [16] was proposed by Japanese scholar Otsu in 1979. It is also called the maximum between-class variance method. This algorithm uses the maximum between-class variance of the average pixel values of the foreground area and the background area as the criterion to calculate the threshold. Based on the idea of OTSU, this paper divides the random number set generated by two different random variables with a certain distance in space into two parts A and B, and calculates the variance of the two parts. The greater the variance, the better the segmentation effect. The maximum variance under different segmentation conditions is obtained by traversal, and the optimal threshold is determined to achieve a good segmentation of the two sets of random numbers.

For a set of random numbers with a total of N, L represents the maximum value of random numbers, ${n}_{i}$ represents the number of random numbers as i, ${p}_{i}$ represents the probability of random numbers being i, then ${p}_{i}$ is

${p}_{i}={n}_{i}/N$. (1)

Take the threshold T. The proportion of the number belonging to the random number set A to the total random number is recorded as ${\omega}_{0}$, and the average value ${u}_{0}$.

${\omega}_{0}={\displaystyle \underset{i}{\overset{T}{\sum}}{p}_{i}}$, ${u}_{0}={\displaystyle \underset{i}{\overset{T}{\sum}}i{p}_{i}/{\omega}_{0}}$. (2)

The proportion of the number belonging to the random number set B to the total random number is recorded as ${\omega}_{1}$, and the average value is ${u}_{1}$.

${\omega}_{1}=1-{\omega}_{0}$, ${u}_{1}={\displaystyle \underset{i=T}{\overset{L}{\sum}}i{p}_{i}/{\omega}_{1}}$. (3)

The average of the set of random number u is

$u={\omega}_{0}{u}_{0}+{\omega}_{1}{u}_{1}$. (4)

The maximum between-class variance is ${\sigma}^{\text{2}}$ :

${\omega}_{\text{0}}{\left({u}_{0}-u\right)}^{2}+{\omega}_{1}{\left({u}_{1}-u\right)}^{2}$. (5)

The greater the variance between classes, the better the threshold for dividing the set of random numbers is selected. One only need to traverse all i values, calculate the variance of each step, and select the value T of the largest ${\sigma}^{2}$. The best threshold expression is

${T}^{*}=\mathrm{arg}\mathrm{max}\left({\sigma}_{i}^{2}\right)$. (6)

3. Deep Feature Extraction and GMM Similarity Calculation

3.1. DBN-Based Deep Voiceprint Feature Extraction

DBN is obtained by superimposing Restricted Boltzmann Machines (RBM) [17] [18]. Compared with traditional shallow networks, DBN has a better ability to mine potential features of data. Therefore, DBN can be used as a voiceprint depth feature extractor for voiceprint recognition. In the voiceprint recognition task, the MFCC of the input voice is not a binary value, but some real value. The traditional RBM cannot achieve the expected goal. Usually, the voiceprint feature extraction uses the Gauss-Bernoulli RBM model.

1) RBM Structure

RBM is a Markov random field based on an energy function, composed of a visible layer and a hidden layer. When the visible neuron $v=\left\{{v}_{i}\right\},i\in {d}_{v}$ is in the Gaussian distribution state and the hidden layer neuron $h=\left\{0,1\right\},j\in {d}_{h}$ is in the binary state, the connection relationship between the visible layer and the hidden layer is represented by the matrix $W=\left\{{w}_{ij}\right\}$, and the model parameters are: $\theta =\left\{{w}_{ij},{a}_{i},{b}_{j},{\sigma}_{i}\right\}$.

Based on the energy model theory, the energy of Gauss-Bernoulli RBM is defined as:

$E\left(v,h|\theta \right)={\displaystyle \underset{i\in {d}_{v}}{\sum}\frac{{\left({v}_{i}-{a}_{i}\right)}^{2}}{2{\sigma}_{i}^{2}}}-{\displaystyle \underset{j\in {d}_{h}}{\sum}{b}_{j}{h}_{j}-{\displaystyle \underset{i,j}{\sum}\frac{{v}_{i}}{{\sigma}_{i}}{h}_{j}}}{w}_{ij}$, (7)

In which, ${w}_{ij}$ is the weighted coefficient, ${a}_{i}$ and ${b}_{j}$ are the visible layer unit and hidden layer unit corresponding offset. ${\sigma}_{i}$ refers to the standard deviation of visual layer unit, and ${d}_{v}$ and ${d}_{h}$ are the number of units of visible layer and hidden layer. From the above formula, the joint probabilities of v and h can be obtained as shown below:

$p\left(v,h|\theta \right)=\frac{\mathrm{exp}\left(-E\left(v,h|\theta \right)\right)}{Z\left(\theta \right)},Z\left(\theta \right)={\displaystyle \underset{v,n}{\sum}\mathrm{exp}\left(-E\left(v,h|\theta \right)\right)}$, (8)

In which $Z\left(\theta \right)$ is the partition function, which is used for normalization and calculation of all possible energy allocation between visible and hidden layer neurons. When training RBM, the conditional independence between the visible neurons and the hidden neurons, the conditional probabilities of v and h can be obtained as shown below:

$p\left({h}_{j}=1|v\right)=\text{sigmoid}\left({\displaystyle \underset{i\in {d}_{v}}{\sum}\frac{{v}_{i}}{{\sigma}_{i}}{w}_{ij}+{b}_{j}}\right)$, (9)

$p\left({v}_{i}=x|h\right)=N\left({\sigma}_{i}{\displaystyle \underset{j\in {d}_{h}}{\sum}{w}_{ij}{h}_{j}+{a}_{i},{\sigma}_{i}^{2}}\right)$, (10)

In the formula, $\text{sigmoid}\left(x\right)=1/\left(1+\mathrm{exp}\left(-x\right)\right)$ is the activation function, $N\left(\mu ,\sigma \right)$ refers to the Gaussian distribution of the average value $\mu $ and the standard variance $\sigma $.

In order to solve the problem of training speed of RBM, Hinton proposed the contrast divergence algorithm [19], which approximates the true value by Gibbs sampling, and cannot converge directly.

The update criterion of RBM parameters are as follows:

$\Delta {w}_{ij}=\epsilon \left({\langle {v}_{i}{h}_{j}\rangle}_{data}-{\langle {v}_{i}{h}_{j}\rangle}_{recon}\right)$, (11)

$\Delta {a}_{i}=\epsilon \left({\langle {v}_{i}\rangle}_{data}-{\langle {v}_{i}\rangle}_{recon}\right)$, (12)

$\Delta {b}_{j}=\epsilon \left({\langle {h}_{j}\rangle}_{data}-{\langle {h}_{j}\rangle}_{recon}\right)$. (13)

In the formula,
$\epsilon $ is the learning rate, “*data*” represents the expectation of training data, and “*recon*” represents the expectation of model distribution.

2) DBN training

When training a multi-layer DBN, MFCC extracted from speech is used as the input of the first RBM, and the RBM is trained one by one by using unsupervised learning method. The train RBMs are stacked together, which is the pre training of DBN. Then, BP algorithm [20] is used to fine tune the parameters of each layer of DBN, and the error is transmitted back to correct it.

3) Voiceprint depth feature extraction

First, normalize the input original 24-dimensional MFCC features to make the feature distribution of each speaker satisfy ${\mu}_{i}=0$ and ${\sigma}_{i}=1$. This can avoid the re-estimation of the training sample distribution. DNN is composed of 3 RBMs, the network structure is 24-256-256-256, the output layer is the softmax function, and the voiceprint depth feature output layer takes the last hidden layer. Through this network, the 24-dimensional MFCC features can be converted into 256-dimensional deep acoustic features.

3.2. Speaker Identification Based on DBN-GMM

In the DBN-GMM open set voiceprint recognition model, it is first necessary to denoise and frame the speech signal, extract MFCC from it, then extract deep acoustic features from MFCC through DBN, and finally use GMM to confirm the speaker. In the training phase of the model, a GMM is established for each speaker in the set. The purpose of training is to estimate the parameters of the GMM. In the recognition phase of the model, the speech features to be tested are calculated with the sequence in the model library. The maximum value corresponds to the identified speaker.

GMM is a linear combination of several Gaussian functions used to represent the spatial distribution of acoustic features of each speaker’s training speech. Suppose the input voice feature of a speaker is $X=\left\{{x}_{1},{x}_{2},\cdots ,{x}_{N}\right\}$, and ${x}_{i}$ is the D-dimensional feature vector. Then the GMM with the M blending degree of the speech feature training can be expressed as:

$p\left(x|\theta \right)={\displaystyle \underset{k=1}{\overset{M}{\sum}}{w}_{k}{p}_{k}\left(x|{\theta}_{k}\right)}$, $\underset{k=1}{\overset{M}{\sum}}{w}_{k}=1$, (14)

${w}_{k}$ is the weighted factor of ${p}_{k}\left({x}_{i}|{\theta}_{k}\right)$, ${p}_{k}\left({x}_{i}|{\theta}_{k}\right)$ is the k Gaussian distribution model, which satisfies the following formula:

${p}_{k}\left({x}_{i}|{\theta}_{k}\right)=\frac{1}{{\left(2\pi \right)}^{D/2}{\left|{\Sigma}_{k}\right|}^{1/2}}\mathrm{exp}\left\{-\frac{1}{2}{\left(x-{u}_{k}\right)}^{\prime}{\left({\Sigma}_{k}\right)}^{-1}\left(x-{u}_{k}\right)\right\}$, (15)

In the formula,
${u}_{k}$ is the average value, and
${\Sigma}_{k}$ is the covariance matrix. Therefore, GMM can be expressed by the parameter
$\theta =\left\{{w}_{k},{u}_{k},{\Sigma}_{k}\right\}$.* *

For the module parameter $\theta $, usually maximum likelihood estimation is used to solve the problem, expressed as follows:

${\theta}^{*}=\underset{\theta}{\mathrm{arg}\mathrm{max}}p\left(X|\theta \right)=\underset{\theta}{\mathrm{arg}\mathrm{max}}{\displaystyle \underset{i=1}{\overset{N}{\prod}}p\left({x}_{i}|\theta \right)}$. (16)

Due to the hidden variables in the model, it is difficult to solve the parameters, so EM algorithm is usually used to solve the parameters.

${w}_{k}=\frac{{\displaystyle \underset{i=1}{\overset{N}{\sum}}p\left(k|{x}_{i},\theta \right)}}{N}$, ${u}_{k}=\frac{{\displaystyle \underset{i=1}{\overset{N}{\sum}}{x}_{i}p\left(k|{x}_{i},\theta \right)}}{{\displaystyle \underset{i=1}{\overset{N}{\sum}}p\left(k|{x}_{i},\theta \right)}}$, ${\Sigma}_{k}=\frac{{\displaystyle \underset{i=1}{\overset{N}{\sum}}p\left(k|{x}_{i},\theta \right){\left({x}_{i}-{u}_{k}\right)}^{2}}}{{\displaystyle \underset{i=1}{\overset{N}{\sum}}p\left(k|{x}_{i},\theta \right)}}$. (17)

DBN-GMM uses the deep acoustic features extracted by DBN as the input of GMM. Each speaker’s voice features form a specific distribution in a specific space, and these distributions can be used to describe the personality characteristics of the speaker. By training the GMM, we can obtain the GMM similarity value with a high degree of distinction between those who belong to the set and those who do not belong to the set. Figure 1 below is the result obtained by the No. 2 speaker using a GMM with a mixing degree of 4.

4. Open-Set Speaker Recognition Experiment Based on OTSU

4.1. Speech Data Set and Acoustic Feature Description

The audio used in the experiment is the Chinese speech data (THCHS-30) published by CSLT of Tsinghua University. In order to find the best model and the parameters corresponding to the model, this paper divides the data into training set, development set and test set (see Table 1 Shown), in which there are 8 people in the training set and 8 audios per person. The development set and the training set are the same 8 people, each with 20 audios; the test set has 10 people (8 within and 2 outside), and each has 60 audios.

The basic acoustic feature is that the frame length is 30 ms, the frame shift is 15 ms, and the first-order difference 24-dimensional MFCC feature is spliced. Assuming that a certain audio segment has n frames, and the MFCC parameter

of each frame is ${x}_{i}\left(i=1,2,\cdots ,n\right)$, the MFCC of this audio segment is recalculated as $\underset{i=1}{\overset{n}{\sum}}\frac{{x}_{i}}{n}$.

DBN uses three-layer RBM (network nodes: 24-256-256-256) stacking, and the output value of the last layer of 256 nodes is used as the deep acoustic feature obtained by the 24-dimensional MFCC after DBN feature extraction.

4.2. OTSU Adaptative Threshold Method Based on DBN-GMM

In the DBN-GMM of a certain speaker, the signal similarity value of the speaker after inspection is approximately subject to a normal distribution, while the signal similarity values of other speakers approximately obey the gamma distribution (as shown in Figure 2). Since there are fewer voices that can participate in training in practice, and the signal similarity value is not enough to accurately represent the distribution of similarity values, two sets of random numbers are

Figure 1. GMM similarity value distribution diagram of speakers inside and outside the training set and the development set.

Table 1. Number of Speakers in and out of the Training Set, Development Set, and Test Set.

generated according to the distribution of the similarity values of the speaker and other speakers (The histogram is shown in Figure 3). Finally, OTSU is used to determine the threshold in the random number set.

The specific implementation steps are as follows:

1) The 24-dimensional basic acoustic features MFCC are trained by DBN to obtain 256-dimensional deep acoustic features.

2) The 256-dimensional deep acoustic feature is used as the input of GMM to calculate the similarity value of the feature. The average value of the similarity value of the feature outside the set is L_{1}, and the average value of the signal similarity value in the set is L_{2}, and the distribution of similarity values in the set and outside the set is checked according to the similarity values.

Figure 2. Distribution of similarity values within and outside the set.

Figure 3. Similarity value histogram.

Figure 4. The relationship between false rejection rate and false acceptance rate.

3) According to the distribution of the similarity values of the speaker and other speakers, 1000 random numbers are generated, and the restriction condition is that the maximum value of the random numbers generated by the other speakers is not greater than the minimum value of the similarity value of the speaker. The minimum value of the random number generated by the speaker is not less than the maximum value of the similarity of other speakers.

4) Calculate the probability ${p}_{i}$ and average u of each similarity value i in the generated random number set.

5) Calculate the ratio of the similarity value of the speaker and the similarity value of other speakers to the total random number ${\omega}_{0}\left(t\right)$ and ${\omega}_{1}\left(t\right)$, and the average value of the similarity value ${u}_{0}\left(t\right)$ and ${u}_{1}\left(t\right)$.

6) Calculate the value of ${\sigma}^{2}$ according to formula (5), where the value range of t is ( ${L}_{1}$, ${L}_{2}$ ), and record the values of ${\sigma}^{2}$ and t.

7) Compare the value of ${\sigma}^{2}$, when ${\sigma}^{2}$ is the largest, calculate the t value at this time. When t takes this value, the variance between classes takes the maximum value, and a good distinction is achieved between inside and outside the set.

4.3. Experimental Results and Analysis

Tables 2-6 show the threshold determined by the method of OTSU, and the result of 5-ford cross-validation. The false acceptance rate of the speakers in the set is 0.35%, and the false rejection rate of the specific speakers is 3.00%. The false acceptance rate of outside speakers is 0.

Currently, the “equivalent error rate” is commonly used to determine the threshold. The calculation formulas for the false rejection rate and false reception rate are as follows.

False rejection rate = the number of corpus of speakers i that are falsely rejected/the number of corpus of speakers i that should be accepted. False acceptance rate = the number of corpus of other speakers who were incorrectly

Table 2. Model recognition rate of No. 1 and No. 2 speakers outside the set.

Table 3. Model recognition rate of No. 3 and No. 4 speakers outside the set.

Table 4. Model recognition rate of No. 5 and No. 6 speakers outside the set.

Table 5. Model recognition rate of No. 7 and No. 8 speakers outside the set.

Table 6. Model recognition rate of No. 9 and No. 10 speakers outside the set.

accepted/the number of corpus of other speakers that should be rejected. Under the same experimental conditions, after experimental testing, the algorithm of equal error rate calculation threshold has a false rejection rate of 3.96% for specific speakers, a false acceptance rate of 0.38% for within speakers, and a false acceptance rate of 0.73% for outside speakers.

The experimental results show that the proposed method based on the DBN-GMM model combined with OTSU to determine the threshold has a recognition rate of 99.32% for the speakers in the set, and a rejection rate of 100% for the speakers outside the set. The method of equal error rate has a recognition rate of 99.18% for within speakers and a rejection rate of 98.54% for outside speakers. Although the time complexity of the algorithm in this paper is $O\left(n\right)$, if N random numbers are generated, the optimal threshold requires $N\left(N+1\right)$ addition and subtraction operations, 4N times multiplication and division operations, and N times squaring operations, which requires a large amount of calculation. However, this algorithm is better than the traditional equal error rate method in the case of a small increase in complexity, whether it is the identification of within speakers or the rejection of outside speakers.

5. Conclusion

This paper studies the determination of the open set Voiceprint recognition threshold and proposes a dynamic threshold calculation model for the open set voiceprint recognition based on OTSU. This model has strong characterization ability for data, which further improves the recognition effect. In view of the insufficient mining of interlocutor’s personality characteristics and poor modeling ability in traditional GMM-based recognition, a voiceprint recognition model combining DBN and GMM is proposed, and a nonlinear RBM-based DBN deep learning model is constructed. Its powerful modeling capabilities can dig out deep-level information of features, which is more suitable for voiceprint recognition. The GMM is trained to calculate the similarity value of the signal, and OTSU is used to calculate the maximum inter-class variance of the signal similarity value to determine the threshold, and it is tested and verified in the CSLT public voice database. Experimental results show that the algorithm for determining the threshold described in this article has higher recognition accuracy than the algorithm for determining the threshold with an equal error rate, and this method is feasible.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

[1] |
Jagadiswary, D. and Saraswady, D. (2016) Biometric Authentication Using Fused Multimodal Biometric. Procedia Computer Science, 85, 109-116. https://doi.org/10.1016/j.procs.2016.05.187 |

[2] | Lin, L., Wang, S.X. and Wang, X.L. (2006) Real-Time Implementation of Open Set Speaker Recognition System Based on DSP. Journal of Jilin University (Information Science Edition), No. 24, 252-258. (In Chinese) |

[3] |
Atal, B.S. (1974) Effectiveness of Linear Prediction Characteristics of the Speech Wave for Automatic Speaker Identification and Verification. Journal of the Acoustical Society of America, 55, 1304-1312. https://doi.org/10.1121/1.1914702 |

[4] |
Lokesh, S. and Ramya Devi, M. (2019) Speech Recognition System Using Enhanced Mel Frequency Cepstral Coefficient with Windowing and Framing Method. Cluster Computing, 22, 11669-11679. https://doi.org/10.1007/s10586-017-1447-6 |

[5] |
Geppener, V.V., Simonchik, K.K. and Haidar, A.S. (2007) Design of Speaker Verification Systems with the Use of an Algorithm of Dynamic Time Warping (DTW). Pattern Recognition and Image Analysis, 17, 470-479. https://doi.org/10.1134/S1054661807040050 |

[6] |
Zeinali, H., Sameti, H. and Burget, L. (2017) HMM-Based Phrase-Independent i-Vector Extractor for Text-Dependent Speaker Verification. IEEE/ACM Transactions on Audio, Speech, and Language Processing, 25, 1421-1435. https://doi.org/10.1109/TASLP.2017.2694708 |

[7] |
Soong, F. and Rosenberg, A. (1988) On the Use of Instantaneous and Transitional Spectral Information in Speaker Recognition. IEEE Transactions on Acoustics, Speech Signal Processing, 36, 871-879. https://doi.org/10.1109/29.1598 |

[8] |
Dey, N.S., Mohanty, R. and Chugh, K.L. (2012) Speech and Speaker Recognition System Using Artificial Neural Networks and Hidden Markov Model. 2012 International Conference on Communication Systems and Network Technologies, Rajkot, 11-13 May 2012, 311-315. https://doi.org/10.1109/CSNT.2012.221 |

[9] | Wan, V. and Campbell, W.M. (2000) Support Vector Machines for Speaker Verification and Identification. Neural Networks for Signal Processing X. Proceedings of the 2000 IEEE Signal Processing Society Workshop, Vol. 2, 775-784. |

[10] |
Ghahabi, O. and Hernando, J. (2017) Deep Learning Backend for Single and Multisession I-Vector Speaker Recognition. IEEE ACM Transactions on Audio Speech and Language Processing, 25, 807-817. https://doi.org/10.1109/TASLP.2017.2661705 |

[11] |
Zhu, H., Akrout, M., Zheng, B., et al. (2018) Benchmarking and Analyzing Deep Neural Network Training. IEEE International Symposium on Workload Characterization, Raleigh, 30 September-2 October 2018, 88-100. https://doi.org/10.1109/IISWC.2018.8573476 |

[12] |
Le Cun, Y. and Bengio, Y. (2015) Hinton G. Deep Learning. Nature, 521, 436-444. https://doi.org/10.1038/nature14539 |

[13] |
Sadıç, S. and Gülmezoğlu, M.B. (2011) Common Vector Approach and Its Combination with GMM for Text-Independent Speaker Recognition. Expert Systems with Applications, 38, 11394-11400. https://doi.org/10.1016/j.eswa.2011.03.009 |

[14] |
Reynolds, D.A. (1995) Speaker Identification and Verification Using Gaussian Mixture Speaker Models. Speech Communication, 17, 91-108. https://doi.org/10.1016/0167-6393(95)00009-D |

[15] |
Otsu, N. (1979) A Threshold Selection Method from Gray-Level Histograms. IEEE Transactions on Systems, Man, and Cybernetics, 9, 62-66. https://doi.org/10.1109/TSMC.1979.4310076 |

[16] |
Xu, X.Y., Xu, S.Z., Jin, L.H., et al. (2011) Characteristic Analysis of Otsu Threshold and Its Applications. Pattern Recognition Letters, 32, 956-961. https://doi.org/10.1016/j.patrec.2011.01.021 |

[17] |
Hinton, G.E. and Salakhutdinov, R.R. (2006) Reducing the Dimensionality of Data with Neural Networks. Science (New York, N.Y.), 313, 504-507. https://doi.org/10.1126/science.1127647 |

[18] |
Hinton, G.E. (2002) Training Products of Experts by Minimizing Contrastive Divergence. Neural Computation, 14, 1771-1800. https://doi.org/10.1162/089976602760128018 |

[19] |
Hinton, G.E., Osindero, S. and The, Y.W. (2006) A Fast Learning Algorithm for Deep Belief Nets. Neural Computation, 18, 1527-1554. https://doi.org/10.1162/neco.2006.18.7.1527 |

[20] |
Achkar, R., El-Halabi, M., Bassil, E., et al. (2016) Voice Identity Finder Using the Back Propagation Algorithm of an Artificial Neural Network. Procedia Computer Science, 95, 245-252. https://doi.org/10.1016/j.procs.2016.09.322 |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.