Pasar al contenido principal

TECNOLOGIAS INTERACTIVAS PARA EL APRENDIZAJE DE MUSICA

TIN2013-48152-C2-1-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2013
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Educación, Formación Profesional y Universidades
Centro beneficiario UNIVERSIDAD DE ALICANTE
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 21
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Machine learning and music generation

  • Iñesta, José M.
  • Conklin, Darrell
  • Ramírez, Rafael, 1966-
We guest editors acknowledge the financial support of the following funding sources: the Ministerio de Economía y Competitividad project TIMuL [No. TIN2013–48152–C2–1–R]; [No. TIN2013–48152–C2–2–R, supported by UE FEDER funds]; the project Lrn2Cre8, which is funded by the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission [FET grant number 610859]; the European Union Horizon 2020 research and innovation programme [grant agreement number 688269].
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Analyzing the influence of pitch quantization and note segmentation on singing voice alignment in the context of audio-based Query-by-Humming

  • Valero-Mas, Jose J.
  • Salamon, Justin
  • Gómez Gutiérrez, Emilia, 1975-
Comunicació presentada a: 12th International Conference on Sound and Music Computing (SMC-15) celebrada del 30 de juliol a l'1 d'agost de 2015 a Maynooth, Ireland., Query-by-Humming (QBH) systems base their operation on aligning the melody sung/hummed by a user with a set of candidate melodies retrieved from polyphonic songs. While MIDI-based QBH builds on the premise of existing annotated transcriptions for any candidate song, audiobased research makes use of melody estimation algorithms for the songs. In both cases, a melody abstraction process is required for solving issues commonly found in queries such as key transpositions or tempo deviations. Full automatic music processes are commonly used for this, but due to the reported limitations in state-of-the-art methods for real-world queries, other possibilities should be considered. In this work we explore three different melody representations, ranging from a general time-series one to more musical abstractions, which avoid full automatic transcription, in the context of an audio-based QBH system. Results show that this abstraction process plays a key role in the overall accuracy of the system, obtaining the best scores when temporal segmentation is dynamically performed in terms of pitch change events in the melodic contour., This research work has been partially supported by Consejería de Educación de la Comunitat Valenciana through project PROMETEO/2012/017, Vicerrectorado de Investigación, Desarrollo e Innovación de la Universidad de Alicante through FPU programme (UAFPU2014–5883), the Spanish Ministerio de Econom´ıa y Competitividad through project TIMuL (No. TIN2013–48152–C2–1–R, supported by EU FEDER funds) and the Spanish entity Fundació Obra Social ’laCaixa’. Authors would also like to thank José M. Iñesta for kindly proofreading this paper.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton

  • Calvo-Zaragoza, Jorge
  • Oncina, Jose
  • Higuera, Colin de la
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
In a number of fields, it is necessary to compare a witness string with a distribution. One possibility is to compute the probability of the string for that distribution. Another, giving a more global view, is to compute the expected edit distance from a string randomly drawn to the witness string. This number is often used to measure the performance of a prediction, the goal then being to return the median string, or the string with smallest expected distance. To be able to measure this, computing the distance between a hypothesis and that distribution is necessary. This paper proposes two solutions for computing this value, when the distribution is defined with a probabilistic finite state automaton. The first is exact but has a cost which can be exponential in the length of the input string, whereas the second is a fully polynomial-time randomized schema.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On the suitability of Prototype Selection methods for kNN classification with distributed data

  • Valero-Mas, Jose J.
  • Calvo-Zaragoza, Jorge
  • Rico-Juan, Juan Ramón
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
  • Valero-Mas, Jose J.|||/items/8ad448df-2d0f-41e8-8403-cd85202b7263
In the current Information Age, data production and processing demands are ever increasing. This has motivated the appearance of large-scale distributed information. This phenomenon also applies to Pattern Recognition so that classic and common algorithms, such as the k-Nearest Neighbour, are unable to be used. To improve the efficiency of this classifier, Prototype Selection (PS) strategies can be used. Nevertheless, current PS algorithms were not designed to deal with distributed data, and their performance is therefore unknown under these conditions. This work is devoted to carrying out an experimental study on a simulated framework in which PS strategies can be compared under classical conditions as well as those expected in distributed scenarios. Our results report a general behaviour that is degraded as conditions approach to more realistic scenarios. However, our experiments also show that some methods are able to achieve a fairly similar performance to that of the non-distributed scenario. Thus, although there is a clear need for developing specific PS methodologies and algorithms for tackling these situations, those that reported a higher robustness against such conditions may be good candidates from which to start.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

