# Universal Sound Separation

**Authors:** Ilya Kavalerov, Scott Wisdom, Hakan Erdogan, Brian Patton, Kevin, Wilson, Jonathan Le Roux, John R. Hershey

arXiv: 1905.03330 · 2019-08-06

## TL;DR

This paper introduces a universal sound separation framework using deep learning, exploring various architectures and signal representations, and demonstrates significant improvements in separating arbitrary sound mixtures.

## Contribution

It develops a dataset for arbitrary sound mixtures and systematically investigates mask-based separation architectures and analysis-synthesis bases, including novel modifications for improved performance.

## Key findings

- Longer windows (25-50 ms) are best for speech/non-speech separation.
- Shorter windows (2.5 ms) are optimal for arbitrary sounds.
- STFTs outperform learnable bases in universal sound separation.

## Abstract

Recent deep learning approaches have achieved impressive performance on speech enhancement and separation tasks. However, these approaches have not been investigated for separating mixtures of arbitrary sounds of different types, a task we refer to as universal sound separation, and it is unknown how performance on speech tasks carries over to non-speech tasks. To study this question, we develop a dataset of mixtures containing arbitrary sounds, and use it to investigate the space of mask-based separation architectures, varying both the overall network architecture and the framewise analysis-synthesis basis for signal transformations. These network architectures include convolutional long short-term memory networks and time-dilated convolution stacks inspired by the recent success of time-domain enhancement networks like ConvTasNet. For the latter architecture, we also propose novel modifications that further improve separation performance. In terms of the framewise analysis-synthesis basis, we explore both a short-time Fourier transform (STFT) and a learnable basis, as used in ConvTasNet. For both of these bases, we also examine the effect of window size. In particular, for STFTs, we find that longer windows (25-50 ms) work best for speech/non-speech separation, while shorter windows (2.5 ms) work best for arbitrary sounds. For learnable bases, shorter windows (2.5 ms) work best on all tasks. Surprisingly, for universal sound separation, STFTs outperform learnable bases. Our best methods produce an improvement in scale-invariant signal-to-distortion ratio of over 13 dB for speech/non-speech separation and close to 10 dB for universal sound separation.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1905.03330/full.md

## Figures

5 figures with captions in the complete paper: https://tomesphere.com/paper/1905.03330/full.md

## References

32 references — full list in the complete paper: https://tomesphere.com/paper/1905.03330/full.md

---
Source: https://tomesphere.com/paper/1905.03330