- Bernabeu, José F. and Calera-Rubio, Jorge and Iñesta, José M. and Rizo, David
"Melodic Identification Using Probabilistic Tree Automata"
Journal of New Music Research, vol. 40, pp. 93-103
Similarity computation is a difficult issue in music information retrieval tasks, because it tries to emulate the special ability that humans show for pattern recognition in general, and particularly in the presence of noisy data. A number of works have addressed the problem of what is the best representation for symbolic music in this context. The tree representation, using rhythm for defining the tree structure and pitch information for leaf and node labelling has proven to be effective in melodic similarity computation. One of the main drawbacks of this approach is that the tree comparison algorithms are of a high time complexity. In this paper, stochastic k-testable tree-models are applied for computing the similarity between two melodies as a probability. The results are compared to those achieved by tree edit distances, showing that k-testable tree-models 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 stored in symbolic format. For it, the utilized method must be able to deal with inexact queries and with efficiency for scalability issues.
author = "Bernabeu, José F. and Calera-Rubio, Jorge and Iñesta, José M. and Rizo, David",
title = "Melodic Identification Using Probabilistic Tree Automata",
issn = "0929-8215",
journal = "Journal of New Music Research",
month = "june",
number = "2",
pages = "93-103",
volume = "40",
year = "2011"
|Resources associated with this publication|