An experimental study on rank methods for prototype selection

  • Valero-Mas, Jose J.
  • Calvo-Zaragoza, Jorge
  • Rico-Juan, Juan Ramón
  • Iñesta, José M.
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
  • Valero-Mas, Jose J.|||/items/8ad448df-2d0f-41e8-8403-cd85202b7263
Prototype selection is one of the most popular approaches for addressing the low efficiency issue typically found in the well-known k-Nearest Neighbour classification rule. These techniques select a representative subset from an original collection of prototypes with the premise of maintaining the same classification accuracy. Most recently, rank methods have been proposed as an alternative to develop new selection strategies. Following a certain heuristic, these methods sort the elements of the initial collection according to their relevance and then select the best possible subset by means of a parameter representing the amount of data to maintain. Due to the relative novelty of these methods, their performance and competitiveness against other strategies is still unclear. This work performs an exhaustive experimental study of such methods for prototype selection. A representative collection of both classic and sophisticated algorithms are compared to the aforementioned techniques in a number of datasets, including different levels of induced noise. Results report the remarkable competitiveness of these rank methods as well as their excellent trade-off between prototype reduction and achieved accuracy.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Improving classification using a Confidence Matrix based on weak classifiers applied to OCR

  • Rico-Juan, Juan Ramón
  • Calvo-Zaragoza, Jorge
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
This paper proposes a new feature representation method based on the construction of a Confidence Matrix (CM). This representation consists of posterior probability values provided by several weak classifiers, each one trained and used in different sets of features from the original sample. The CM allows the final classifier to abstract itself from discovering underlying groups of features. In this work the CM is applied to isolated character image recognition, for which several set of features can be extracted from each sample. Experimentation has shown that the use of CM permits a significant improvement in accuracy in most cases, while the others remain the same. The results were obtained after experimenting with four well-known corpora, using evolved meta-classifiers with the k-Nearest Neighbor rule as a weak classifier and by applying statistical significance tests.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Towards the Digital Encoding of Hispanic White Mensural Notation, Hacia la codificación digital de la notación mensural blanca hispánica

  • Rizo, David
  • Pascual Sánchez, Beatriz
  • Iñesta, José M.
  • Ezquerro Esteban, Antonio
  • González Marín, Luis Antonio
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
In this work, the elements necessary for digitally encoding music contained in manuscripts from the centuries 16th to 17th are introduced. The solutions proposed to overcome the difficulties that generate some of the aspects that make this notation different from the modern Western notation are presented. Problems faced are, for example, the absence of bar lines or the duration of notes that are based on the context. The new typographic font “Capitán”, created specifically to represent this type of early notation, is also presented.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

MirBot: A collaborative object recognition system for smartphones using convolutional neural networks

  • Pertusa, Antonio
  • Gallego, Antonio-Javier
  • Bernabeu, Marisa
  • Gallego, Antonio-Javier|||/items/8f865afc-8f63-4e0d-9408-bebc7ba836d0
  • Pertusa, Antonio|||/items/3bf633ff-4d49-4aaa-a004-abcf6fed3540
MirBot is a collaborative application for smartphones that allows users to perform object recognition. This app can be used to take a photograph of an object, select the region of interest and obtain the most likely class (dog, chair, etc.) by means of similarity search using features extracted from a convolutional neural network (CNN). The answers provided by the system can be validated by the user so as to improve the results for future queries. All the images are stored together with a series of metadata, thus enabling a multimodal incremental dataset labeled with synset identifiers from the WordNet ontology. This dataset grows continuously thanks to the users’ feedback, and is publicly available for research. This work details the MirBot object recognition system, analyzes the statistics gathered after more than four years of usage, describes the image classification methodology, and performs an exhaustive evaluation using handcrafted features, neural codes, different transfer learning techniques, PCA compression and metadata, which can be used to improve the image classifier results. The app is freely available at the Apple and Google Play stores.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Selecting promising classes from generated data for an efficient multi-class nearest neighbor classification

  • Calvo-Zaragoza, Jorge
  • Valero-Mas, Jose J.
  • Rico-Juan, Juan Ramón
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
  • Valero-Mas, Jose J.|||/items/8ad448df-2d0f-41e8-8403-cd85202b7263
