Abstract
The cocktail party problem deals with the specialized human listening ability to focus one's listening attention on a single talker among a cacophony of conversations and background noise. The blind source separation problem corresponds to a way to enable computers to solve the cocktail party problem in a satisfactory manner. The simplest version of spatio-temporal mixture problem, which is a type of blind source separation problems, is solved using time-frequency analysis. The analytic wavelet transform is used to represent time-frequency information and a numerical simulation is given.
†Dedicated to Professor Hideo Soga on the occasion of his 60th birthday.
AMS Subject Classifications::
Acknowledgements
We thank Professor Y. Yoshimatsu (Osaka Electro-Communication University) for his valuable advice about hyperbolas, especially a hint for simplifying the proof of Theorem 6.1 (i). This work was partially supported by JSPS.KAKENHI (C)17540179, (C)18540177, (C)19540180, (C)20540168 and (C)20540193.
Notes
†Dedicated to Professor Hideo Soga on the occasion of his 60th birthday.