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.
Type de document :
Communication dans un congrès
International Society for Music Information Retrieval Conference (ISMIR), Oct 2011, Miami, United States. 2011
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00616274
Contributeur : Gabriel Sargent <>
Soumis le : dimanche 21 août 2011 - 15:10:17
Dernière modification le : jeudi 11 janvier 2018 - 06:20:09
Document(s) archivé(s) le : lundi 12 novembre 2012 - 15:37:15

Fichier

ISMIR2011_Sargent_et_al.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00616274, version 1

Collections

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. 2011. 〈inria-00616274〉

Partager

Métriques

Consultations de la notice

370

Téléchargements de fichiers

232