English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we propose a method for blind speech separation of convolutive mixtures in the frequency domain. The main difficulty in a frequency approach is the so-called permutation problem. In the proposed method, we use the Assignment Problem (AP) approach to solve permuation ambiguity in the frequency domain. In our work, we apply three different algorithms including Hugarian, Jonker-Volgenant and Bertsekas’s Auction to solve the AP to find the optimal solution. Computer simulation experiments are presented to illustrate the proposed method.

Blind Speech Separation in the Frequency Domain Using Assignment Problem Approach