Abstract
To settle out the problem that search of speaker change point (SCP) is blind and exhaustive, mean shift is proposed to seek SCP by estimating the kernel density of speech stream in this paper. It contains three steps: seeking peak points using mean shift firstly, using maximum likelihood ratio (MLR) to compute the MLR value of the peak points secondly, and seeking SCPs from MLR value using the maximum method thirdly. The relationship of MLR and BIC is given then. Compared with those methods of using metric or model, the process of seeking SCP is no longer blind because mean shift always points the direction of maximum increase in the density. The experiments show that the proposed algorithm can arrive a comparable result against to BIC and DISTBIC, while it can save detection time, for a 3-second speech segment , the time using the proposed algorithm is about 60% of DISTBIC and 45% of BIC . Further investigation and improvement about this method is discussed at the end of this paper.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
