[Studies on speaker recognition based on complexity].
OBJECTIVE
To analyze the speech characters with computation complexity.


METHODS
Voices of 51 testees spoke the same paragraph were recorded and the same sentence of voice waveform was intercepted as source data. There were two kinds of sample voices: same testee speaking the same sentence at different time and different testee speaking the same sentence.


RESULTS
The computation complexity curves of the different testee were obviously distinguishing, while those of the same testee were almost the same. In a 2D embedded space the computation complexity features of individual testee differs with others even if testees speak the same sentences.


CONCLUSIONS
This complexity features might be applied to speaker recognition system and using complexity method to analyze speech signals has wide application prospect.
Li
Min-dan
MD
Department of Biomedical Engineer, Zhejiang University, Hangzhou, China.
Zhang
Hong
H
Tong
Qin-ye
QY
D000465:Algorithms; D001302:Audiometry, Speech; D006804:Ergonomics; D006801:Humans; D021641:Recognition, Psychology; D012815:Signal Processing, Computer-Assisted; D013060:Speech; D013063:Speech Discrimination Tests; D013065:Speech Intelligibility; D013067:Speech Perception