pith. sign in

arxiv: 1712.01742 · v1 · pith:RUA2A6URnew · submitted 2017-12-05 · 📡 eess.AS · cs.SD

Multi-speaker Recognition in Cocktail Party Problem

classification 📡 eess.AS cs.SD
keywords multi-speakercocktailpartyproblemrecognitionspeakerspeakerstheory
0
0 comments X
read the original abstract

This paper proposes an original statistical decision theory to accomplish a multi-speaker recognition task in cocktail party problem. This theory relies on an assumption that the varied frequencies of speakers obey Gaussian distribution and the relationship of their voiceprints can be represented by Euclidean distance vectors. This paper uses Mel-Frequency Cepstral Coefficients to extract the feature of a voice in judging whether a speaker is included in a multi-speaker environment and distinguish who the speaker should be. Finally, a thirteen-dimension constellation drawing is established by mapping from Manhattan distances of speakers in order to take a thorough consideration about gross influential factors.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.