Skip to main content
Have a personal or library account? Click to login
Barwise Music Structure Analysis with the Correlation Block-Matching Segmentation Algorithm Cover

Barwise Music Structure Analysis with the Correlation Block-Matching Segmentation Algorithm

Open Access
|Nov 2023

Figures & Tables

Figure 1

A schematic example of musical structure.

Figure 2

An idealized self-similarity matrix, extracted from Paulus et al. (2010).

Figure 3

Cosine, Autocorrelation and RBF self-similarities for the song POP01 of RWC Pop.

Table 1

Standard metrics (see Section 4.1) when aligning the reference annotations on the downbeats (compared to the original annotations).

DatasetP0.5sR0.5sF0.5sP3sR3sF3s
SALAMIAnnotation 182.47%82.14%82.30%99.94%99.56%99.74%
Annotation 280.97%80.92%80.94%99.92%99.84%99.88%
RWC Pop96.46%96.21%96.33%100%99.73%99.86%
Figure 4

Segmentation results of state-of-the-art algorithms on the SALAMI-test and RWC Pop datasets, for beat-aligned (original) vs. downbeat-aligned boundaries. The SALAMI-test dataset is defined by Ullrich et al. (2014), and introduced in Section 4.2.1.

Table 2

Different time synchronizations for the Foote (2000) algorithm on the SALAMI-test dataset. The SALAMI-test dataset is defined by Ullrich et al. (2014), and introduced in Section 4.2.1.

Time synchronizationP0.5sR0.5sF0.5sP3sR3sF3s
Beat-synchronizedOriginal26.98%34.58%29.21%50.10%63.30%54.02%
Re-aligned on downbeats31.05%39.15%33.33%50.08%62.95%53.78%
Bar-synchronized37.68%36.36%35.97%58.06%56.11%55.57%
Barwise TF Matrix39.22%42.66%39.67%59.60%64.82%60.36%
Table 3

Different time synchronizations for the Foote (2000) algorithm on the RWC Pop dataset.

Time synchronizationP0.5sR0.5sF0.5sP3sR3sF3s
Beat-synchronizedOriginal31.86%24.38%27.29%67.21%51.92%57.95%
Re-aligned on downbeats42.30%32.82%36.52%66.67%51.44%57.44%
Bar-synchronized43.53%26.32%32.46%69.25%42.22%51.97%
Barwise TF Matrix53.09%37.19%43.30%79.35%56.03%65.04%
Figure 5

Example of computing an optimal segmentation with 4 bars.

Figure 6

Full kernel of size 10.

Figure 7

Band kernels, of size 10.

Figure 8

Distribution of segment sizes in terms of number of bars, in the annotations.

Table 4

Boundary retrieval performance with the different self-similarities on the train dataset (Full kernel, no penalty function).

Self-similarityP0barR0barF0barP1barR1barF1bar
Cosine50.83%30.82%36.77%62.80%37.72%45.19%
Autocorrelation32.59%64.69%41.30%42.10%83.73%53.41%
RBF50.27%45.38%45.84%64.79%58.81%59.30%
Table 5

Boundary retrieval performance with the RBF self-similarity, on both test datasets (Full kernel, no penalty function).

DatasetP0barR0barF0barP1barR1barF1bar
SALAMI – test48.52%48.65%46.68%62.76%63.09%60.51%
RWC Pop60.72%53.61%56.01%77.68%67.62%71.09%
Figure 9

Distribution of segment sizes, with the full kernel, according to the self-similarity matrix. Results on the SALAMI-train dataset.

Figure 10

Boundary retrieval performance (F-measures only) according to the full and band kernels (with different numbers of bands). Results on the train dataset with RBF self-similarity matrices.

Figure 11

Distribution of estimated segment sizes, according to different kernels, on the train dataset.

Table 6

Boundary retrieval performance with the 7-band kernel, on both test datasets (RBF self-similarity, no penalty function).

DatasetP0barR0barF0barP1barR1barF1bar
SALAMI – test37.24%59.80%44.33%50.38%80.52%59.88%
RWC Pop59.41%68.19%62.82%75.53%86.56%79.81%
Table 7

Boundary retrieval performance depending on the penalty function, for the SALAMI-train dataset, with the RBF self-similarity and the 7-band kernel.

Penalty functionBest λP0barR0barF0barP1barR1barF1bar
Without penalty40.26%57.38%45.81%54.26%77.67%61.81%
Target deviationα=120.0140.38%57.36%45.88%54.37%77.57%61.84%
α = 10.0140.45%56.98%45.81%54.61%77.20%61.89%
α = 20.0139.75%54.32%44.43%54.93%75.31%61.46%
Modulo 80.0441.04%58.34%46.63%54.25%77.44%61.72%
Table 8

Boundary retrieval performance with the modulo 8 penalty function (λ = 0.04), on both test datasets (RBF self-similarity, 7-band kernel).

DatasetP0barR0barF0barP1barR1barF1bar
SALAMI – test38.36%60.96%45.44%50.76%80.51%60.09%
RWC Pop62.11%70.05%65.17%77.35%86.95%81.02%
Table 9

Boundary retrieval performance, comparing the F-measures with tolerance expressed barwise and in absolute time.

DatasetF0barF0.5sF1barF3s
SALAMI-test45.44%42.00%60.09%60.61%
RWC Pop65.17%64.44%81.02%80.64%
Figure 12

Boundary retrieval performance of the CBM algorithm on the SALAMI dataset, compared to state-of-the-art algorithms. Hatched bars correspond to supervised algorithms. The star * represents algorithms where the evaluation subset is not exactly the same as ours, thus preventing accurate comparison.

Figure 13

Boundary retrieval performance of the CBM algorithm on the RWC Pop dataset, compared to state-of-the-art algorithms. Hatched bars correspond to supervised algorithms.

Table 10

CBM algorithm, performed on Barwise TF matrix vs. Beatwise TF matrix, on the SALAMI-test dataset. For fairer comparison, results at both scales are computed without penalty function.

SALAMIP0.5sR0.5sF0.5sP3sR3sF3s
Beatwise (cosine, 63-band kernel)35.90%41.61%37.36%55.75%64.52%58.03%
Barwise (RBF, 7-band kernel)34.49%54.56%41.04%50.70%80.78%60.51%
Table 11

CBM algorithm, performed on Barwise TF matrix vs. Beatwise TF matrix, on RWC Pop. For fairer comparison, results at both scales are computed without penalty function.

RWC PopP0.5sR0.5sF0.5sP3sR3sF3s
Beatwise (cosine, 63-band kernel)46.22%44.38%44.57%72.54%68.85%69.51%
Barwise (RBF, 7-band kernel)59.09%67.13%62.28%75.17%85.90%79.47%
Algorithm 1 CBM algorithm, computing the optimal segmentation given a score function U().
Input: Bars {bk ∈ ⟦1, B⟧}, score function u
Output: Optimal segmentation Z* = {ζi}
tismir-6-1-167-g14.png
DOI: https://doi.org/10.5334/tismir.167 | Journal eISSN: 2514-3298
Language: English
Submitted on: Mar 30, 2023
Accepted on: Nov 2, 2023
Published on: Nov 30, 2023
Published by: Ubiquity Press
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2023 Axel Marmoret, Jérémy E. Cohen, Frédéric Bimbot, published by Ubiquity Press
This work is licensed under the Creative Commons Attribution 4.0 License.