Optimal spectral transportation with application to music transcription
Not on the map. Why?
Abstract (arXiv)
Many spectral unmixing methods rely on the non-negative decomposition of spectral data onto a dictionary of spectral templates. In particular, state-of-the-art music transcription systems decompose the spectrogram of the input signal onto a dictionary of representative note spectra. The typical measures of fit used to quantify the adequacy of the decomposition compare the data and template entries frequency-wise. As such, small displacements of energy from a frequency bin to another as well as variations of timber can disproportionally harm the fit. We address these issues by means of optimal transportation and propose a new measure of fit that treats the frequency distributions of energy holistically as opposed to frequency-wise. Building on the harmonic nature of sound, the new measure is invariant to shifts of energy to harmonically-related frequencies, as well as to small and local displacements of energy. Equipped with this new measure of fit, the dictionary of note templates can be considerably simplified to a set of Dirac vectors located at the target fundamental frequencies (musical pitch values). This in turns gives ground to a very fast and simple decomposition algorithm that achieves state-of-the-art performance on real musical data.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Sep 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 4; 2024: 1; 2025: 3.
11 papers.
- 2021Semi-relaxed Gromov-Wasserstein divergence with applications on graphscited by 21
- 2023SNEkhorn: Dimension Reduction with Symmetric Entropic Affinitiescited by 12
- 2023Unsupervised Harmonic Parameter Estimation Using Differentiable DSP and Spectral Optimal Transportcited by 8
- 2023Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problemcited by 6
- 2025A note on the relations between mixture models, maximum-likelihood and entropic optimal transportcited by 2
- 2023Optimal Transport with Adaptive Regularisationcited by 1
- 2021Data-driven mapping between functional connectomes using optimal transportcited by 0
- 2021Estimation of Stationary Optimal Transport Planscited by 0
- 2024Wasserstein Nonnegative Tensor Factorization with Manifold Regularizationcited by 0
- 2025Scalable Approximate Algorithms for Optimal Transport Linear Modelscited by 0
- 2025Translation-Equivariant Self-Supervised Learning for Pitch Estimation with Optimal Transportcited by 0
- 2025Translation-Equivariant Self-Supervised Learning for Pitch Estimation with Optimal Transport2 Aug 2025
- 2025Scalable Approximate Algorithms for Optimal Transport Linear Models6 Apr 2025
- 2025A note on the relations between mixture models, maximum-likelihood and entropic optimal transport21 Jan 2025
- 2024Wasserstein Nonnegative Tensor Factorization with Manifold Regularization3 Jan 2024
- 2023Unsupervised Harmonic Parameter Estimation Using Differentiable DSP and Spectral Optimal Transport22 Dec 2023
- 2023Optimal Transport with Adaptive Regularisation4 Oct 2023
- 2023SNEkhorn: Dimension Reduction with Symmetric Entropic Affinities23 May 2023
- 2023Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem10 Mar 2023
- 2021Semi-relaxed Gromov-Wasserstein divergence with applications on graphs6 Oct 2021
- 2021Estimation of Stationary Optimal Transport Plans25 Jul 2021
- 2021Data-driven mapping between functional connectomes using optimal transport2 Jul 2021