Research on Parallel Data Currency Rule Algorithms

Author(s):  
Xuliang Duan ◽  
Bing Guo ◽  
Yan Shen ◽  
Yuncheng Shen ◽  
Xiangqian Dong ◽  
...  
Keyword(s):  
Author(s):  
Xiaohai Tian ◽  
Junchao Wang ◽  
Haihua Xu ◽  
Eng-Siong Chng ◽  
Haizhou Li

Author(s):  
S. V. Skvortsov ◽  
◽  
T. A. Fetisova ◽  
D. V. Fetisov ◽  
◽  
...  

Author(s):  
Yuki Takashima ◽  
Toru Nakashika ◽  
Tetsuya Takiguchi ◽  
Yasuo Ariki

Abstract Voice conversion (VC) is a technique of exclusively converting speaker-specific information in the source speech while preserving the associated phonemic information. Non-negative matrix factorization (NMF)-based VC has been widely researched because of the natural-sounding voice it achieves when compared with conventional Gaussian mixture model-based VC. In conventional NMF-VC, models are trained using parallel data which results in the speech data requiring elaborate pre-processing to generate parallel data. NMF-VC also tends to be an extensive model as this method has several parallel exemplars for the dictionary matrix, leading to a high computational cost. In this study, an innovative parallel dictionary-learning method using non-negative Tucker decomposition (NTD) is proposed. The proposed method uses tensor decomposition and decomposes an input observation into a set of mode matrices and one core tensor. The proposed NTD-based dictionary-learning method estimates the dictionary matrix for NMF-VC without using parallel data. The experimental results show that the proposed method outperforms other methods in both parallel and non-parallel settings.


Sign in / Sign up

Export Citation Format

Share Document