A regularity-constrained Viterbi algorithm and its application to the structural segmentation of songs

Gabriel Sargent 1 Frédéric Bimbot 1 Emmanuel Vincent 1
1 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : This paper presents a general approach for the structural segmentation of songs. It is formalized as a cost optimization problem that combines properties of the musical content and prior regularity assumption on the segment length. A versatile implementation of this approach is proposed by means of a Viterbi algorithm, and the design of the costs are discussed. We then present two systems derived from this approach, based on acoustic and symbolic features respectively. The advantages of the regularity constraint are evaluated on a database of 100 popular songs by showing a significant improvement of the segmentation performance in terms of F-measure.
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00616274
Contributor : Gabriel Sargent <>
Submitted on : Sunday, August 21, 2011 - 3:10:17 PM
Last modification on : Thursday, March 21, 2019 - 2:20:42 PM
Document(s) archivé(s) le : Monday, November 12, 2012 - 3:37:15 PM

File

ISMIR2011_Sargent_et_al.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00616274, version 1

Citation

Gabriel Sargent, Frédéric Bimbot, Emmanuel Vincent. A regularity-constrained Viterbi algorithm and its application to the structural segmentation of songs. International Society for Music Information Retrieval Conference (ISMIR), Oct 2011, Miami, United States. ⟨inria-00616274⟩

Share

Metrics

Record views

467

Files downloads

281