The nearest neighbor rule is one of the most considered algorithms for supervised learning because of its simplicity and fair performance in most cases. However, this technique has a number of disadvantages, being the low computational efficiency the most prominent one. This paper presents a strategy to overcome this obstacle in multi-class classification tasks. This strategy proposes the use of Prototype Reduction algorithms that are capable of generating a new training set from the original one to try to gather the same information with fewer samples. Over this reduced set, it is estimated which classes are the closest ones to the input sample. These classes are referred to as promising classes. Eventually, classification is performed using the original training set using the nearest neighbor rule but restricted to the promising classes. Our experiments with several datasets and significance tests show that a similar classification accuracy can be obtained compared to using the original training set, with a significantly higher efficiency.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Oversampling imbalanced data in the string space

  • Castellanos, Francisco J.
  • Valero-Mas, Jose J.
  • Calvo-Zaragoza, Jorge
  • Rico-Juan, Juan Ramón
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Castellanos, Francisco J.|||/items/6b515109-60a8-4a00-a12d-0726355ae966
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
  • Valero-Mas, Jose J.|||/items/8ad448df-2d0f-41e8-8403-cd85202b7263
Imbalanced data is a typical problem in the supervised classification field, which occurs when the different classes are not equally represented. This fact typically results in the classifier biasing its performance towards the class representing the majority of the elements. Many methods have been proposed to alleviate this scenario, yet all of them assume that data is represented as feature vectors. In this paper we propose a strategy to balance a dataset whose samples are encoded as strings. Our approach is based on adapting the well-known Synthetic Minority Over-sampling Technique (SMOTE) algorithm to the string space. More precisely, data generation is achieved with an iterative approach to create artificial strings within the segment between two given samples of the training set. Results with several datasets and imbalance ratios show that the proposed strategy properly deals with the problem in all cases considered.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Prototype generation on structural data using dissimilarity space representation

  • Calvo-Zaragoza, Jorge
  • Valero-Mas, Jose J.
  • Rico-Juan, Juan Ramón
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
  • Valero-Mas, Jose J.|||/items/8ad448df-2d0f-41e8-8403-cd85202b7263
Data reduction techniques play a key role in instance-based classification to lower the amount of data to be processed. Among the different existing approaches, prototype selection (PS) and prototype generation (PG) are the most representative ones. These two families differ in the way the reduced set is obtained from the initial one: While the former aims at selecting the most representative elements from the set, the latter creates new data out of it. Although PG is considered to delimit more efficiently decision boundaries, the operations required are not so well defined in scenarios involving structural data such as strings, trees, or graphs. This work studies the possibility of using dissimilarity space (DS) methods as an intermediate process for mapping the initial structural representation to a statistical one, thereby allowing the use of PG methods. A comparative experiment over string data is carried out in which our proposal is faced to PS methods on the original space. Results show that the proposed strategy is able to achieve significantly similar results to PS in the initial space, thus standing as a clear alternative to the classic approach, with some additional advantages derived from the DS representation.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Music staff removal with supervised pixel classification

  • Calvo-Zaragoza, Jorge
  • Micó, Luisa
  • Oncina, Jose
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
This work presents a novel approach to tackle the music staff removal. This task is devoted to removing the staff lines from an image of a music score while maintaining the symbol information. It represents a key step in the performance of most optical music recognition systems. In the literature, staff removal is usually solved by means of image processing procedures based on the intrinsics of music scores. However, we propose to model the problem as a supervised learning classification task. Surprisingly, although there is a strong background and a vast amount of research concerning machine learning, the classification approach has remained unexplored for this purpose. In this context, each foreground pixel is labelled as either staff or symbol. We use pairs of scores with and without staff lines to train classification algorithms. We test our proposal with several well-known classification techniques. Moreover, in our experiments no attempt of tuning the classification algorithms has been made, but the parameters were set to the default setting provided by the classification software libraries. The aim of this choice is to show that, even with this straightforward procedure, results are competitive with state-of-the-art algorithms. In addition, we also discuss several advantages of this approach for which conventional methods are not applicable such as its high adaptability to any type of music score.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A Study of Prototype Selection Algorithms for Nearest Neighbour in Class-Imbalanced Problems

  • Valero-Mas, Jose J.
  • Calvo-Zaragoza, Jorge
  • Rico-Juan, Juan Ramón
  • Iñesta, José M.
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
  • Valero-Mas, Jose J.|||/items/8ad448df-2d0f-41e8-8403-cd85202b7263
