A regularity-constrained Viterbi algorithm and its application to the structural segmentation of songs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

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

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.
Fichier principal
Vignette du fichier
ISMIR2011_Sargent_et_al.pdf (187.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00616274 , version 1 (21-08-2011)

Identifiers

  • HAL Id : inria-00616274 , version 1

Cite

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⟩
309 View
308 Download

Share

Gmail Facebook X LinkedIn More