.png){kind=icon}
返回
Text-independent speaker recognition using graph matching
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2008.02.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Technical mismatches between the training; and matching conditions adversely affect the performance of a speaker recognition system. In this paper, we present a matching scheme which is invariant to feature rotation, translation and uniform scaling. The proposed approach uses a neighborhood graph to represent the global shape of the feature distribution. The reference and test graphs are aligned by graph matching and the match score is computed using conventional template matching. Experiments on the NIST-1999 SIZE corpus indicate that the method is comparable to conventional Gaussian mixture model (GMM) and vector quantization (VQ)-based approaches. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
affine transformation invariance
graph matching
structural matching
kNN graph
clustering
speaker recognition
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Differential Hebbian-type learning algorithms fordecorrelationand independent component analysis
PREAI
分享收藏
查看更多内容