Prototype Selection methods aim at improving the efficiency of the Nearest Neighbour classifier by selecting a set of representative examples of the training set. These techniques have been studied in situations in which the classes at issue are balanced, which is not representative of real-world data. Since class imbalance affects the classification performance, data-level balancing approaches that artificially create or remove data from the set have been proposed. In this work, we study the performance of a set of prototype selection algorithms in imbalanced and algorithmically-balanced contexts using data-driven approaches. Results show that the initial class balance remarkably influences the overall performance of prototype selection, being generally the best performances found when data is algorithmically balanced before the selection stage.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Computing the Expected Edit Distance from a String to a PFA

  • Calvo-Zaragoza, Jorge
  • Higuera, Colin de la
  • Oncina, Jose
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
In a number of fields one is to compare a witness string with a distribution. One possibility is to compute the probability of the string for that distribution. Another, giving a more global view, is to compute the expected edit distance from a string randomly drawn to the witness string. This number is often used to measure the performance of a prediction, the goal then being to return the median string, or the string with smallest expected distance. To be able to measure this, computing the distance between a hypothesis and that distribution is necessary. This paper proposes two solutions for computing this value, when the distribution is defined with a probabilistic finite state automaton. The first is exact but has a cost which can be exponential in the length of the input string, whereas the second is a FPRAS.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Interactive user correction of automatically detected onsets: approach and evaluation

  • Valero-Mas, Jose J.
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Valero-Mas, Jose J.|||/items/8ad448df-2d0f-41e8-8403-cd85202b7263
Onset detection still has room for improvement, especially when dealing with polyphonic music signals. For certain purposes in which the correctness of the result is a must, user intervention is hence required to correct the mistakes performed by the detection algorithm. In such interactive paradigm, the exactitude of the detection can be guaranteed at the expense of user’s work, being the effort required to accomplish the task, the value that has to be both quantified and reduced. The present work studies the idea of interactive onset detection and proposes a methodology for assessing the user’s workload, as well as a set of interactive schemes for reducing such workload when carrying out this detection task. Results show that the evaluation strategy proposed is able to quantitatively assess the invested user effort. Also, the presented interactive schemes significantly facilitate the correction task compared with the manual annotation.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Data-based melody generation through multi-objective evolutionary computation

  • Ponce de León Amador, Pedro José
  • Iñesta, José M.
  • Calvo-Zaragoza, Jorge
  • Rizo, David
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Ponce de León Amador, Pedro José|||/items/9301f92f-611c-4636-a5c2-89fcfbe35694
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
Genetic-based composition algorithms are able to explore an immense space of possibilities, but the main difficulty has always been the implementation of the selection process. In this work, sets of melodies are utilized for training a machine learning approach to compute fitness, based on different metrics. The fitness of a candidate is provided by combining the metrics, but their values can range through different orders of magnitude and evolve in different ways, which makes it hard to combine these criteria. In order to solve this problem, a multi-objective fitness approach is proposed, in which the best individuals are those in the Pareto front of the multi-dimensional fitness space. Melodic trees are also proposed as a data structure for chromosomic representation of melodies and genetic operators are adapted to them. Some experiments have been carried out using a graphical interface prototype that allows one to explore the creative capabilities of the proposed system. An Online Supplement is provided and can be accessed at http://dx.doi.org/10.1080/17459737.2016.1188171, where the reader can find some technical details, information about the data used, generated melodies, and additional information about the developed prototype and its performance.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Recognition of pen-based music notation with finite-state machines

  • Calvo-Zaragoza, Jorge
  • Oncina, Jose
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
This work presents a statistical model to recognize pen-based music compositions using stroke recognition algorithms and finite-state machines. The series of strokes received as input is mapped onto a stochastic representation, which is combined with a formal language that describes musical symbols in terms of stroke primitives. Then, a Probabilistic Finite-State Automaton is obtained, which defines probabilities over the set of musical sequences. This model is eventually crossed with a semantic language to avoid sequences that does not make musical sense. Finally, a decoding strategy is applied in order to output a hypothesis about the musical sequence actually written. Comprehensive experimentation with several decoding algorithms, stroke similarity measures and probability density estimators are tested and evaluated following different metrics of interest. Results found have shown the goodness of the proposed model, obtaining competitive performances in all metrics and scenarios considered.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

