Abstract

In this paper, we introduce time-domain and frequency-domain versions of a new Blind Source Separation (BSS) approach to extract bounded magnitude sparse sources from convolutive mixtures. We derive algorithms by maximization of the proposed objective functions that are defined in a completely deterministic framework, and prove that global maximums of the objective functions yield perfect separation under suitable conditions. The derived algorithms can be applied to temporal or spatially dependent sources as well as independent sources. We provide experimental results to demonstrate some benefits of the approach, also including an application on blind speech separation.

Full Text
Published version (Free)

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