Monaural Multi-Speaker Speech Separation Using Efficient Transformer Model

S. Rijal, R. Neupane, S. P. Mainali, S. K. Regmi, S. Maharjan
7/29/2023
cs.SDcs.LGeess.AS

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Cocktail party problem is the scenario where it is difficult to separate or distinguish individual speaker from a mixed speech from several speakers. There have been several researches going on in this field but the size and complexity of the model is being traded off with the accuracy and robustness of speech separation. "Monaural multi-speaker speech separation" presents a speech-separation model based on the Transformer architecture and its efficient forms. The model has been trained with the LibriMix dataset containing diverse speakers' utterances. The model separates 2 distinct speaker sources from a mixed audio input. The developed model approaches the reduction in computational complexity of the speech separation model, with minimum tradeoff with the performance of prevalent speech separation model and it has shown significant movement towards that goal. This project foresees, a rise in contribution towards the ongoing research in the field of speech separation with computational efficiency at its core.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{rijal2023monaural,
  title  = {Monaural Multi-Speaker Speech Separation Using Efficient Transformer Model},
  author = {S. Rijal and R. Neupane and S. P. Mainali and S. K. Regmi and S. Maharjan},
  year   = {2023},
  eprint = {2308.00010},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.00010v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.00010.svg)](https://codeofpaper.com/paper/2308.00010)

Discussion