An efficient approach for Interactive Sequential Pattern Recognition

  • Calvo-Zaragoza, Jorge
  • Oncina, Jose
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
Interactive Pattern Recognition (IPR) is an emergent framework in which the user is involved actively in the recognition process by giving feedback to the system when an error is detected. Although this framework is expected to reduce the number of errors to correct, it may increase the time required to complete the task since the machine needs to recompute its proposal after each interaction. Therefore, a fast computation is required to make the interactive system profitable and user-friendly. This work presents an efficient approach to deal with IPR tasks when data has a sequential nature. Our approach includes some computation at the very beginning of the task but it then achieves a linear complexity after user corrections. We also show how these tasks can be effectively carried out if the solution space is defined with a Regular Language. This fact has indeed proven to be the most relevant factor to improve the efficiency of the approach. Several experiments are carried out in which our proposal is faced against a classical search. Results show a reduction in time in all experiments considered, solving efficiently some complex IPR tasks thanks to our proposals.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Staff-line removal with selectional auto-encoders

  • Gallego, Antonio-Javier
  • Calvo-Zaragoza, Jorge
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Gallego, Antonio-Javier|||/items/8f865afc-8f63-4e0d-9408-bebc7ba836d0
Staff-line removal is an important preprocessing stage as regards most Optical Music Recognition systems. The common procedures employed to carry out this task involve image processing techniques. In contrast to these traditional methods, which are based on hand-engineered transformations, the problem can also be approached from a machine learning point of view if representative examples of the task are provided. We propose doing this through the use of a new approach involving auto-encoders, which select the appropriate features of an input feature set (Selectional Auto-Encoders). Within the context of the problem at hand, the model is trained to select those pixels of a given image that belong to a musical symbol, thus removing the lines of the staves. Our results show that the proposed technique is quite competitive and significantly outperforms the other state-of-art strategies considered, particularly when dealing with grayscale input images.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Machine learning and music generation

  • Iñesta, José M.
  • Conklin, Darrell
  • Ramírez, Rafael, 1966-
We guest editors acknowledge the financial support of the following funding sources: the Ministerio de Economía y Competitividad project TIMuL [No. TIN2013–48152–C2–1–R]; [No. TIN2013–48152–C2–2–R, supported by UE FEDER funds]; the project Lrn2Cre8, which is funded by the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission [FET grant number 610859]; the European Union Horizon 2020 research and innovation programme [grant agreement number 688269].
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Analyzing the influence of pitch quantization and note segmentation on singing voice alignment in the context of audio-based Query-by-Humming

  • Valero-Mas, Jose J.
  • Salamon, Justin
  • Gómez Gutiérrez, Emilia, 1975-
Comunicació presentada a: 12th International Conference on Sound and Music Computing (SMC-15) celebrada del 30 de juliol a l'1 d'agost de 2015 a Maynooth, Ireland., Query-by-Humming (QBH) systems base their operation on aligning the melody sung/hummed by a user with a set of candidate melodies retrieved from polyphonic songs. While MIDI-based QBH builds on the premise of existing annotated transcriptions for any candidate song, audiobased research makes use of melody estimation algorithms for the songs. In both cases, a melody abstraction process is required for solving issues commonly found in queries such as key transpositions or tempo deviations. Full automatic music processes are commonly used for this, but due to the reported limitations in state-of-the-art methods for real-world queries, other possibilities should be considered. In this work we explore three different melody representations, ranging from a general time-series one to more musical abstractions, which avoid full automatic transcription, in the context of an audio-based QBH system. Results show that this abstraction process plays a key role in the overall accuracy of the system, obtaining the best scores when temporal segmentation is dynamically performed in terms of pitch change events in the melodic contour., This research work has been partially supported by Consejería de Educación de la Comunitat Valenciana through project PROMETEO/2012/017, Vicerrectorado de Investigación, Desarrollo e Innovación de la Universidad de Alicante through FPU programme (UAFPU2014–5883), the Spanish Ministerio de Econom´ıa y Competitividad through project TIMuL (No. TIN2013–48152–C2–1–R, supported by EU FEDER funds) and the Spanish entity Fundació Obra Social ’laCaixa’. Authors would also like to thank José M. Iñesta for kindly proofreading this paper.