Classifying melodies using tree grammars
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/18322
Título: | Classifying melodies using tree grammars |
---|---|
Autor/es: | Bernabeu Briones, José Francisco | Calera Rubio, Jorge | Iñesta, José M. |
Grupo/s de investigación o GITE: | Reconocimiento de Formas e Inteligencia Artificial |
Centro, Departamento o Servicio: | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos |
Palabras clave: | Music modeling and analysis | Stochastic methods | Learning with structured data | Music similarity | Classification |
Área/s de conocimiento: | Lenguajes y Sistemas Informáticos |
Fecha de publicación: | 2011 |
Editor: | Springer Berlin / Heidelberg |
Cita bibliográfica: | BERNABEU BRIONES, José Francisco; CALERA RUBIO, Jorge; IÑESTA QUEREDA, José Manuel. "Classifying melodies using tree grammars". En: Pattern Recognition and Image Analysis: 5th Iberian Conference, IbPRIA 2011, Las Palmas de Gran Canaria, Spain, June 8-10, 2011: Proceedings / Jordi Vitria, João Miguel Sanches, Mario Hernández (Eds.). Berlin : Springer Berlin Heidelberg, 2011. (Lecture Notes in Computer Science; 6669). ISBN 978-3-642-21256-7, pp. 572-579 |
Resumen: | Similarity computation is a difficult issue in music information retrieval, 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 labeling has proven to be effective in melodic similarity computation. In this paper we propose a solution when we have melodies represented by trees for the training but the duration information is not available for the input data. For that, we infer a probabilistic context-free grammar using the information in the trees (duration and pitch) and classify new melodies represented by strings using only the pitch. 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 efficient for scalability issues. |
Patrocinador/es: | This work is supported by the Spanish Ministry project TIN2009-14247-C02-02, TIN2009-14205-C04-C1, the Pascal Network of Excellence, and the program Consolider Ingenio 2010 (CSD2007-00018). |
URI: | http://hdl.handle.net/10045/18322 |
ISBN: | 978-3-642-21256-7 |
ISSN: | 0302-9743 (Print) | 1611-3349 (Online) |
DOI: | 10.1007/978-3-642-21257-4_71 |
Idioma: | eng |
Tipo: | info:eu-repo/semantics/bookPart |
Derechos: | The original publication is available at www.springerlink.com |
Revisión científica: | si |
Versión del editor: | http://dx.doi.org/10.1007/978-3-642-21257-4_71 |
Aparece en las colecciones: | INV - GRFIA - Capítulos de Libros Investigaciones financiadas por la UE |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
ibpria2011-bernabeu.pdf | Versión revisada (acceso libre) | 247,96 kB | Adobe PDF | Abrir Vista previa |
ibpria2011-bernabeu_final.pdf | Versión final (acceso restringido) | 162,02 kB | Adobe PDF | Abrir Solicitar una copia |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.