{"id":4414,"date":"2021-02-19T06:34:24","date_gmt":"2021-02-19T06:34:24","guid":{"rendered":"https:\/\/www.aiproblog.com\/index.php\/2021\/02\/19\/voice-cloning-corentins-improvisation-on-sv2tts\/"},"modified":"2021-02-19T06:34:24","modified_gmt":"2021-02-19T06:34:24","slug":"voice-cloning-corentins-improvisation-on-sv2tts","status":"publish","type":"post","link":"https:\/\/www.aiproblog.com\/index.php\/2021\/02\/19\/voice-cloning-corentins-improvisation-on-sv2tts\/","title":{"rendered":"Voice Cloning: Corentin’s Improvisation On SV2TTS"},"content":{"rendered":"

Author: Mahmud Hossain Farsim<\/p>\n

\n

<\/a><\/p>\n

Working with the audio production and engineering industry, I often wonder how the future of the voice talent market will look like with the assistance of artificial intelligence. The development of cloning technology started a while back but it did not reach today’s level overnight. The debate of misusing this technology is another conversation that is not the agenda of this article. However, I would like to say that there are more opportunities out there than fears. And just like any other technology, we need to know how it works to explore the avenues and detect embezzlement.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Statistical Parametric Speech Synthesis (SPSS), WaveNet, and Tacotron played a huge role in the development of Text To Speech models. In 2019, Google researchers published a paper called “Transfer Learning from Speaker Verification to Multispeaker Text-To-Speech Synthesis (SV2TTS)” which was assumed to be the state of the art algorithm for voice cloning. It describes a framework for zero-shot voice cloning that only requires 5 seconds of reference speech. The three stages of SV2TTS are a speaker encoder, a synthesizer, and a vocoder. However, the implementation of this paper was not out there until the work of Corentin Jemine, a student from the University of Li\u00e8ge. Corentin wrote his Master’s Degree thesis on SV2TTS called “Real-time Voice Cloning” with some improvisation and also implemented a user interface. His work later led to his side project called “Resemble” which runs as a voice cloning solution for various platforms.\u00a0<\/span><\/p>\n<\/p>\n

Mathematical Intuition and algorithm<\/b><\/span><\/p>\n

\u00a0<\/span><\/p>\n

In a dataset of utterances of a speaker, Corentin denotes<\/span> u<\/i><\/b>ij<\/i><\/b> \u00a0<\/i><\/b>as<\/span> jth<\/i><\/b> utterance of the<\/span> ith<\/i><\/b> speaker. And by<\/span> x<\/i><\/b>ij<\/i><\/b> , he denotes the log-mel spectrogram of the utterance<\/span> u<\/i><\/b>ij<\/i><\/b> . A log-mel spectrogram is a function that extracts speech features from a waveform. The encoder<\/span> E<\/i><\/b> computes the embedding<\/span> e<\/i><\/b>ij<\/i><\/b> =<\/span> E<\/i><\/b>(<\/span>x<\/i><\/b>ij<\/i><\/b> ;<\/span> wE<\/i><\/b> ) corresponding to the utterance<\/span> u<\/i><\/b>ij<\/i><\/b> , where<\/span> wE<\/i><\/b> are the parameters of the encoder. A speaker embedding<\/span> is the centroid of the embeddings of the speaker\u2019s utterances. This is the mathematical model of the embedding :<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0<\/a><\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/i><\/b><\/p>\n

\u00a0<\/span><\/p>\n

Now<\/span>,<\/b> the synthesizer\u00a0<\/span> S<\/i><\/b> will try to model<\/span> x<\/i><\/b>ij<\/i><\/b> given<\/span> c<\/i><\/b>i<\/i><\/b> and<\/span> t<\/i><\/b>ij<\/i><\/b> , the transcript of utterance<\/span> u<\/i><\/b>ij<\/i><\/b>.<\/span><\/p>\n

We have<\/span> x^<\/i><\/b>ij<\/i><\/b> =<\/span> S(c<\/i><\/b>i<\/i><\/b>, t<\/i><\/b>ij<\/i><\/b> ; w<\/i><\/b>S<\/i><\/b>).\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

In Corentin’s implementation, he uses the utterance embedding rather than the speaker embedding,<\/span> giving instead\u00a0<\/span> x^<\/i><\/b>ij<\/i><\/b> =<\/span> S<\/i><\/b>(<\/span>u<\/i><\/b>ij<\/i><\/b> ,<\/span> t<\/i><\/b>ij<\/i><\/b> ;<\/span> w<\/i><\/b>S<\/i><\/b>).<\/span><\/p>\n

\u00a0<\/span><\/p>\n

The Vocoder<\/span> V<\/i><\/b> will approximate<\/span> u<\/i><\/b>ij<\/i><\/b> given<\/span> x^<\/i><\/b>ij<\/i><\/b> . We have<\/span> u<\/i><\/b>\u02c6<\/span>ij<\/i><\/b> =<\/span> V<\/i><\/b>(<\/span>x^<\/i><\/b>ij<\/i><\/b> ;<\/span> wV<\/i><\/b>).<\/span> wV<\/i><\/b> is the parameter in this case. This objective model will be minimizing the loss, where<\/span> L<\/i><\/b>V\u00a0<\/i><\/b> will be denoting the loss function in the waveform domain\u00a0 :\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

min<\/i><\/b>wE,wS ,wV<\/i><\/b> L<\/i><\/b>V<\/i><\/b>(u<\/i><\/b>ij<\/i><\/b> , V(S(E<\/i><\/b>(<\/span>x<\/i><\/b>ij<\/i><\/b> ;<\/span> wE<\/i><\/b> )<\/span>, t<\/i><\/b>ij<\/i><\/b> ;<\/span> w<\/i><\/b>S<\/i><\/b>); wV))<\/i><\/b><\/p>\n


<\/span> However, Corentin proposes another loss function that can take less time to train :\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

min<\/i><\/b>wS<\/i><\/b>L<\/i><\/b>S<\/i><\/b>(<\/b>x<\/i><\/b>ij<\/i><\/b> ,<\/b> S<\/i><\/b>(<\/b>e<\/i><\/b>ij<\/i><\/b> ,<\/b> t<\/i><\/b>ij<\/i><\/b> ;<\/span> w<\/i><\/b>S<\/i><\/b>))<\/b><\/p>\n

\u00a0<\/span><\/p>\n

He suggests training the synthesizer and vocoder separately. Assuming a pre-trained encoder, the synthesizer can be trained to directly predict the mel spectrograms of the target audio. Then the Vocoder is trained directly on spectrograms that can take both the ground truth or the synth generated spectrograms.\u00a0\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

min<\/i><\/b>wV<\/i><\/b> L<\/i><\/b>V<\/i><\/b> (u<\/i><\/b>ij<\/i><\/b> , V(x<\/i><\/b>ij<\/i><\/b> ; wV))\u00a0<\/i><\/b><\/p>\n

Or<\/span><\/p>\n

\u00a0 min<\/i><\/b>wV<\/i><\/b> L<\/i><\/b>V<\/i><\/b> (u<\/i><\/b>ij<\/i><\/b> , V(x\u02c6<\/i><\/b>ij<\/i><\/b> ; wV))<\/i><\/b><\/p>\n

\u00a0<\/span><\/p>\n

Now the Speaker Encoder. This encoder produces embeddings that can characterize the voice in the utterance. Having no ground truth as a reference, it needs to have the corresponding upsampling model for prediction.<\/span><\/p>\n<\/p>\n

<\/a><\/span><\/p>\n


<\/span> The sequential three-stage training of SV2TTS. Source: Corentin’s thesis paper<\/span><\/p>\n

<\/p>\n

<\/span><\/p>\n

With the GE2E loss function, the speaker encoder and synthesizer are trained separately. The synthesizer needs to have the embeddings from a trained encoder and when not trained on the ground truth, spectrograms from a trained synthesizer needs to be fed into the vocoder.\u00a0<\/span><\/p>\n

\u00a0<\/span>
<\/span> Let’s take a look at the architecture and modification by Corentin on that three-stage pipeline.<\/b><\/p>\n<\/p>\n

Speaker Encoder<\/span>: Corentin used 256 units LSTM layers to build this encoder to make the training load lighter. However, In the original paper by Google, they trained the model in 50 million steps. There were 40 channel spectrograms as inputs. Corentin improvised with a ReLu layer before the L2 normalization in the last layer which is a vector of 256 elements. After speaker embedding with short utterances, The GE2E loss function optimizes the model. The models compute the embeddings in this way :\u00a0<\/span><\/b><\/p>\n

e<\/i><\/b>ij<\/i><\/b> (1 \u2264<\/b> i<\/i><\/b> \u2264<\/b> N<\/i><\/b>, 1 \u2264<\/b> j<\/i><\/b> \u2264<\/b> M<\/i><\/b> )<\/b> of M utterances of fixed duration from N speakers.\u00a0<\/span><\/p>\n<\/p>\n

A two-by-two comparison through a similarity matrix of all embeddings<\/span> e<\/i><\/b>ij<\/i><\/b> against every speaker embedding<\/span><\/p>\n

c<\/i><\/b>k<\/i><\/b> (1 \u2264 k \u2264 N)<\/i><\/b> in the batch looks like this :\u00a0<\/span><\/p>\n

S<\/i><\/b>ij<\/i><\/b>,k = w \u00b7 cos(e<\/i><\/b>ij<\/i><\/b> , c<\/i><\/b>k<\/i><\/b>) + b = w \u00b7 e<\/i><\/b>ij<\/i><\/b> \u00b7 ||c<\/i><\/b>k<\/i><\/b> ||2 + b<\/i><\/b><\/p>\n

\u00a0<\/span><\/p>\n

High similarity values are expected in an optimal model. To optimize, the loss will be calculated by row-wise Softmax losses. When embedding, the utterances are included in the centroid of the same speaker. To avoid the bias that is created towards the speaker independently of the model accuracy, an utterance that is compared against its own speaker’s embedding will be removed from the speaker embedding. The similarity matrix will look like this :\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

<\/a><\/span><\/p>\n


<\/span> c<\/i><\/b>i<\/i><\/b>(\u2212j)<\/i><\/b> is the exclusive centroid here. 1.6 seconds of sample utterances are taken from long datasets. The model segments the utterances of 1.6 seconds and the encoder passes the utterances individually. The mean output is then normalized to generate utterance embedding. Corentin proposes to keep 1.6 seconds both for inference and training. He also stresses vectorization in all operations when computing the similarity matrix for efficient and fast computation.\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

For experimenting with the speaker encoder, Corentin preprocessed the samples and removed the silent parts of the utterance samples with the help of a python package. He used the dilation technique (s+1) where S is the maximum silent duration tolerated. Note that the value of S was 0.2s in his experiment. Finally, he normalized the audio waveform. He used all the same datasets used by the Google authors – LibriSpeech, VoxCeleb1, and VoxCeleb2; except another one – an internal set which Corentn did not have the access to use. These datasets included thousands of hours and speakers and celebrities collected from clean and noisy recordings as well as from youtube.\u00a0\u00a0<\/span><\/p>\n<\/p>\n

After training the speaker encoder 1 million steps where he sees that the loss decreases slowly, Corentin observed how well the model can cluster the speakers. He uses UMAP to project the embeddings and the model separated gender and speakers linearly in the projected space.\u00a0<\/span><\/p>\n<\/p>\n

Synthesizer<\/b><\/span> :<\/b> The synthesizer is Tacotron2 without Wavenet. It’s a recurrent sequence to sequence model that predicts spectrograms from the text. SV2TTS however, did a modification in the process – a speaker embedding is concatenated to every frame that is output by the Tacotron encoder but in the Tacotron methodology, frames are passed through a bidirectional LSTM. Concatenated vector goes through two unidirectional LSTM layers and then projected to a single mel spectrogram frame.<\/span><\/p>\n<\/p>\n

<\/a><\/span><\/p>\n

The Modified Tacotron. Source: Corentin’s Thesis Paper<\/span><\/p>\n

<\/p>\n

<\/span><\/p>\n

Corentin improvised by replacing abbreviations and numbers by their complete-textual form, making all characters ASCII, normalizing whitespaces, and making all characters\u00a0<\/span>lowercase. When implemented, Corentin used the LibriSpeech dataset that he thought would give the best voice cloning similarity on unseen speakers. Mentionable results, however, did not come using the LibriTTS dataset. Also, he used the Montreal Forced Aligner for Automatic Speech Recognition and to reduce background noises from synthesized spectrograms, the LogMMSE algorithm.\u00a0<\/span><\/p>\n

In the case of embeddings to train the synthesizer, Corentin preferred to use utterance embeddings of the same target utterance in his experiment instead of what is proposed in the SV2TTS paper.\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

<\/a><\/span>Encoder and Decoder steps aligned (Left). Resulting in a more smooth version of the predicted spectrogram than the ground truth Mel.<\/span><\/p>\n

Source: Corentin’s thesis paper<\/span><\/p>\n

<\/p>\n

<\/span><\/p>\n

The results were excellent aside from the pauses in some cases. This happened due to the slow-talking speakers embedding. Also, Corentin’s limits on the duration of utterances in the dataset (1.6s – 11.25s) were likely to cause those issues.\u00a0\u00a0<\/span><\/p>\n<\/p>\n

Vocoder<\/span>: Corentin uses a pytorch implementation of WaveRNN as the vocoder which was improvised by github user fatchord. Although the authors of Sv2TTS improvised on the computation time and overhead of the computation by implementing the sampling operation as a custom GPU operation. Corentin didn’t do that. He used a batched sampling with alternative WaveRNN.\u00a0\u00a0<\/span><\/b><\/p>\n<\/p>\n

\u00a0<\/span><\/p>\n

Corentin finds that for the utterances shorter than 12.5 seconds, this alternative \u00a0 \u00a0 \u00a0 WaveRNN will run slowly. The time it takes to infer is highly dependent on the number of folds in batched sampling. In the sparse WaveRNN model, Corentin finds that the matrix multiply operation for a sparse matrix and a dense vector-only reach at an equal state timewise, with the dense – only matrix multiplication for levels of sparsity above 91%. The sparse tensors will slow down the forward pass speed below this threshold. This implementation finds that a sparsity level of 96.4% would lower the real-time threshold to 7.86 seconds, and a level of 97.8% to 4.44 seconds.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Conclusion<\/b><\/span><\/p>\n

Without a doubt, Corentin Jemine did a great job implementing the SV2TTS paper with some of his own thoughts. As his thesis was published more than a year ago, more recent developments must be there already. But I found his thesis paper as a breakthrough in this technology and I am sure it has helped to shape the latest innovation of voice cloning. I will encourage everyone to read his paper in this link :<\/span> https:\/\/matheo.uliege.be\/handle\/2268.2\/6801<\/span><\/a><\/p>\n

\u00a0<\/span><\/p>\n

Corentin also made a user interface for this project which he demonstrates in this youtube link:<\/span> https:\/\/www.youtube.com\/watch?v=-O_hYhToKoA<\/span><\/a><\/p>\n<\/p>\n

<\/a><\/span><\/p>\n

SV2TTS Toolbox: The user interface by Corentin Jemine<\/span><\/p>\n

<\/p>\n

<\/span><\/p>\n

Corentin also mentioned in his youtube comment that “Resemble”, another project by him, which came after this thesis, can produce better results than what he could achieve in his experiment and invites everyone to use that instead. However, I particularly loved his ideas on some improvisation that he did on the original SV2TTS paper which opened the door for innovation. For example, his speaker encoder model worked well with Equal Error Rate to be<\/span> 4.5%<\/b> which is<\/span> 5.64%<\/b> lower than the Google researchers’ who trained their model 50 times more than Corentin’s !\u00a0<\/span><\/p>\n

Needless to say that this technology will go beyond our imagination in near future. New marketplaces will grow, media, entertainment, and information industries will be acting as key stakeholders of this technology. Voiceover talents will find new ways to get themselves heard in so many different ways. Also, this is only a matter of time that the reverse engineering of the voice cloning models will show up very soon. By wiping out the ‘deep fakes’, hopefully, those models will flatten all the tensions and make way for voice cloning technology towards the greater good.\u00a0<\/span><\/p>\n<\/div>\n

Go to Source<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Author: Mahmud Hossain Farsim Working with the audio production and engineering industry, I often wonder how the future of the voice talent market will look […] Read More<\/a><\/span><\/p>\n","protected":false},"author":1,"featured_media":461,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[26],"tags":[],"_links":{"self":[{"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/posts\/4414"}],"collection":[{"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/comments?post=4414"}],"version-history":[{"count":0,"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/posts\/4414\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/media\/470"}],"wp:attachment":[{"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/media?parent=4414"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/categories?post=4414"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.aiproblog.com\/index.php\/wp-json\/wp\/v2\/tags?post=4414"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}