PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Tree language automata for melody recognition
Jose Francisco Bernabeu Briones, Jorge Calera-Rubio, José Iñesta and David Rizo
In: Actas del II Workshop de Reconocimiento de Formas y Análisis de Imágenes (AERFAI) (2010) IBERGARCETA PUBLICACIONES, S.L. , Valencia, Spain , pp. 17-22. ISBN 978-84-92812-66-0


The representation of symbolic music by means of trees has shown to be suitable in melodic similarity computation. In order to compare trees, different tree edit distances have been previously used, being their complexity a main drawback. In this paper, the application of stochastic k-testable treemodels for computing the similarity between two melodies as a probability, compared to the classical edit distance has been addressed. The results show that k-testable tree-models seem to be adequate for the task, since they outperform other reference methods in both recognition rate and efficiency. The case study in this paper is to identify a snippet query among a set of songs. For it, the utilized method must be able to deal with inexact queries and efficiency for scalability issues.

EPrint Type:Book Section
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
ID Code:8414
Deposited By:Jose F. Bernabeu Briones
Deposited On:10 December 2011