Automatic DJ Transitions with Differentiable Audio Effects and Generative Adversarial Networks
Not on the map. Why?
Abstract (arXiv)
A central task of a Disc Jockey (DJ) is to create a mixset of mu-sic with seamless transitions between adjacent tracks. In this paper, we explore a data-driven approach that uses a generative adversarial network to create the song transition by learning from real-world DJ mixes. In particular, the generator of the model uses two differentiable digital signal processing components, an equalizer (EQ) and a fader, to mix two tracks selected by a data generation pipeline. The generator has to set the parameters of the EQs and fader in such away that the resulting mix resembles real mixes created by humanDJ, as judged by the discriminator counterpart. Result of a listening test shows that the model can achieve competitive results compared with a number of baselines.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 9 of its 29 references that are in the map. First posted on arXiv 13 Oct 2021.
Builds on
9 of 29 references.
References · 9
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2020DDSP: Differentiable Digital Signal Processingcited by 178
- 2016madmom: a new Python Audio and Music Signal Processing Librarycited by 64
- 2020Automatic multitrack mixing with a differentiable mixing console of neural audio effectscited by 27
- 2020Channel-wise Subband Input for Better Voice and Accompaniment Separation on High Resolution Musiccited by 13
- 2021Lightweight and interpretable neural modeling of an audio distortion effect using hyperconditioned differentiable biquadscited by 10
- 2021Differentiable Signal Processing With Black-Box Audio Effectscited by 10
- 2021Latent Space Explorations of Singing Voice Synthesis using DDSPcited by 3
- 2020A Computational Analysis of Real-World DJ Mixes using Mix-To-Track Subsequence Alignmentcited by 2
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 1.
3 papers.