Abstract

The traditional training meshods of speaker codebook for speaker identification based on vector quantization are sensitive to the initial codebook parameters, and they often lead to a sub-optimal codebook in practice. To resolve this problem, this paper proposes a novel bi-group particle swarm optimizer (BPSO). It applies two sub-group particles with different particle update parameters simultaneously to explore the best speaker codebook, and the particles perform basic operations of particle swarm optimization (PSO) and conventional LBG algorithm in sequence, which can explore the solution space separately and search the local part in detail together. Information is exchanged when sub-groups are periodically shuffled and reorganized. Experimental results have demonstrated that the performance of BPSO is much better than that of LBG, fuzzy C-means (FCM), fast evolutionary programming (FEP), PSO, the impoved PSO algorithm consistently with higher correct identification rates and convergence rate. The dependence of the final codebook on the selection of the initial codebook is also reduced effectively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.