Publishing Service

Polishing & Checking

Frontiers of Information Technology & Electronic Engineering

ISSN 2095-9184 (print), ISSN 2095-9230 (online)

Histogram equalization using a reduced feature set of background speakers’ utterances for speaker recognition

Abstract: We propose a method for histogram equalization using supplement sets to improve the performance of speaker recognition when the training and test utterances are very short. The supplement sets are derived using outputs of selection or clustering algorithms from the background speakers’ utterances. The proposed approach is used as a feature normalization method for building histograms when there are insufficient input utterance samples. In addition, the proposed method is used as an i-vector normalization method in an i-vector-based probabilistic linear discriminant analysis (PLDA) system, which is the current state-of-the-art for speaker verification. The ranks of sample values for histogram equalization are estimated in ascending order from both the input utterances and the supplement set. New ranks are obtained by computing the sum of different kinds of ranks. Subsequently, the proposed method determines the cumulative distribution function of the test utterance using the newly defined ranks. The proposed method is compared with conventional feature normalization methods, such as cepstral mean normalization (CMN), cepstral mean and variance normalization (MVN), histogram equalization (HEQ), and the European Telecommunications Standards Institute (ETSI) advanced front-end methods. In addition, performance is compared for a case in which the greedy selection algorithm is used with fuzzy C-means and K-means algorithms. The YOHO and Electronics and Telecommunications Research Institute (ETRI) databases are used in an evaluation in the feature space. The test sets are simulated by the Opus VoIP codec. We also use the 2008 National Institute of Standards and Technology (NIST) speaker recognition evaluation (SRE) corpus for the i-vector system. The results of the experimental evaluation demonstrate that the average system performance is improved when the proposed method is used, compared to the conventional feature normalization methods.

Key words: Speaker recognition, Histogram equalization, i-vector

Chinese Summary  <26> 采用背景人声简化特征集的说话人识别直方图均衡化方法

概要:本文提出了一种用于说话人识别技术的直方图均衡化方法。该方法采用了一套增补简化特征集,用以在训练数据和测试数据较短时改进说话人识别的效果。该增补特征集采用选择算法或聚类算法从背景人声中派生得到。当输入语音数据样本不足时,本文提出的方法可作为构建直方图的特征归一化方法使用。另外,该方法作为一种i-vector归一化方法,源于一种目前较为先进的基于i-vector的概率线性判别分析(Probabilistic linear discrimin antanalysis, PLDA)说话人识别系统。在输入语音和增补集中,用于直方图均衡化的样本值序号均按升序进行估计。新的序列号则按不同种类的序号之和进行排列。随后,该方法采用最新的序列号得出了测试语音样本的累积分布函数。本文将这一方法与倒谱均值归一化(Cepstral mean normalization, CMN)方法、倒谱均值和方差(Cepstral mean and variance, MVN)归一化法、直方图均衡化(Histogram equalization, HEQ)方法和欧洲电信标准协会模拟前端方法进行了比较。此外,在一具体算例中将该方法性能与采用模糊C-means和K-means算法的贪婪选择算法进行了比较。采用YOHO和ETRI数据库对特征空间进行评估。测试集采用Opus VoIP编码器进行了模拟。本文还采用了2008美国国家标准技术研究所说话人识别评测语料库对该i-vector系统进行了评测。试验结果表明,与传统特征归一化方法相比,当采用所提出的方法时,平均系统性能可得到有效提提升。

关键词组:说话人识别;直方图均衡化;i-vector


Share this article to: More

Go to Contents

References:

<Show All>

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





DOI:

10.1631/FITEE.1500380

CLC number:

TN912.34

Download Full Text:

Click Here

Downloaded:

2719

Download summary:

<Click Here> 

Downloaded:

1775

Clicked:

7177

Cited:

0

On-line Access:

2017-05-24

Received:

2015-11-03

Revision Accepted:

2016-04-18

Crosschecked:

2017-02-21

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952276; Fax: +86-571-87952331; E-mail: jzus@zju.edu.cn
Copyright © 2000~ Journal of Zhejiang University-SCIENCE