2016
Bosch, V.; Calvo-Zaragoza, J.; Toselli, A. H.; Vidal, E.
Sheet Music Statistical Layout Analysis Proceedings Article
In: 15th International Conference on Frontiers in Handwriting Recognition, 2016.
@inproceedings{k351,
title = {Sheet Music Statistical Layout Analysis},
author = {V. Bosch and J. Calvo-Zaragoza and A. H. Toselli and E. Vidal},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/351/musicSheetLayout.pdf},
year = {2016},
date = {2016-01-01},
booktitle = {15th International Conference on Frontiers in Handwriting Recognition},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.; Toselli, A. H.; Vidal, E.
Early Handwritten Music Recognition with Hidden Markov Models Proceedings Article
In: 15th International Conference on Frontiers in Handwriting Recognition, 2016.
@inproceedings{k350,
title = {Early Handwritten Music Recognition with Hidden Markov Models},
author = {J. Calvo-Zaragoza and A. H. Toselli and E. Vidal},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/350/musicNoteRecogIcfhr16.pdf},
year = {2016},
date = {2016-01-01},
booktitle = {15th International Conference on Frontiers in Handwriting Recognition},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.
Pattern Recognition for Music Notation PhD Thesis
2016.
@phdthesis{k343,
title = {Pattern Recognition for Music Notation},
author = {J. Calvo-Zaragoza},
editor = {Juan R. Rico-Juan and Jose Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/343/thesis-jcalvo.pdf},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
organization = {Universidad de Alicante},
keywords = {},
pubstate = {published},
tppubtype = {phdthesis}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R.
Selecting promising classes from generated data for an efficient multi-class NN classification Journal Article
In: Soft Computing, 2016.
@article{k340,
title = {Selecting promising classes from generated data for an efficient multi-class NN classification},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R. Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/340/selecting-promising-classes.pdf},
year = {2016},
date = {2016-01-01},
journal = {Soft Computing},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {article}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R.
Prototype Generation on Structural Data using Dissimilarity Space Representation Journal Article
In: Neural Computing and Applications, 2016.
@article{k337,
title = {Prototype Generation on Structural Data using Dissimilarity Space Representation},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R. Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/337/prototype-generation-structural.pdf},
year = {2016},
date = {2016-01-01},
journal = {Neural Computing and Applications},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {article}
}
Calvo-Zaragoza, J.; Micó, L.; Oncina, J.
Music staff removal with supervised pixel classification Journal Article
In: International Journal on Document Analysis and Recognition, vol. 19, no. 3, pp. 211-219, 2016, ISSN: 1433-2833.
@article{k336,
title = {Music staff removal with supervised pixel classification},
author = {J. Calvo-Zaragoza and L. Micó and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/336/classification-approach-staff.pdf},
issn = {1433-2833},
year = {2016},
date = {2016-01-01},
journal = {International Journal on Document Analysis and Recognition},
volume = {19},
number = {3},
pages = {211-219},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {article}
}
Illescas, P. R.
Análisis tonal asistido por ordenador PhD Thesis
2016.
Abstract | Links | BibTeX | Tags: TIMuL
@phdthesis{k335,
title = {Análisis tonal asistido por ordenador},
author = {P. R. Illescas},
editor = {J. M. Iñesta and D. Rizo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/335/PhD_placido+illescas-lectura_digital.pdf},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
address = {Alicante},
organization = {Universidad de Alicante},
abstract = {En este trabajo se plantean fundamentalmente cuatro cuestiones de investigación:
1. Realizar unas reseñas sobre la evolución del análisis desde su invención hasta todo lo que se desarrolla entorno al análisis-computacional.
2. Contestar a la cuestión de si es posible (o hasta qué punto) desarrollar reglas armónicas, contrapuntísticas, tonales y funcionales que nos permitan analizar automáticamente los corales armonizados de J. S. Bach.
3. Implementar un programa que en base a las especificaciones producidas en el segundo bloque, analice los corales armonizados de Bach detectando la tonalidad y las modulaciones, los acordes, las funciones tonales y catalogando las notas como reales o extrañas.
4. Explorar las posibilidades de mejorar los resultados producidos por el sistema mediante las interacciones que un experto o estudiante puedan establecer con el mismo, esto abre la puerta a aplicaciones didácticas del sistema.},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {phdthesis}
}
En este trabajo se plantean fundamentalmente cuatro cuestiones de investigación:
1. Realizar unas reseñas sobre la evolución del análisis desde su invención hasta todo lo que se desarrolla entorno al análisis-computacional.
2. Contestar a la cuestión de si es posible (o hasta qué punto) desarrollar reglas armónicas, contrapuntísticas, tonales y funcionales que nos permitan analizar automáticamente los corales armonizados de J. S. Bach.
3. Implementar un programa que en base a las especificaciones producidas en el segundo bloque, analice los corales armonizados de Bach detectando la tonalidad y las modulaciones, los acordes, las funciones tonales y catalogando las notas como reales o extrañas.
4. Explorar las posibilidades de mejorar los resultados producidos por el sistema mediante las interacciones que un experto o estudiante puedan establecer con el mismo, esto abre la puerta a aplicaciones didácticas del sistema.2015
Calvo-Zaragoza, J.; Barbancho, I.; Tardón, L. J.; Barbancho, A. M.
Avoiding staff removal stage in optical music recognition: application to scores written in white mensural notation Journal Article
In: Pattern Analysis and Applications, vol. 18, no. 4, pp. 933-943, 2015, ISSN: 1433-7541.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@article{k318,
title = {Avoiding staff removal stage in optical music recognition: application to scores written in white mensural notation},
author = {J. Calvo-Zaragoza and I. Barbancho and L. J. Tardón and A. M. Barbancho},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/318/paaa-jcalvo.pdf},
issn = {1433-7541},
year = {2015},
date = {2015-11-01},
urldate = {2015-11-01},
journal = {Pattern Analysis and Applications},
volume = {18},
number = {4},
pages = {933-943},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
Valero-Mas, J. J.; Iñesta, J. M.
Interactive onset detection in audio recordings Technical Report
Málaga, Spain, 2015.
Abstract | Links | BibTeX | Tags: TIMuL
@techreport{k334,
title = {Interactive onset detection in audio recordings},
author = {J. J. Valero-Mas and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/334/OnsetInteraction-LBD.pdf},
year = {2015},
date = {2015-10-01},
booktitle = {Late Breaking/Demo extended abstract, 16th International Society for Music Information Retrieval Conference (ISMIR)},
address = {Málaga, Spain},
organization = {University of Alicante},
abstract = {Onset detection still has room for improvement. State-of-the-art onset detection algorithms achieve good results for a range of applications, but for some situations in which the accuracy is a must, human intervention is required to correct the mistakes committed. In such scheme, accuracy in the result is guaranteed at the expense of the manual correction of all errors. Hence, the issue now lies on finding schemes for efficiently exploiting and reducing that user effort. In this work we present an Interactive Pattern Recognition approach for tackling this issue: using a pre-trained classification-based onset detection algorithm, every time the user corrects an error in the estimation, the system modifies its performance accordingly and recalculates the output. Initial results show that user effort is effectively reduced under our proposal.},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {techreport}
}
Onset detection still has room for improvement. State-of-the-art onset detection algorithms achieve good results for a range of applications, but for some situations in which the accuracy is a must, human intervention is required to correct the mistakes committed. In such scheme, accuracy in the result is guaranteed at the expense of the manual correction of all errors. Hence, the issue now lies on finding schemes for efficiently exploiting and reducing that user effort. In this work we present an Interactive Pattern Recognition approach for tackling this issue: using a pre-trained classification-based onset detection algorithm, every time the user corrects an error in the estimation, the system modifies its performance accordingly and recalculates the output. Initial results show that user effort is effectively reduced under our proposal. Calvo-Zaragoza, J.; de León, P. J. Ponce; Iñesta, J. M.; Rizo, D.
Genre-based melody generation through multi-objective genetic algorithms Proceedings Article
In: Proceedings of the 8th Machine Learning and Music workshop (MML 2015), Vancouver (Canada), 2015.
Abstract | BibTeX | Tags: TIMuL
@inproceedings{k332,
title = {Genre-based melody generation through multi-objective genetic algorithms},
author = {J. Calvo-Zaragoza and P. J. Ponce de León and J. M. Iñesta and D. Rizo},
year = {2015},
date = {2015-08-01},
urldate = {2015-08-01},
booktitle = {Proceedings of the 8th Machine Learning and Music workshop (MML 2015)},
address = {Vancouver (Canada)},
abstract = {Genetic-based composition algorithms have the ability to ex- plore an immense space of possibilities but the main di},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Genetic-based composition algorithms have the ability to ex- plore an immense space of possibilities but the main di Valero-Mas, J. J.; Salamon, J.; Gómez, E.
Analyzing the influence of pitch quantization and note segmentation on singing voice alignment in the context of audio-based Query-by-Humming Proceedings Article
In: Proceedings of the 12th Sound and Music Computing Conference (SMC), pp. 371–378, Maynooth, Ireland, 2015, ISBN: 9--7809--92746629.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIMuL
@inproceedings{k331,
title = {Analyzing the influence of pitch quantization and note segmentation on singing voice alignment in the context of audio-based Query-by-Humming},
author = {J. J. Valero-Mas and J. Salamon and E. Gómez},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/331/QBH_SMC2015_CameraReady.pdf},
isbn = {9--7809--92746629},
year = {2015},
date = {2015-07-01},
booktitle = {Proceedings of the 12th Sound and Music Computing Conference (SMC)},
pages = {371--378},
address = {Maynooth, Ireland},
abstract = {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 music tunes. While MIDI-based QBH builds on the premise of existing annotated transcriptions for any candidate song, audio-based research makes use of melody extraction algorithms for the music tunes. In both cases, a melody abstraction process is required for solving issues commonly found in queries such as key transpositions or tempo deviations. Automatic music transcription is 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 the automatic transcription step, 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.},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
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 music tunes. While MIDI-based QBH builds on the premise of existing annotated transcriptions for any candidate song, audio-based research makes use of melody extraction algorithms for the music tunes. In both cases, a melody abstraction process is required for solving issues commonly found in queries such as key transpositions or tempo deviations. Automatic music transcription is 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 the automatic transcription step, 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. Calvo-Zaragoza, J.; Oncina, J.
Clustering of Strokes from Pen-based Music Notation: An Experimental Study Proceedings Article
In: Paredes, Roberto; Cardoso, Jaime S.; Pardo, Xosé M. (Ed.): 7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), pp. 633-640, Springer, Santiago de Compostela, Spain, 2015, ISBN: 978-3-319-19389-2.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@inproceedings{k326,
title = {Clustering of Strokes from Pen-based Music Notation: An Experimental Study},
author = {J. Calvo-Zaragoza and J. Oncina},
editor = {Roberto Paredes and Jaime S. Cardoso and Xosé M. Pardo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/326/clustering-strokes-pen.pdf},
isbn = {978-3-319-19389-2},
year = {2015},
date = {2015-06-01},
booktitle = {7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA)},
pages = {633-640},
publisher = {Springer},
address = {Santiago de Compostela, Spain},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R.
Prototype Generation on Structural Data using Dissimilarity Space Representation: A Case of Study Proceedings Article
In: Paredes, Roberto; Cardoso, Jaime S.; Pardo, Xosé M. (Ed.): 7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), pp. 72-82, Springer, Santiago de Compostela, Spain, 2015, ISBN: 978-3-319-19389-2.
Abstract | Links | BibTeX | Tags: TIMuL
@inproceedings{k325,
title = {Prototype Generation on Structural Data using Dissimilarity Space Representation: A Case of Study},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R. Rico-Juan},
editor = {Roberto Paredes and Jaime S. Cardoso and Xosé M. Pardo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/325/prototype-generation-structural.pdf},
isbn = {978-3-319-19389-2},
year = {2015},
date = {2015-06-01},
booktitle = {7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA)},
pages = {72-82},
publisher = {Springer},
address = {Santiago de Compostela, Spain},
abstract = {Data Reduction techniques are commonly applied in instance-based classification tasks to lower the amount of data to be processed. Prototype Selection (PS) and Prototype Generation (PG) constitute the most representative approaches. These two families differ in the way of obtaining the reduced set out of 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 better delimit decision boundaries, operations required are not so well defined in scenarios involving structural data such as strings, trees or graphs.
This work proposes a case of study with the use of the common RandomC algorithm for mapping the initial structural data to a Dissimilarity Space (DS) representation, 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 PG combined with RandomC mapping achieves a very competitive performance, although the obtained accuracy seems to be bounded by the representativity of the DS method.},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Data Reduction techniques are commonly applied in instance-based classification tasks to lower the amount of data to be processed. Prototype Selection (PS) and Prototype Generation (PG) constitute the most representative approaches. These two families differ in the way of obtaining the reduced set out of 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 better delimit decision boundaries, operations required are not so well defined in scenarios involving structural data such as strings, trees or graphs.
This work proposes a case of study with the use of the common RandomC algorithm for mapping the initial structural data to a Dissimilarity Space (DS) representation, 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 PG combined with RandomC mapping achieves a very competitive performance, although the obtained accuracy seems to be bounded by the representativity of the DS method. Martínez-Álvarez, A.; Cuenca-Asensi, S.; Ortiz, A.; Calvo-Zaragoza, J.; Vivas-Tejuelo, L. A.
Tuning compilations by multi-objective optimization: Application to Apache web server Journal Article
In: Applied Soft Computing, vol. 29, pp. 461-470, 2015.
BibTeX | Tags:
@article{k327,
title = {Tuning compilations by multi-objective optimization: Application to Apache web server},
author = {A. Martínez-Álvarez and S. Cuenca-Asensi and A. Ortiz and J. Calvo-Zaragoza and L. A. Vivas-Tejuelo},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Applied Soft Computing},
volume = {29},
pages = {461-470},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R
Improving kNN multi-label classification in Prototype Selection scenarios using class proposals Journal Article
In: Pattern Recognition, vol. 48, no. 5, pp. 1608-1622, 2015.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@article{k324,
title = {Improving kNN multi-label classification in Prototype Selection scenarios using class proposals},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/324/improving-knn-multi.pdf},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Pattern Recognition},
volume = {48},
number = {5},
pages = {1608-1622},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
Rico-Juan, J. R.; Calvo-Zaragoza, J.
Improving classification using a Confidence Matrix based on weak classifiers applied to OCR Journal Article
In: Neurocomputing, vol. 151, pp. 1354–1361, 2015, ISSN: 0925-2312.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@article{k323,
title = {Improving classification using a Confidence Matrix based on weak classifiers applied to OCR},
author = {J. R. Rico-Juan and J. Calvo-Zaragoza},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/323/cm.pdf},
issn = {0925-2312},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Neurocomputing},
volume = {151},
pages = {1354–1361},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
Rizo, D.; Iñesta, J. M.
A grammar for Plaine and Easie Code Proceedings Article
In: Roland, Perry; Kepper, Johannes (Ed.): Proceedings of the Music Encoding Initiative Conferences 2013 and 2014, pp. 54–64, 2015.
BibTeX | Tags: GRE-12-34, Prometeo 2012, TIMuL
@inproceedings{k321,
title = {A grammar for Plaine and Easie Code},
author = {D. Rizo and J. M. Iñesta},
editor = {Perry Roland and Johannes Kepper},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
booktitle = {Proceedings of the Music Encoding Initiative Conferences 2013 and 2014},
pages = {54--64},
keywords = {GRE-12-34, Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Micó, L.; Sanches, J.; Cardoso, J. S.
The vitality of pattern recognition and image analysis Journal Article
In: Neurocomputing, vol. 150, pp. 124-125, 2015, ISSN: 09252312.
BibTeX | Tags: Prometeo 2012, TIMuL
@article{k320,
title = {The vitality of pattern recognition and image analysis},
author = {L. Micó and J. Sanches and J. S. Cardoso},
issn = {09252312},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Neurocomputing},
volume = {150},
pages = {124-125},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
2014
Illescas, P. R.; Rizo, D.; Iñesta, J. M.
Melodic analysis of polyphonic music using an interactive pattern recognition tool Proceedings Article
In: Proc. of 7th Machine Learning and Music (MML2014), Barcelona, 2014.
@inproceedings{k328,
title = {Melodic analysis of polyphonic music using an interactive pattern recognition tool},
author = {P. R. Illescas and D. Rizo and J. M. Iñesta},
year = {2014},
date = {2014-12-01},
booktitle = {Proc. of 7th Machine Learning and Music (MML2014)},
address = {Barcelona},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.; Oncina, J.
Recognition of Pen-Based Music Notation: the HOMUS dataset Proceedings Article
In: Proceedings of the 22nd International Conference on Pattern Recognition, pp. 3038-3043, Stockholm, Sweden, 2014, ISBN: 978-1-4799-5208-3.
Links | BibTeX | Tags: Prometeo 2012
@inproceedings{k316,
title = {Recognition of Pen-Based Music Notation: the HOMUS dataset},
author = {J. Calvo-Zaragoza and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/316/homus.pdf},
isbn = {978-1-4799-5208-3},
year = {2014},
date = {2014-08-01},
urldate = {2014-08-01},
booktitle = {Proceedings of the 22nd International Conference on Pattern Recognition},
pages = {3038-3043},
address = {Stockholm, Sweden},
keywords = {Prometeo 2012},
pubstate = {published},
tppubtype = {inproceedings}
}
Rico-Juan, J. R.; Iñesta, J. M.
Adaptive training set reduction for nearest neighbor classification Journal Article
In: Neurocomputing, vol. 138, pp. 316–324, 2014, ISSN: 0925-2312.
@article{k311,
title = {Adaptive training set reduction for nearest neighbor classification},
author = {J. R. Rico-Juan and J. M. Iñesta},
issn = {0925-2312},
year = {2014},
date = {2014-08-01},
journal = {Neurocomputing},
volume = {138},
pages = {316--324},
abstract = {The research community related to the human-interaction framework is becoming increasingly more interested in interactive pattern recognition, taking direct advantage of the feedback information provided by the user in each interaction step in order to improve raw performance. The application of this scheme requires learning techniques that are able to adaptively re-train the system and tune it to user behavior and the specific task considered. Traditional static editing methods filter the training set by applying certain rules in order to eliminate outliers or maintain those prototypes that can be beneficial in classification. This paper presents two new adaptive rank methods for selecting the best prototypes from a training set in order to establish its size according to an external parameter that controls the adaptation process, while maintaining the classification accuracy. These methods estimate the probability of each prototype of correctly classifying a new sample. This probability is used to sort the training set by relevance in classification. The results show that the proposed methods are able to maintain the error rate while reducing the size of the training set, thus allowing new examples to be learned with a few extra computations.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The research community related to the human-interaction framework is becoming increasingly more interested in interactive pattern recognition, taking direct advantage of the feedback information provided by the user in each interaction step in order to improve raw performance. The application of this scheme requires learning techniques that are able to adaptively re-train the system and tune it to user behavior and the specific task considered. Traditional static editing methods filter the training set by applying certain rules in order to eliminate outliers or maintain those prototypes that can be beneficial in classification. This paper presents two new adaptive rank methods for selecting the best prototypes from a training set in order to establish its size according to an external parameter that controls the adaptation process, while maintaining the classification accuracy. These methods estimate the probability of each prototype of correctly classifying a new sample. This probability is used to sort the training set by relevance in classification. The results show that the proposed methods are able to maintain the error rate while reducing the size of the training set, thus allowing new examples to be learned with a few extra computations. Calvo-Zaragoza, J.; Oncina, J.
Recognition of Pen-based Music Notation with Probabilistic Machines Proceedings Article
In: Proceedings of the 7th International Workshop on Machine Learning and Music, Barcelona, Spain, 2014.
@inproceedings{k330,
title = {Recognition of Pen-based Music Notation with Probabilistic Machines},
author = {J. Calvo-Zaragoza and J. Oncina},
year = {2014},
date = {2014-01-01},
booktitle = {Proceedings of the 7th International Workshop on Machine Learning and Music},
address = {Barcelona, Spain},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Valero-Mas, J. J.; Iñesta, J. M.; Pérez-Sancho, C.
Onset detection with the user in the learning loop Proceedings Article
In: Proceedings of the 7th International Workshop on Music and Machine Learning (MML2014), Barcelona, Spain, 2014.
@inproceedings{k329,
title = {Onset detection with the user in the learning loop},
author = {J. J. Valero-Mas and J. M. Iñesta and C. Pérez-Sancho},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/329/onset-detection-user.pdf},
year = {2014},
date = {2014-01-01},
booktitle = {Proceedings of the 7th International Workshop on Music and Machine Learning (MML2014)},
address = {Barcelona, Spain},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Micó, L.; Oncina, J.
Dynamic Insertions in TLAESA fast NN Search Algorithm Proceedings Article
In: Proceedings of the 22nd International Conference on Pattern Recognition, ICPR, Stockholm, Sweden, 2014, ISBN: 978-1-4799-5208-3.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIMuL
@inproceedings{k319,
title = {Dynamic Insertions in TLAESA fast NN Search Algorithm},
author = {L. Micó and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/319/icpr-2014.pdf},
isbn = {978-1-4799-5208-3},
year = {2014},
date = {2014-01-01},
booktitle = {Proceedings of the 22nd International Conference on Pattern Recognition, ICPR},
address = {Stockholm, Sweden},
abstract = {Nearest Neighbour search (NNS) is a widely used
technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. The need to work with large dynamic databases in interactive or online systems, has resulted in an increase interest in adapting or
creating fast methods to update these indexes. TLAESA is a fast search algorithm that computes a very low number of distance computations with sublinear overhead using a branch and bound technique.
In this paper, we propose a new fast updating method for the
TLAESA index. The behaviour of this index has been analysed
theoretical and experimentally. We have obtained a log-square
upper bound of the rebuilding expected time. This bound has
been verified experimentally on several synthetic and real data
experiments.},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Nearest Neighbour search (NNS) is a widely used
technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. The need to work with large dynamic databases in interactive or online systems, has resulted in an increase interest in adapting or
creating fast methods to update these indexes. TLAESA is a fast search algorithm that computes a very low number of distance computations with sublinear overhead using a branch and bound technique.
In this paper, we propose a new fast updating method for the
TLAESA index. The behaviour of this index has been analysed
theoretical and experimentally. We have obtained a log-square
upper bound of the rebuilding expected time. This bound has
been verified experimentally on several synthetic and real data
experiments. Conklin, D.; Ramírez, R.; Iñesta, J. M.
New Directions in Music and Machine Learning Journal Article
In: Journal of New Music Research, vol. 43, no. 3, pp. 251–254, 2014, ISSN: 0929-8215.
BibTeX | Tags:
@article{k317,
title = {New Directions in Music and Machine Learning},
author = {D. Conklin and R. Ramírez and J. M. Iñesta},
issn = {0929-8215},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Journal of New Music Research},
volume = {43},
number = {3},
pages = {251--254},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Martínez-Álvarez, A.; Calvo-Zaragoza, J.; Cuenca-Asensi, S.; Ortiz, A.; Jimeno-Morenilla, A.
Multi-objective adaptive evolutionary strategy for tuning compilations Journal Article
In: Neurocomputing, vol. 123, pp. 381-389, 2014, ISSN: 0925-2312.
BibTeX | Tags:
@article{k309,
title = {Multi-objective adaptive evolutionary strategy for tuning compilations},
author = {A. Martínez-Álvarez and J. Calvo-Zaragoza and S. Cuenca-Asensi and A. Ortiz and A. Jimeno-Morenilla},
issn = {0925-2312},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Neurocomputing},
volume = {123},
pages = {381-389},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Abreu, J.; Rico-Juan, J. R.
A New Iterative Algorithm for Computing a Quality Approximated Median of Strings based on Edit Operations Journal Article
In: Pattern Recognition Letters, vol. 36, pp. 74–80, 2014.
Abstract | Links | BibTeX | Tags: TIASA
@article{k308,
title = {A New Iterative Algorithm for Computing a Quality Approximated Median of Strings based on Edit Operations},
author = {J. Abreu and J. R. Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/308/PRL+-+A+New+Iterative+Algorithm+for+Computing+a+Quality+Median.pdf},
year = {2014},
date = {2014-01-01},
journal = {Pattern Recognition Letters},
volume = {36},
pages = {74--80},
abstract = {This paper presents a new algorithm that can be used to compute an approximation to the median of a set of strings. The approximate median is obtained through the successive improvements of a partial solution. The edit distance from the partial solution to all the strings in the set is computed in each iteration, thus accounting for the frequency of each of the edit operations in all the positions of the approximate median. A goodness index for edit operations is later computed by multiplying their frequency by the cost. Each operation is tested, starting from that with the highest index, in order to verify whether applying it to the partial solution leads to an improvement. If successful, a new iteration begins from the new approximate median. The algorithm finishes when all the operations have been examined without a better solution being found. Comparative experiments involving Freeman chain codes encoding 2D shapes and the Copenhagen chromosome database show that the quality of the approximate median string is similar to benchmark approaches but achieves a much faster convergence.},
keywords = {TIASA},
pubstate = {published},
tppubtype = {article}
}
This paper presents a new algorithm that can be used to compute an approximation to the median of a set of strings. The approximate median is obtained through the successive improvements of a partial solution. The edit distance from the partial solution to all the strings in the set is computed in each iteration, thus accounting for the frequency of each of the edit operations in all the positions of the approximate median. A goodness index for edit operations is later computed by multiplying their frequency by the cost. Each operation is tested, starting from that with the highest index, in order to verify whether applying it to the partial solution leads to an improvement. If successful, a new iteration begins from the new approximate median. The algorithm finishes when all the operations have been examined without a better solution being found. Comparative experiments involving Freeman chain codes encoding 2D shapes and the Copenhagen chromosome database show that the quality of the approximate median string is similar to benchmark approaches but achieves a much faster convergence. Higuera, C. De La; Oncina, J.
The most probable string: an algorithmic study Journal Article
In: Journal of Logic and Computation, vol. 24, no. 2, pp. 311-330, 2014, ISSN: 0955-792X.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIASA
@article{k304,
title = {The most probable string: an algorithmic study},
author = {C. De La Higuera and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/304/J+Logic+Computation-2013.pdf},
issn = {0955-792X},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Journal of Logic and Computation},
volume = {24},
number = {2},
pages = {311-330},
abstract = {The problem of finding the consensus (most probable string) for a distribution generated by a weighted finite automaton or a probabilistic grammar is related to a number of important questions: computing the distance between two distributions or finding the best translation (the most probable one) given a probabilistic finite state transducer. The problem is undecidable
with general weights and is NP-hard if the automaton is probabilistic. We give a pseudo-polynomial algorithm that solves a decision problem directly associated with the consensus string and answers if there is a (reasonably short) string whose probability is larger than a given bound in time polynomial in the the size of this bound, both for probabilistic finite automata
and probabilistic context-free grammars.We also study a randomized algorithm solving the same problem. Finally, we report links between the length of the consensus string and the probability of this string.},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {article}
}
The problem of finding the consensus (most probable string) for a distribution generated by a weighted finite automaton or a probabilistic grammar is related to a number of important questions: computing the distance between two distributions or finding the best translation (the most probable one) given a probabilistic finite state transducer. The problem is undecidable
with general weights and is NP-hard if the automaton is probabilistic. We give a pseudo-polynomial algorithm that solves a decision problem directly associated with the consensus string and answers if there is a (reasonably short) string whose probability is larger than a given bound in time polynomial in the the size of this bound, both for probabilistic finite automata
and probabilistic context-free grammars.We also study a randomized algorithm solving the same problem. Finally, we report links between the length of the consensus string and the probability of this string. López-García, G.; Gallego, A. J.; Molina-Carmona, R.; Compañ-Rosique, P.
Construction of Intelligent Virtual Worlds Using a Grammatical Framework Journal Article
In: International Journal of Intelligent Systems, vol. 29, no. 8, pp. 751-766, 2014.
BibTeX | Tags:
@article{k515,
title = {Construction of Intelligent Virtual Worlds Using a Grammatical Framework},
author = {G. López-García and A. J. Gallego and R. Molina-Carmona and P. Compañ-Rosique},
year = {2014},
date = {2014-01-01},
journal = {International Journal of Intelligent Systems},
volume = {29},
number = {8},
pages = {751-766},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2013
Piccoli, H. C. B.; Silla, C. N. Jr.; León, P. J. Ponce; Pertusa, A.
An Evaluation of Symbolic Feature Sets and Their Combination for Music Genre Classification Proceedings Article
In: Proc. of the 2013 IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 1901-1905, IEEE Computer Society, Manchester, UK, 2013, ISBN: 978-0-7695-5154-8.
Abstract | Links | BibTeX | Tags:
@inproceedings{k312,
title = {An Evaluation of Symbolic Feature Sets and Their Combination for Music Genre Classification},
author = {H. C. B. Piccoli and C. N. Jr. Silla and P. J. Ponce León and A. Pertusa},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/312/2013-SMC-MGC-camera-ready.pdf},
isbn = {978-0-7695-5154-8},
year = {2013},
date = {2013-10-01},
booktitle = {Proc. of the 2013 IEEE International Conference on Systems, Man and Cybernetics (SMC)},
pages = {1901-1905},
publisher = {IEEE Computer Society},
address = {Manchester, UK},
abstract = {The automatic music genre classification task is an active area of research in the field of Music Information Retrieval. In this paper we use two different symbolic feature sets for genre classification and combine them using an early fusion approach. Our results show that early fusion achieves better classification accuracy than using any of the individual feature sets. Furthermore, when compared with some of the state of the art approaches using the same experimental conditions, early fusion of symbolic features is ranked the second best method.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The automatic music genre classification task is an active area of research in the field of Music Information Retrieval. In this paper we use two different symbolic feature sets for genre classification and combine them using an early fusion approach. Our results show that early fusion achieves better classification accuracy than using any of the individual feature sets. Furthermore, when compared with some of the state of the art approaches using the same experimental conditions, early fusion of symbolic features is ranked the second best method. Calvo-Zaragoza, J.; Oncina, J.
Human-Computer Interaction for Optical Music Recognition tasks Proceedings Article
In: Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes, pp. 9-12, Madrid, Spain, 2013, ISBN: 978-84-695-8332-6.
Links | BibTeX | Tags: Prometeo 2012, TIASA
@inproceedings{k306,
title = {Human-Computer Interaction for Optical Music Recognition tasks},
author = {J. Calvo-Zaragoza and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/306/wsrfai2013_submission_3.pdf},
isbn = {978-84-695-8332-6},
year = {2013},
date = {2013-09-01},
urldate = {2013-09-01},
booktitle = {Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes},
pages = {9-12},
address = {Madrid, Spain},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
Pérez-Sancho, C.; Bernabeu, J. F.
A Multimodal Genre Recognition Prototype Proceedings Article
In: Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes, pp. 13-16, Madrid, Spain, 2013, ISBN: 978-84-695-8332-6.
Abstract | Links | BibTeX | Tags: DRIMS, TIASA
@inproceedings{k305,
title = {A Multimodal Genre Recognition Prototype},
author = {C. Pérez-Sancho and J. F. Bernabeu},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/305/wsrfai2013_submission_4.pdf},
isbn = {978-84-695-8332-6},
year = {2013},
date = {2013-09-01},
urldate = {2013-09-01},
booktitle = {Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes},
pages = {13-16},
address = {Madrid, Spain},
abstract = {In this paper, a multimodal and interactive prototype to perform music genre classification is presented. The system is oriented to multi-part files in symbolic format but it can be adapted using a transcription system to transform audio content in music scores. This prototype uses different sources of information to give a possible answer to the user. It has been developed to allow a human expert to interact with the system to improve its results. In its current implementation, it offers a limited range of interaction and multimodality. Further development aimed at full interactivity and multimodal interactions is discussed.},
keywords = {DRIMS, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, a multimodal and interactive prototype to perform music genre classification is presented. The system is oriented to multi-part files in symbolic format but it can be adapted using a transcription system to transform audio content in music scores. This prototype uses different sources of information to give a possible answer to the user. It has been developed to allow a human expert to interact with the system to improve its results. In its current implementation, it offers a limited range of interaction and multimodality. Further development aimed at full interactivity and multimodal interactions is discussed. Higuera, C. De La; Oncina, J.
Computing the Most Probable String with a Probabilistic Finite State Machine Proceedings Article
In: Nederhof, Mark-Jan (Ed.): Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, pp. 1-8, Association for Computational Linguistics, 2013.
Abstract | Links | BibTeX | Tags: Prometeo 2012
@inproceedings{k314,
title = {Computing the Most Probable String with a Probabilistic Finite State Machine},
author = {C. De La Higuera and J. Oncina},
editor = {Mark-Jan Nederhof},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/314/W13-1801.pdf},
year = {2013},
date = {2013-07-01},
urldate = {2013-07-01},
booktitle = {Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing},
pages = {1-8},
publisher = {Association for Computational Linguistics},
abstract = {The problem of finding the consensus / most
probable string for a distribution generated by
a probabilistic finite automaton or a hidden
Markov model arises in a number of natural
language processing tasks: it has to be solved
in several transducer related tasks like opti-
mal decoding in speech, or finding the most
probable translation of an input sentence. We
provide an algorithm which solves these prob-
lems in time polynomial in the inverse of the
probability of the most probable string, which
in practise makes the computation tractable in
many cases. We also show that this exact com-
putation compares favourably with the tradi-
tional Viterbi computation.},
keywords = {Prometeo 2012},
pubstate = {published},
tppubtype = {inproceedings}
}
The problem of finding the consensus / most
probable string for a distribution generated by
a probabilistic finite automaton or a hidden
Markov model arises in a number of natural
language processing tasks: it has to be solved
in several transducer related tasks like opti-
mal decoding in speech, or finding the most
probable translation of an input sentence. We
provide an algorithm which solves these prob-
lems in time polynomial in the inverse of the
probability of the most probable string, which
in practise makes the computation tractable in
many cases. We also show that this exact com-
putation compares favourably with the tradi-
tional Viterbi computation. Serrano, A.; Micó, L.; Oncina, J.
Which fast nearest neighbour search algorithm to use? Journal Article
In: Lecture Notes in Computer Science, vol. 7887, pp. 567-574, 2013.
Links | BibTeX | Tags: Prometeo 2012, TIASA
@article{k301,
title = {Which fast nearest neighbour search algorithm to use?},
author = {A. Serrano and L. Micó and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/301/IbPria13.pdf},
year = {2013},
date = {2013-06-01},
journal = {Lecture Notes in Computer Science},
volume = {7887},
pages = {567-574},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {article}
}
Hontanilla, M.; Pérez-Sancho, C.; Iñesta, J. M.
Modeling Musical Style with Language Models for Composer Recognition Journal Article
In: Lecture Notes in Computer Science, vol. 7887, pp. 740-748, 2013, ISSN: 0302-9743.
Abstract | Links | BibTeX | Tags: DRIMS, Prometeo 2012
@article{k300,
title = {Modeling Musical Style with Language Models for Composer Recognition},
author = {M. Hontanilla and C. Pérez-Sancho and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/300/10.1007_978-3-642-38628-2_88.pdf},
issn = {0302-9743},
year = {2013},
date = {2013-06-01},
journal = {Lecture Notes in Computer Science},
volume = {7887},
pages = {740-748},
abstract = {In this paper we present an application of language modeling using n-grams to model the style of different composers. For this, we repeated the experiments performed in previous works by other authors using a corpus of 5 composers from the Baroque and Classical periods. In these experiments we found some signs that the results could be influenced by external factors other than the composers’ styles, such as the heterogeneity in the musical forms selected for the corpus. In order to as- sess the validity of the modeling techniques to capture the own personal style of the composers, a new experiment was performed with a corpus of fugues from Bach and Shostakovich. All these experiments show that language modeling is a suitable tool for modeling musical style, even when the styles of the different datasets are affected by several factors.},
keywords = {DRIMS, Prometeo 2012},
pubstate = {published},
tppubtype = {article}
}
In this paper we present an application of language modeling using n-grams to model the style of different composers. For this, we repeated the experiments performed in previous works by other authors using a corpus of 5 composers from the Baroque and Classical periods. In these experiments we found some signs that the results could be influenced by external factors other than the composers’ styles, such as the heterogeneity in the musical forms selected for the corpus. In order to as- sess the validity of the modeling techniques to capture the own personal style of the composers, a new experiment was performed with a corpus of fugues from Bach and Shostakovich. All these experiments show that language modeling is a suitable tool for modeling musical style, even when the styles of the different datasets are affected by several factors. Iñesta, J. M.; Pérez-Sancho, C.
Interactive multimodal music transcription Proceedings Article
In: Proc. of IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP 2013), pp. 211-215, IEEE, Vancouver, Canada, 2013, ISBN: 978-1-4799-0356-6.
Abstract | BibTeX | Tags: DRIMS, Prometeo 2012
@inproceedings{k299,
title = {Interactive multimodal music transcription},
author = {J. M. Iñesta and C. Pérez-Sancho},
isbn = {978-1-4799-0356-6},
year = {2013},
date = {2013-05-01},
booktitle = {Proc. of IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP 2013)},
pages = {211-215},
publisher = {IEEE},
address = {Vancouver, Canada},
abstract = {Automatic music transcription has usually been performed as an autonomous task and its evaluation has been made in terms of precision, recall, accuracy, etc. Nevertheless, in this work, assuming that the state of the art is far from being perfect, it is considered as an interactive one, where an expert user is assisted in its work by a transcription tool. In this context, the performance evaluation of the system turns into an assessment of how many user interactions are needed to complete the work. The strategy is that the user interactions can be used by the system to improve its performance in an adaptive way, thus minimizing the workload. Also, a multimodal approach has been implemented, in such a way that different sources of information, like onsets, beats, and meter, are used to detect notes in a musical audio excerpt. The system is focused on monotimbral polyphonic transcription.},
keywords = {DRIMS, Prometeo 2012},
pubstate = {published},
tppubtype = {inproceedings}
}
Automatic music transcription has usually been performed as an autonomous task and its evaluation has been made in terms of precision, recall, accuracy, etc. Nevertheless, in this work, assuming that the state of the art is far from being perfect, it is considered as an interactive one, where an expert user is assisted in its work by a transcription tool. In this context, the performance evaluation of the system turns into an assessment of how many user interactions are needed to complete the work. The strategy is that the user interactions can be used by the system to improve its performance in an adaptive way, thus minimizing the workload. Also, a multimodal approach has been implemented, in such a way that different sources of information, like onsets, beats, and meter, are used to detect notes in a musical audio excerpt. The system is focused on monotimbral polyphonic transcription. Socorro, R.; Micó, L.
Uso eficiente de pivotes aplicado a la búsqueda aproximada en algoritmos rápidos sobre espacios métricos Journal Article
In: Computación y Sistemas, vol. 17, no. 4, pp. 477-488, 2013.
@article{k310,
title = {Uso eficiente de pivotes aplicado a la búsqueda aproximada en algoritmos rápidos sobre espacios métricos},
author = {R. Socorro and L. Micó},
year = {2013},
date = {2013-01-01},
journal = {Computación y Sistemas},
volume = {17},
number = {4},
pages = {477-488},
abstract = {This work focuses on pivot-based fast nearest neighbor search algorithms that can work in any metric space. One of the objectives of these algorithms is to reduce the time consumed during
search. Reducing time consumption of such algorithms usually consists in reducing the number of distances for computing, due to the high cost that they have in certain applications. We introduce a new version and improvements for a recently proposed algorithm, PiAESA, a variant of the AESA algorithm, used as baseline for performance measurement for over twenty years. The new version is simpler and allows better understanding of the algorithm and parameters used. Moreover, the efficiency is increased by defining an approximated version. Our empirical results with real and artificial databases confirm a consistent improvement in performance, when retrieving very high percentage of the correct answers (given by the exact algorithm).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This work focuses on pivot-based fast nearest neighbor search algorithms that can work in any metric space. One of the objectives of these algorithms is to reduce the time consumed during
search. Reducing time consumption of such algorithms usually consists in reducing the number of distances for computing, due to the high cost that they have in certain applications. We introduce a new version and improvements for a recently proposed algorithm, PiAESA, a variant of the AESA algorithm, used as baseline for performance measurement for over twenty years. The new version is simpler and allows better understanding of the algorithm and parameters used. Moreover, the efficiency is increased by defining an approximated version. Our empirical results with real and artificial databases confirm a consistent improvement in performance, when retrieving very high percentage of the correct answers (given by the exact algorithm). Calvo-Zaragoza, J.; Oncina, J.; Iñesta, J. M.
Recognition of Online Handwritten Music Symbols Proceedings Article
In: Proceedings of the 6th International Workshop on Machine Learning and Music, Prague, Czech Republic, 2013.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIASA
@inproceedings{k307,
title = {Recognition of Online Handwritten Music Symbols},
author = {J. Calvo-Zaragoza and J. Oncina and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/307/calvozaragoza-mml13.pdf},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
booktitle = {Proceedings of the 6th International Workshop on Machine Learning and Music},
address = {Prague, Czech Republic},
abstract = {An effective way of digitizing a new musical composition is to use an e-pen and tablet application in which the user's pen strokes are recognized online and the digital score is created with the sole effort of the composition itself. This work aims to be a starting point for research on the recognition of online handwritten music notation. To this end, different alternatives within the two modalities of recognition resulting from this data are presented: online recognition, which uses the strokes marked by a pen, and offline recognition, which uses the image generated after drawing the symbol. A comparative experiment with common machine learning algorithms over a dataset of 3800 samples and 32 different music symbols is presented. Results show that samples of the actual user are needed if good classification rates are pursued. Moreover, algorithms using the online data, on average, achieve better classifocation results than the others.},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
An effective way of digitizing a new musical composition is to use an e-pen and tablet application in which the user's pen strokes are recognized online and the digital score is created with the sole effort of the composition itself. This work aims to be a starting point for research on the recognition of online handwritten music notation. To this end, different alternatives within the two modalities of recognition resulting from this data are presented: online recognition, which uses the strokes marked by a pen, and offline recognition, which uses the image generated after drawing the symbol. A comparative experiment with common machine learning algorithms over a dataset of 3800 samples and 32 different music symbols is presented. Results show that samples of the actual user are needed if good classification rates are pursued. Moreover, algorithms using the online data, on average, achieve better classifocation results than the others. Pertusa, A.; Gallego, A. J.; Bernabeu, M.
MirBot: A multimodal interactive image retrieval system Journal Article
In: Lecture Notes in Computer Science, vol. 7887, pp. 197-204, 2013, ISSN: 1611-3349.
@article{k303,
title = {MirBot: A multimodal interactive image retrieval system},
author = {A. Pertusa and A. J. Gallego and M. Bernabeu},
issn = {1611-3349},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
journal = {Lecture Notes in Computer Science},
volume = {7887},
pages = {197-204},
abstract = {This study presents a multimodal interactive image retrieval system for smartphones (MirBot). The application is designed as a collaborative game where users can categorize photographs according to the WordNet hierarchy. After taking a picture, the region of interest of the target can be selected, and the image information is sent with a set of metadata to a server in order to classify the object. The user can validate the category proposed by the system to improve future queries. The result is a labeled database with a structure similar to ImageNet, but with contents selected by the users, fully marked with regions of interest, and with novel metadata that can be useful to constrain the search space in a future work. The MirBot app is freely available on the Apple app store.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This study presents a multimodal interactive image retrieval system for smartphones (MirBot). The application is designed as a collaborative game where users can categorize photographs according to the WordNet hierarchy. After taking a picture, the region of interest of the target can be selected, and the image information is sent with a set of metadata to a server in order to classify the object. The user can validate the category proposed by the system to improve future queries. The result is a labeled database with a structure similar to ImageNet, but with contents selected by the users, fully marked with regions of interest, and with novel metadata that can be useful to constrain the search space in a future work. The MirBot app is freely available on the Apple app store. Sanches, J. M.; Micó, L.; Cardoso, J. S.
Pattern Recognition and Image Analysis 6th Iberian Conference, IbPRIA 2013 Book
Springer, 2013.
BibTeX | Tags: Prometeo 2012, TIASA
@book{k302,
title = {Pattern Recognition and Image Analysis 6th Iberian Conference, IbPRIA 2013},
author = {J. M. Sanches and L. Micó and J. S. Cardoso},
editor = {J. M. Sanches and L. Micó and J. S. Cardoso},
year = {2013},
date = {2013-01-01},
publisher = {Springer},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {book}
}
2012
Abreu, J.; Rico-Juan, J. R.
An improved fast edit approach for two-string approximated mean computation applied to OCR Journal Article
In: Pattern Recognition Letters, vol. 34, no. 5, pp. 496–-504, 2012.
@article{k333,
title = {An improved fast edit approach for two-string approximated mean computation applied to OCR},
author = {J. Abreu and J. R. Rico-Juan},
year = {2012},
date = {2012-12-01},
journal = {Pattern Recognition Letters},
volume = {34},
number = {5},
pages = {496---504},
abstract = {This paper presents a new fast algorithm for computing an approximation to the mean of two strings of characters representing a 2D shape and its application to a new Wilson-based editing procedure. The approximate mean is built up by including some symbols from the two original strings. In addition, a Greedy approach to this algorithm is studied, which allows us to reduce the time required to compute an approximate mean. The new dataset editing scheme relaxes the criterion for deleting instances proposed by the Wilson editing procedure. In practice, not all instances misclassified by their near neighbors are pruned. Instead, an artificial instance is added to the dataset in the hope of successfully classifying the instance in the future. The new artificial instance is the approximated mean of the misclassified sample and its same-class nearest neighbor.
Experiments carried out over three widely known databases of contours show that the proposed algorithm performs very well when computing the mean of two strings, and outperforms methods proposed by other authors. In particular, the low computational time required by the heuristic approach makes it very suitable when dealing with long length strings. Results also show that the proposed preprocessing scheme can reduce the classification error in about 83% of trials. There is empirical evidence that using the Greedy approximation to compute the approximated mean does not affect the performance of the editing procedure.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper presents a new fast algorithm for computing an approximation to the mean of two strings of characters representing a 2D shape and its application to a new Wilson-based editing procedure. The approximate mean is built up by including some symbols from the two original strings. In addition, a Greedy approach to this algorithm is studied, which allows us to reduce the time required to compute an approximate mean. The new dataset editing scheme relaxes the criterion for deleting instances proposed by the Wilson editing procedure. In practice, not all instances misclassified by their near neighbors are pruned. Instead, an artificial instance is added to the dataset in the hope of successfully classifying the instance in the future. The new artificial instance is the approximated mean of the misclassified sample and its same-class nearest neighbor.
Experiments carried out over three widely known databases of contours show that the proposed algorithm performs very well when computing the mean of two strings, and outperforms methods proposed by other authors. In particular, the low computational time required by the heuristic approach makes it very suitable when dealing with long length strings. Results also show that the proposed preprocessing scheme can reduce the classification error in about 83% of trials. There is empirical evidence that using the Greedy approximation to compute the approximated mean does not affect the performance of the editing procedure. Socorro, R.
Optimización del uso de pivotes en tareas de búsqueda y clasificación PhD Thesis
2012.
BibTeX | Tags:
@phdthesis{k298,
title = {Optimización del uso de pivotes en tareas de búsqueda y clasificación},
author = {R. Socorro},
editor = {L. Micó},
year = {2012},
date = {2012-12-01},
organization = {Departamento de Lenguajes y Sistemas Informáticos},
keywords = {},
pubstate = {published},
tppubtype = {phdthesis}
}
Bresson, J.; Pérez-Sancho, C.
New Framework for Score Segmentation and Analysis in OpenMusic Proceedings Article
In: Serafin, S. (Ed.): Proceedings of the 9th Sound and Music Computing Conference, pp. 506-513, Sound & Music Computing Logos Verlag, Copenhagen, Denmark, 2012, ISBN: 978-3-8325-3180-5.
Abstract | Links | BibTeX | Tags: DRIMS, PASCAL2
@inproceedings{k295,
title = {New Framework for Score Segmentation and Analysis in OpenMusic},
author = {J. Bresson and C. Pérez-Sancho},
editor = {S. Serafin},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/295/smc2012-149.pdf},
isbn = {978-3-8325-3180-5},
year = {2012},
date = {2012-07-01},
booktitle = {Proceedings of the 9th Sound and Music Computing Conference},
pages = {506-513},
publisher = {Logos Verlag},
address = {Copenhagen, Denmark},
organization = {Sound & Music Computing},
abstract = {We present new tools for the segmentation and analysis of musical scores in the OpenMusic computer-aided composition environment. A modular object-oriented framework enables the creation of segmentations on score objects and the implementation of automatic or semi-automatic analysis processes. The analyses can be performed and displayed thanks to customizable classes and callbacks. Concrete examples are given, in particular with the implementation of a semi-automatic harmonic analysis system and a framework for rhythmic transcription.},
keywords = {DRIMS, PASCAL2},
pubstate = {published},
tppubtype = {inproceedings}
}
We present new tools for the segmentation and analysis of musical scores in the OpenMusic computer-aided composition environment. A modular object-oriented framework enables the creation of segmentations on score objects and the implementation of automatic or semi-automatic analysis processes. The analyses can be performed and displayed thanks to customizable classes and callbacks. Concrete examples are given, in particular with the implementation of a semi-automatic harmonic analysis system and a framework for rhythmic transcription. Bernabeu, J. F.; Calera-Rubio, J.; Iñesta, J. M.; Rizo, D.
Query Parsing Using Probabilistic Tree Grammars Technical Report
Edinburgh, 2012.
Abstract | Links | BibTeX | Tags: DRIMS
@techreport{k292,
title = {Query Parsing Using Probabilistic Tree Grammars},
author = {J. F. Bernabeu and J. Calera-Rubio and J. M. Iñesta and D. Rizo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/292/mml2012.pdf},
year = {2012},
date = {2012-06-01},
booktitle = {5th workshop on Music and Machine Learning, MML 2012},
address = {Edinburgh},
organization = {5th workshop on Music and Machine Learning, MML 2012},
abstract = {The tree representation, using rhythm for defining the tree structure and pitch infor- mation for node labeling has proven to be ef- fective in melodic similarity computation. In this paper we propose a solution representing melodies by tree grammars. For that, we in- fer a probabilistic context-free grammars for the melodies in a database, using their tree coding (with duration and pitch) and classify queries represented as a string of pitches. We aim to assess their ability to identify a noisy snippet query among a set of songs stored in symbolic format.},
keywords = {DRIMS},
pubstate = {published},
tppubtype = {techreport}
}
The tree representation, using rhythm for defining the tree structure and pitch infor- mation for node labeling has proven to be ef- fective in melodic similarity computation. In this paper we propose a solution representing melodies by tree grammars. For that, we in- fer a probabilistic context-free grammars for the melodies in a database, using their tree coding (with duration and pitch) and classify queries represented as a string of pitches. We aim to assess their ability to identify a noisy snippet query among a set of songs stored in symbolic format. Rico-Juan, J. R.; Iñesta, J. M.
Confidence voting method ensemble applied to off-line signature verification Journal Article
In: Pattern Analysis and Applications, vol. 15, no. 2, pp. 113–120, 2012, ISSN: 1433-7541.
Abstract | Links | BibTeX | Tags: MIPRCV, TIASA
@article{k290,
title = {Confidence voting method ensemble applied to off-line signature verification},
author = {J. R. Rico-Juan and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/290/rico_juanConfidenceVotingMethodEmsembleOffLineSignatureVerification.pdf},
issn = {1433-7541},
year = {2012},
date = {2012-04-01},
journal = {Pattern Analysis and Applications},
volume = {15},
number = {2},
pages = {113--120},
abstract = {In this paper, a new approximation to off-line signature verification is proposed based on two-class classifiers using an expert decisions ensemble. Different methods to extract sets of local and a global features from the target sample are detailed. Also a normalisation by confidence voting method is used in order to decrease the final equal error rate (EER). Each set of features is processed by a single expert, and on the other approach proposed, the decisions of the individual classifiers are combined using weighted votes. Experimental results are given using a subcorpus of the large MCYT signature database for random and skilled forgeries. The results show that the weighted combination outperforms the individual classifiers significantly. The best EER obtained were 6.3% in the case of skilled forgeries and 2.3% in the case of random forgeries.},
keywords = {MIPRCV, TIASA},
pubstate = {published},
tppubtype = {article}
}
In this paper, a new approximation to off-line signature verification is proposed based on two-class classifiers using an expert decisions ensemble. Different methods to extract sets of local and a global features from the target sample are detailed. Also a normalisation by confidence voting method is used in order to decrease the final equal error rate (EER). Each set of features is processed by a single expert, and on the other approach proposed, the decisions of the individual classifiers are combined using weighted votes. Experimental results are given using a subcorpus of the large MCYT signature database for random and skilled forgeries. The results show that the weighted combination outperforms the individual classifiers significantly. The best EER obtained were 6.3% in the case of skilled forgeries and 2.3% in the case of random forgeries. Rico-Juan, J. R.; Iñesta, J. M.
New rank methods for reducing the size of the training set using the nearest neighbor rule Journal Article
In: Pattern Recognition Letters, vol. 33, no. 5, pp. 654–660, 2012, ISSN: 0167-8655.
Abstract | Links | BibTeX | Tags: DRIMS, MIPRCV, TIASA
@article{k283,
title = {New rank methods for reducing the size of the training set using the nearest neighbor rule},
author = {J. R. Rico-Juan and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/283/rankTrainingSet.pdf},
issn = {0167-8655},
year = {2012},
date = {2012-04-01},
journal = {Pattern Recognition Letters},
volume = {33},
number = {5},
pages = {654--660},
abstract = {(http://dx.doi.org/10.1016/j.patrec.2011.07.019)
Some new rank methods to select the best prototypes from a training set are proposed in this paper in order to establish its size according to an external parameter, while maintaining the classification accuracy. The traditional methods that filter the training set in a classification task like editing or condensing have some rules that apply to the set in order to remove outliers or keep some prototypes that help in the classification. In our approach, new voting methods are proposed to compute the prototype probability and help to classify correctly a new sample. This probability is the key to sorting the training set out, so a relevance factor from 0 to 1 is used to select the best candidates for each class whose accumulated probabilities are less than that parameter. This approach makes it possible to select the number of prototypes necessary to maintain or even increase the classification accuracy. The results obtained in different high dimensional databases show that these methods maintain the final error rate while reducing the size of the training set.},
keywords = {DRIMS, MIPRCV, TIASA},
pubstate = {published},
tppubtype = {article}
}
(http://dx.doi.org/10.1016/j.patrec.2011.07.019)
Some new rank methods to select the best prototypes from a training set are proposed in this paper in order to establish its size according to an external parameter, while maintaining the classification accuracy. The traditional methods that filter the training set in a classification task like editing or condensing have some rules that apply to the set in order to remove outliers or keep some prototypes that help in the classification. In our approach, new voting methods are proposed to compute the prototype probability and help to classify correctly a new sample. This probability is the key to sorting the training set out, so a relevance factor from 0 to 1 is used to select the best candidates for each class whose accumulated probabilities are less than that parameter. This approach makes it possible to select the number of prototypes necessary to maintain or even increase the classification accuracy. The results obtained in different high dimensional databases show that these methods maintain the final error rate while reducing the size of the training set. Vicente, O.; Iñesta, J. M.
Bass track selection in MIDI files and multimodal implications to melody Proceedings Article
In: Carmona, J. Salvador Sá Pedro Latorre; nchez,; Fred, Ana (Ed.): Proceedings of the Int. Conf. on Pattern Recognition Applications and Methods (ICPRAM 2012), pp. 449–458, INSTICC SciTePress, Vilamoura, Portugal, 2012, ISBN: 978-989-8425-98-0.
Abstract | BibTeX | Tags: DRIMS, MIPRCV
@inproceedings{k285,
title = {Bass track selection in MIDI files and multimodal implications to melody},
author = {O. Vicente and J. M. Iñesta},
editor = {J. Salvador Sá Pedro Latorre Carmona and nchez and Ana Fred},
isbn = {978-989-8425-98-0},
year = {2012},
date = {2012-02-01},
urldate = {2012-02-01},
booktitle = {Proceedings of the Int. Conf. on Pattern Recognition Applications and Methods (ICPRAM 2012)},
pages = {449--458},
publisher = {SciTePress},
address = {Vilamoura, Portugal},
organization = {INSTICC},
abstract = {Standard MIDI files consist of a number of tracks containing information that can be considered as a symbolic representation of music. Usually each track represents an instrument or voice in a music piece. The goal for this work is to identify the track that contains the bass line. This information is very relevant for a number of tasks like rhythm analysis or harmonic segmentation, among others. It is not easy since a bass line can be performed by very different kinds of instruments. We have approached this problem by using statistical features from the symbolic representation of music and a random forest classifier. The first experiment was to classify a track as bass or non-bass. Then we have tried to select the correct bass track in a multi-track MIDI file. Eventually, we have studied the issue of how different sources of information can help in this latter task. In particular, we have analyzed the interactions between bass and melody information. Yielded results were very accurate and melody track identification was significantly improved when using this kind of multimodal help.},
keywords = {DRIMS, MIPRCV},
pubstate = {published},
tppubtype = {inproceedings}
}
Standard MIDI files consist of a number of tracks containing information that can be considered as a symbolic representation of music. Usually each track represents an instrument or voice in a music piece. The goal for this work is to identify the track that contains the bass line. This information is very relevant for a number of tasks like rhythm analysis or harmonic segmentation, among others. It is not easy since a bass line can be performed by very different kinds of instruments. We have approached this problem by using statistical features from the symbolic representation of music and a random forest classifier. The first experiment was to classify a track as bass or non-bass. Then we have tried to select the correct bass track in a multi-track MIDI file. Eventually, we have studied the issue of how different sources of information can help in this latter task. In particular, we have analyzed the interactions between bass and melody information. Yielded results were very accurate and melody track identification was significantly improved when using this kind of multimodal help. Serrano, A.; Micó, L.; Oncina, J.
Restructuring Versus non Restructuring Insertions in MDF Indexes Proceedings Article
In: Carmona, J. Salvador Sá Pedro Latorre; nchez,; Fred, Ana (Ed.): ICPRAM 2012: 1st International Conference on Pattern Recognition Applications and Methods, pp. 474–480, INSTICC SciTePress, Vilamoura, Portugal, 2012, ISBN: 978-989-8425-98-0.
Abstract | Links | BibTeX | Tags: MIPRCV, TIASA
@inproceedings{k282,
title = {Restructuring Versus non Restructuring Insertions in MDF Indexes},
author = {A. Serrano and L. Micó and J. Oncina},
editor = {J. Salvador Sá Pedro Latorre Carmona and nchez and Ana Fred},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/282/ICPRAM12.pdf},
isbn = {978-989-8425-98-0},
year = {2012},
date = {2012-02-01},
booktitle = {ICPRAM 2012: 1st International Conference on Pattern Recognition Applications and Methods},
pages = {474--480},
publisher = {SciTePress},
address = {Vilamoura, Portugal},
organization = {INSTICC},
abstract = {MDF tree is a data structure (index) that is used to speed up similarity searches in huge databases. To achieve its goal the indexes should exploit some property of the dissimilarity measure. MDF indexes assume that the dissimilarity measure can be viewed as a distance in a metric space. Moreover, in this framework is assumed that the distance is computationally very expensive and then, counting distance computations is a good measure of the time complexity.
To tackle with a changing world, a problem arises when new points should be inserted in the index. Efficient algorithms should choose between trying to be efficient in search maintaining the “ideal” structure of the index or trying to be efficient when inserting but worsening the search time.
In this work we propose an insertion algorithm for MDF trees that focus on optimizing insertion times. The worst case time complexity of the algorithm only depends on the depth of the MDF tree. We compare this algorithm with a similar one that focuses on search time performance. We also study the range of applicability of each one.},
keywords = {MIPRCV, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
MDF tree is a data structure (index) that is used to speed up similarity searches in huge databases. To achieve its goal the indexes should exploit some property of the dissimilarity measure. MDF indexes assume that the dissimilarity measure can be viewed as a distance in a metric space. Moreover, in this framework is assumed that the distance is computationally very expensive and then, counting distance computations is a good measure of the time complexity.
To tackle with a changing world, a problem arises when new points should be inserted in the index. Efficient algorithms should choose between trying to be efficient in search maintaining the “ideal” structure of the index or trying to be efficient when inserting but worsening the search time.
In this work we propose an insertion algorithm for MDF trees that focus on optimizing insertion times. The worst case time complexity of the algorithm only depends on the depth of the MDF tree. We compare this algorithm with a similar one that focuses on search time performance. We also study the range of applicability of each one. Moreno-Seco, F.; Oncina, J.; Micó, L.
Improving the Linear Approximating and Eliminating Search Algorithm (LAESA) Error Rates Book Chapter
In: Pattern Recognition and Applications. Frontiers in Artificial Intelli-gence and Applications, Chapter -, pp. 43, IOS Press, 2012.
BibTeX | Tags:
@inbook{k69,
title = {Improving the Linear Approximating and Eliminating Search Algorithm (LAESA) Error Rates},
author = {F. Moreno-Seco and J. Oncina and L. Micó},
year = {2012},
date = {2012-01-01},
urldate = {2012-01-01},
booktitle = {Pattern Recognition and Applications. Frontiers in Artificial Intelli-gence and Applications},
pages = {43},
publisher = {IOS Press},
chapter = {-},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
López, D.; Calera-Rubio, J.; Gallego-Sánchez, A. J.
Inference of k-Testable Directed Acyclic Graph Languages Proceedings Article
In: Journal of Machine Learning Research: Workshop and Conference Proceedings, Vol. 21: ICGI 2012, pp. 149-163, 2012.
Abstract | Links | BibTeX | Tags: PASCAL2, Prometeo 2012, TIASA
@inproceedings{k296,
title = {Inference of k-Testable Directed Acyclic Graph Languages},
author = {D. López and J. Calera-Rubio and A. J. Gallego-Sánchez},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/296/lopez12a.pdf},
year = {2012},
date = {2012-01-01},
booktitle = {Journal of Machine Learning Research: Workshop and Conference Proceedings, Vol. 21: ICGI 2012},
pages = {149-163},
abstract = {In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data.},
keywords = {PASCAL2, Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data.
2016
Bosch, V.; Calvo-Zaragoza, J.; Toselli, A. H.; Vidal, E.
Sheet Music Statistical Layout Analysis Proceedings Article
In: 15th International Conference on Frontiers in Handwriting Recognition, 2016.
@inproceedings{k351,
title = {Sheet Music Statistical Layout Analysis},
author = {V. Bosch and J. Calvo-Zaragoza and A. H. Toselli and E. Vidal},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/351/musicSheetLayout.pdf},
year = {2016},
date = {2016-01-01},
booktitle = {15th International Conference on Frontiers in Handwriting Recognition},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.; Toselli, A. H.; Vidal, E.
Early Handwritten Music Recognition with Hidden Markov Models Proceedings Article
In: 15th International Conference on Frontiers in Handwriting Recognition, 2016.
@inproceedings{k350,
title = {Early Handwritten Music Recognition with Hidden Markov Models},
author = {J. Calvo-Zaragoza and A. H. Toselli and E. Vidal},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/350/musicNoteRecogIcfhr16.pdf},
year = {2016},
date = {2016-01-01},
booktitle = {15th International Conference on Frontiers in Handwriting Recognition},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.
Pattern Recognition for Music Notation PhD Thesis
2016.
@phdthesis{k343,
title = {Pattern Recognition for Music Notation},
author = {J. Calvo-Zaragoza},
editor = {Juan R. Rico-Juan and Jose Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/343/thesis-jcalvo.pdf},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
organization = {Universidad de Alicante},
keywords = {},
pubstate = {published},
tppubtype = {phdthesis}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R.
Selecting promising classes from generated data for an efficient multi-class NN classification Journal Article
In: Soft Computing, 2016.
@article{k340,
title = {Selecting promising classes from generated data for an efficient multi-class NN classification},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R. Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/340/selecting-promising-classes.pdf},
year = {2016},
date = {2016-01-01},
journal = {Soft Computing},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {article}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R.
Prototype Generation on Structural Data using Dissimilarity Space Representation Journal Article
In: Neural Computing and Applications, 2016.
@article{k337,
title = {Prototype Generation on Structural Data using Dissimilarity Space Representation},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R. Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/337/prototype-generation-structural.pdf},
year = {2016},
date = {2016-01-01},
journal = {Neural Computing and Applications},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {article}
}
Calvo-Zaragoza, J.; Micó, L.; Oncina, J.
Music staff removal with supervised pixel classification Journal Article
In: International Journal on Document Analysis and Recognition, vol. 19, no. 3, pp. 211-219, 2016, ISSN: 1433-2833.
@article{k336,
title = {Music staff removal with supervised pixel classification},
author = {J. Calvo-Zaragoza and L. Micó and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/336/classification-approach-staff.pdf},
issn = {1433-2833},
year = {2016},
date = {2016-01-01},
journal = {International Journal on Document Analysis and Recognition},
volume = {19},
number = {3},
pages = {211-219},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {article}
}
Illescas, P. R.
Análisis tonal asistido por ordenador PhD Thesis
2016.
Abstract | Links | BibTeX | Tags: TIMuL
@phdthesis{k335,
title = {Análisis tonal asistido por ordenador},
author = {P. R. Illescas},
editor = {J. M. Iñesta and D. Rizo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/335/PhD_placido+illescas-lectura_digital.pdf},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
address = {Alicante},
organization = {Universidad de Alicante},
abstract = {En este trabajo se plantean fundamentalmente cuatro cuestiones de investigación:
1. Realizar unas reseñas sobre la evolución del análisis desde su invención hasta todo lo que se desarrolla entorno al análisis-computacional.
2. Contestar a la cuestión de si es posible (o hasta qué punto) desarrollar reglas armónicas, contrapuntísticas, tonales y funcionales que nos permitan analizar automáticamente los corales armonizados de J. S. Bach.
3. Implementar un programa que en base a las especificaciones producidas en el segundo bloque, analice los corales armonizados de Bach detectando la tonalidad y las modulaciones, los acordes, las funciones tonales y catalogando las notas como reales o extrañas.
4. Explorar las posibilidades de mejorar los resultados producidos por el sistema mediante las interacciones que un experto o estudiante puedan establecer con el mismo, esto abre la puerta a aplicaciones didácticas del sistema.},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {phdthesis}
}
En este trabajo se plantean fundamentalmente cuatro cuestiones de investigación:
1. Realizar unas reseñas sobre la evolución del análisis desde su invención hasta todo lo que se desarrolla entorno al análisis-computacional.
2. Contestar a la cuestión de si es posible (o hasta qué punto) desarrollar reglas armónicas, contrapuntísticas, tonales y funcionales que nos permitan analizar automáticamente los corales armonizados de J. S. Bach.
3. Implementar un programa que en base a las especificaciones producidas en el segundo bloque, analice los corales armonizados de Bach detectando la tonalidad y las modulaciones, los acordes, las funciones tonales y catalogando las notas como reales o extrañas.
4. Explorar las posibilidades de mejorar los resultados producidos por el sistema mediante las interacciones que un experto o estudiante puedan establecer con el mismo, esto abre la puerta a aplicaciones didácticas del sistema.
1. Realizar unas reseñas sobre la evolución del análisis desde su invención hasta todo lo que se desarrolla entorno al análisis-computacional.
2. Contestar a la cuestión de si es posible (o hasta qué punto) desarrollar reglas armónicas, contrapuntísticas, tonales y funcionales que nos permitan analizar automáticamente los corales armonizados de J. S. Bach.
3. Implementar un programa que en base a las especificaciones producidas en el segundo bloque, analice los corales armonizados de Bach detectando la tonalidad y las modulaciones, los acordes, las funciones tonales y catalogando las notas como reales o extrañas.
4. Explorar las posibilidades de mejorar los resultados producidos por el sistema mediante las interacciones que un experto o estudiante puedan establecer con el mismo, esto abre la puerta a aplicaciones didácticas del sistema.
2015
Calvo-Zaragoza, J.; Barbancho, I.; Tardón, L. J.; Barbancho, A. M.
Avoiding staff removal stage in optical music recognition: application to scores written in white mensural notation Journal Article
In: Pattern Analysis and Applications, vol. 18, no. 4, pp. 933-943, 2015, ISSN: 1433-7541.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@article{k318,
title = {Avoiding staff removal stage in optical music recognition: application to scores written in white mensural notation},
author = {J. Calvo-Zaragoza and I. Barbancho and L. J. Tardón and A. M. Barbancho},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/318/paaa-jcalvo.pdf},
issn = {1433-7541},
year = {2015},
date = {2015-11-01},
urldate = {2015-11-01},
journal = {Pattern Analysis and Applications},
volume = {18},
number = {4},
pages = {933-943},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
Valero-Mas, J. J.; Iñesta, J. M.
Interactive onset detection in audio recordings Technical Report
Málaga, Spain, 2015.
Abstract | Links | BibTeX | Tags: TIMuL
@techreport{k334,
title = {Interactive onset detection in audio recordings},
author = {J. J. Valero-Mas and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/334/OnsetInteraction-LBD.pdf},
year = {2015},
date = {2015-10-01},
booktitle = {Late Breaking/Demo extended abstract, 16th International Society for Music Information Retrieval Conference (ISMIR)},
address = {Málaga, Spain},
organization = {University of Alicante},
abstract = {Onset detection still has room for improvement. State-of-the-art onset detection algorithms achieve good results for a range of applications, but for some situations in which the accuracy is a must, human intervention is required to correct the mistakes committed. In such scheme, accuracy in the result is guaranteed at the expense of the manual correction of all errors. Hence, the issue now lies on finding schemes for efficiently exploiting and reducing that user effort. In this work we present an Interactive Pattern Recognition approach for tackling this issue: using a pre-trained classification-based onset detection algorithm, every time the user corrects an error in the estimation, the system modifies its performance accordingly and recalculates the output. Initial results show that user effort is effectively reduced under our proposal.},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {techreport}
}
Onset detection still has room for improvement. State-of-the-art onset detection algorithms achieve good results for a range of applications, but for some situations in which the accuracy is a must, human intervention is required to correct the mistakes committed. In such scheme, accuracy in the result is guaranteed at the expense of the manual correction of all errors. Hence, the issue now lies on finding schemes for efficiently exploiting and reducing that user effort. In this work we present an Interactive Pattern Recognition approach for tackling this issue: using a pre-trained classification-based onset detection algorithm, every time the user corrects an error in the estimation, the system modifies its performance accordingly and recalculates the output. Initial results show that user effort is effectively reduced under our proposal.
Calvo-Zaragoza, J.; de León, P. J. Ponce; Iñesta, J. M.; Rizo, D.
Genre-based melody generation through multi-objective genetic algorithms Proceedings Article
In: Proceedings of the 8th Machine Learning and Music workshop (MML 2015), Vancouver (Canada), 2015.
Abstract | BibTeX | Tags: TIMuL
@inproceedings{k332,
title = {Genre-based melody generation through multi-objective genetic algorithms},
author = {J. Calvo-Zaragoza and P. J. Ponce de León and J. M. Iñesta and D. Rizo},
year = {2015},
date = {2015-08-01},
urldate = {2015-08-01},
booktitle = {Proceedings of the 8th Machine Learning and Music workshop (MML 2015)},
address = {Vancouver (Canada)},
abstract = {Genetic-based composition algorithms have the ability to ex- plore an immense space of possibilities but the main di},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Genetic-based composition algorithms have the ability to ex- plore an immense space of possibilities but the main di
Valero-Mas, J. J.; Salamon, J.; Gómez, E.
Analyzing the influence of pitch quantization and note segmentation on singing voice alignment in the context of audio-based Query-by-Humming Proceedings Article
In: Proceedings of the 12th Sound and Music Computing Conference (SMC), pp. 371–378, Maynooth, Ireland, 2015, ISBN: 9--7809--92746629.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIMuL
@inproceedings{k331,
title = {Analyzing the influence of pitch quantization and note segmentation on singing voice alignment in the context of audio-based Query-by-Humming},
author = {J. J. Valero-Mas and J. Salamon and E. Gómez},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/331/QBH_SMC2015_CameraReady.pdf},
isbn = {9--7809--92746629},
year = {2015},
date = {2015-07-01},
booktitle = {Proceedings of the 12th Sound and Music Computing Conference (SMC)},
pages = {371--378},
address = {Maynooth, Ireland},
abstract = {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 music tunes. While MIDI-based QBH builds on the premise of existing annotated transcriptions for any candidate song, audio-based research makes use of melody extraction algorithms for the music tunes. In both cases, a melody abstraction process is required for solving issues commonly found in queries such as key transpositions or tempo deviations. Automatic music transcription is 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 the automatic transcription step, 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.},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
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 music tunes. While MIDI-based QBH builds on the premise of existing annotated transcriptions for any candidate song, audio-based research makes use of melody extraction algorithms for the music tunes. In both cases, a melody abstraction process is required for solving issues commonly found in queries such as key transpositions or tempo deviations. Automatic music transcription is 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 the automatic transcription step, 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.
Calvo-Zaragoza, J.; Oncina, J.
Clustering of Strokes from Pen-based Music Notation: An Experimental Study Proceedings Article
In: Paredes, Roberto; Cardoso, Jaime S.; Pardo, Xosé M. (Ed.): 7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), pp. 633-640, Springer, Santiago de Compostela, Spain, 2015, ISBN: 978-3-319-19389-2.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@inproceedings{k326,
title = {Clustering of Strokes from Pen-based Music Notation: An Experimental Study},
author = {J. Calvo-Zaragoza and J. Oncina},
editor = {Roberto Paredes and Jaime S. Cardoso and Xosé M. Pardo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/326/clustering-strokes-pen.pdf},
isbn = {978-3-319-19389-2},
year = {2015},
date = {2015-06-01},
booktitle = {7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA)},
pages = {633-640},
publisher = {Springer},
address = {Santiago de Compostela, Spain},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R.
Prototype Generation on Structural Data using Dissimilarity Space Representation: A Case of Study Proceedings Article
In: Paredes, Roberto; Cardoso, Jaime S.; Pardo, Xosé M. (Ed.): 7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), pp. 72-82, Springer, Santiago de Compostela, Spain, 2015, ISBN: 978-3-319-19389-2.
Abstract | Links | BibTeX | Tags: TIMuL
@inproceedings{k325,
title = {Prototype Generation on Structural Data using Dissimilarity Space Representation: A Case of Study},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R. Rico-Juan},
editor = {Roberto Paredes and Jaime S. Cardoso and Xosé M. Pardo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/325/prototype-generation-structural.pdf},
isbn = {978-3-319-19389-2},
year = {2015},
date = {2015-06-01},
booktitle = {7th Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA)},
pages = {72-82},
publisher = {Springer},
address = {Santiago de Compostela, Spain},
abstract = {Data Reduction techniques are commonly applied in instance-based classification tasks to lower the amount of data to be processed. Prototype Selection (PS) and Prototype Generation (PG) constitute the most representative approaches. These two families differ in the way of obtaining the reduced set out of 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 better delimit decision boundaries, operations required are not so well defined in scenarios involving structural data such as strings, trees or graphs.
This work proposes a case of study with the use of the common RandomC algorithm for mapping the initial structural data to a Dissimilarity Space (DS) representation, 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 PG combined with RandomC mapping achieves a very competitive performance, although the obtained accuracy seems to be bounded by the representativity of the DS method.},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Data Reduction techniques are commonly applied in instance-based classification tasks to lower the amount of data to be processed. Prototype Selection (PS) and Prototype Generation (PG) constitute the most representative approaches. These two families differ in the way of obtaining the reduced set out of 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 better delimit decision boundaries, operations required are not so well defined in scenarios involving structural data such as strings, trees or graphs.
This work proposes a case of study with the use of the common RandomC algorithm for mapping the initial structural data to a Dissimilarity Space (DS) representation, 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 PG combined with RandomC mapping achieves a very competitive performance, although the obtained accuracy seems to be bounded by the representativity of the DS method.
This work proposes a case of study with the use of the common RandomC algorithm for mapping the initial structural data to a Dissimilarity Space (DS) representation, 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 PG combined with RandomC mapping achieves a very competitive performance, although the obtained accuracy seems to be bounded by the representativity of the DS method.
Martínez-Álvarez, A.; Cuenca-Asensi, S.; Ortiz, A.; Calvo-Zaragoza, J.; Vivas-Tejuelo, L. A.
Tuning compilations by multi-objective optimization: Application to Apache web server Journal Article
In: Applied Soft Computing, vol. 29, pp. 461-470, 2015.
BibTeX | Tags:
@article{k327,
title = {Tuning compilations by multi-objective optimization: Application to Apache web server},
author = {A. Martínez-Álvarez and S. Cuenca-Asensi and A. Ortiz and J. Calvo-Zaragoza and L. A. Vivas-Tejuelo},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Applied Soft Computing},
volume = {29},
pages = {461-470},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Calvo-Zaragoza, J.; Valero-Mas, J. J.; Rico-Juan, J. R
Improving kNN multi-label classification in Prototype Selection scenarios using class proposals Journal Article
In: Pattern Recognition, vol. 48, no. 5, pp. 1608-1622, 2015.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@article{k324,
title = {Improving kNN multi-label classification in Prototype Selection scenarios using class proposals},
author = {J. Calvo-Zaragoza and J. J. Valero-Mas and J. R Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/324/improving-knn-multi.pdf},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Pattern Recognition},
volume = {48},
number = {5},
pages = {1608-1622},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
Rico-Juan, J. R.; Calvo-Zaragoza, J.
Improving classification using a Confidence Matrix based on weak classifiers applied to OCR Journal Article
In: Neurocomputing, vol. 151, pp. 1354–1361, 2015, ISSN: 0925-2312.
Links | BibTeX | Tags: Prometeo 2012, TIMuL
@article{k323,
title = {Improving classification using a Confidence Matrix based on weak classifiers applied to OCR},
author = {J. R. Rico-Juan and J. Calvo-Zaragoza},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/323/cm.pdf},
issn = {0925-2312},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Neurocomputing},
volume = {151},
pages = {1354–1361},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
Rizo, D.; Iñesta, J. M.
A grammar for Plaine and Easie Code Proceedings Article
In: Roland, Perry; Kepper, Johannes (Ed.): Proceedings of the Music Encoding Initiative Conferences 2013 and 2014, pp. 54–64, 2015.
BibTeX | Tags: GRE-12-34, Prometeo 2012, TIMuL
@inproceedings{k321,
title = {A grammar for Plaine and Easie Code},
author = {D. Rizo and J. M. Iñesta},
editor = {Perry Roland and Johannes Kepper},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
booktitle = {Proceedings of the Music Encoding Initiative Conferences 2013 and 2014},
pages = {54--64},
keywords = {GRE-12-34, Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Micó, L.; Sanches, J.; Cardoso, J. S.
The vitality of pattern recognition and image analysis Journal Article
In: Neurocomputing, vol. 150, pp. 124-125, 2015, ISSN: 09252312.
BibTeX | Tags: Prometeo 2012, TIMuL
@article{k320,
title = {The vitality of pattern recognition and image analysis},
author = {L. Micó and J. Sanches and J. S. Cardoso},
issn = {09252312},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {Neurocomputing},
volume = {150},
pages = {124-125},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {article}
}
2014
Illescas, P. R.; Rizo, D.; Iñesta, J. M.
Melodic analysis of polyphonic music using an interactive pattern recognition tool Proceedings Article
In: Proc. of 7th Machine Learning and Music (MML2014), Barcelona, 2014.
@inproceedings{k328,
title = {Melodic analysis of polyphonic music using an interactive pattern recognition tool},
author = {P. R. Illescas and D. Rizo and J. M. Iñesta},
year = {2014},
date = {2014-12-01},
booktitle = {Proc. of 7th Machine Learning and Music (MML2014)},
address = {Barcelona},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Calvo-Zaragoza, J.; Oncina, J.
Recognition of Pen-Based Music Notation: the HOMUS dataset Proceedings Article
In: Proceedings of the 22nd International Conference on Pattern Recognition, pp. 3038-3043, Stockholm, Sweden, 2014, ISBN: 978-1-4799-5208-3.
Links | BibTeX | Tags: Prometeo 2012
@inproceedings{k316,
title = {Recognition of Pen-Based Music Notation: the HOMUS dataset},
author = {J. Calvo-Zaragoza and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/316/homus.pdf},
isbn = {978-1-4799-5208-3},
year = {2014},
date = {2014-08-01},
urldate = {2014-08-01},
booktitle = {Proceedings of the 22nd International Conference on Pattern Recognition},
pages = {3038-3043},
address = {Stockholm, Sweden},
keywords = {Prometeo 2012},
pubstate = {published},
tppubtype = {inproceedings}
}
Rico-Juan, J. R.; Iñesta, J. M.
Adaptive training set reduction for nearest neighbor classification Journal Article
In: Neurocomputing, vol. 138, pp. 316–324, 2014, ISSN: 0925-2312.
@article{k311,
title = {Adaptive training set reduction for nearest neighbor classification},
author = {J. R. Rico-Juan and J. M. Iñesta},
issn = {0925-2312},
year = {2014},
date = {2014-08-01},
journal = {Neurocomputing},
volume = {138},
pages = {316--324},
abstract = {The research community related to the human-interaction framework is becoming increasingly more interested in interactive pattern recognition, taking direct advantage of the feedback information provided by the user in each interaction step in order to improve raw performance. The application of this scheme requires learning techniques that are able to adaptively re-train the system and tune it to user behavior and the specific task considered. Traditional static editing methods filter the training set by applying certain rules in order to eliminate outliers or maintain those prototypes that can be beneficial in classification. This paper presents two new adaptive rank methods for selecting the best prototypes from a training set in order to establish its size according to an external parameter that controls the adaptation process, while maintaining the classification accuracy. These methods estimate the probability of each prototype of correctly classifying a new sample. This probability is used to sort the training set by relevance in classification. The results show that the proposed methods are able to maintain the error rate while reducing the size of the training set, thus allowing new examples to be learned with a few extra computations.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The research community related to the human-interaction framework is becoming increasingly more interested in interactive pattern recognition, taking direct advantage of the feedback information provided by the user in each interaction step in order to improve raw performance. The application of this scheme requires learning techniques that are able to adaptively re-train the system and tune it to user behavior and the specific task considered. Traditional static editing methods filter the training set by applying certain rules in order to eliminate outliers or maintain those prototypes that can be beneficial in classification. This paper presents two new adaptive rank methods for selecting the best prototypes from a training set in order to establish its size according to an external parameter that controls the adaptation process, while maintaining the classification accuracy. These methods estimate the probability of each prototype of correctly classifying a new sample. This probability is used to sort the training set by relevance in classification. The results show that the proposed methods are able to maintain the error rate while reducing the size of the training set, thus allowing new examples to be learned with a few extra computations.
Calvo-Zaragoza, J.; Oncina, J.
Recognition of Pen-based Music Notation with Probabilistic Machines Proceedings Article
In: Proceedings of the 7th International Workshop on Machine Learning and Music, Barcelona, Spain, 2014.
@inproceedings{k330,
title = {Recognition of Pen-based Music Notation with Probabilistic Machines},
author = {J. Calvo-Zaragoza and J. Oncina},
year = {2014},
date = {2014-01-01},
booktitle = {Proceedings of the 7th International Workshop on Machine Learning and Music},
address = {Barcelona, Spain},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Valero-Mas, J. J.; Iñesta, J. M.; Pérez-Sancho, C.
Onset detection with the user in the learning loop Proceedings Article
In: Proceedings of the 7th International Workshop on Music and Machine Learning (MML2014), Barcelona, Spain, 2014.
@inproceedings{k329,
title = {Onset detection with the user in the learning loop},
author = {J. J. Valero-Mas and J. M. Iñesta and C. Pérez-Sancho},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/329/onset-detection-user.pdf},
year = {2014},
date = {2014-01-01},
booktitle = {Proceedings of the 7th International Workshop on Music and Machine Learning (MML2014)},
address = {Barcelona, Spain},
keywords = {TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Micó, L.; Oncina, J.
Dynamic Insertions in TLAESA fast NN Search Algorithm Proceedings Article
In: Proceedings of the 22nd International Conference on Pattern Recognition, ICPR, Stockholm, Sweden, 2014, ISBN: 978-1-4799-5208-3.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIMuL
@inproceedings{k319,
title = {Dynamic Insertions in TLAESA fast NN Search Algorithm},
author = {L. Micó and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/319/icpr-2014.pdf},
isbn = {978-1-4799-5208-3},
year = {2014},
date = {2014-01-01},
booktitle = {Proceedings of the 22nd International Conference on Pattern Recognition, ICPR},
address = {Stockholm, Sweden},
abstract = {Nearest Neighbour search (NNS) is a widely used
technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. The need to work with large dynamic databases in interactive or online systems, has resulted in an increase interest in adapting or
creating fast methods to update these indexes. TLAESA is a fast search algorithm that computes a very low number of distance computations with sublinear overhead using a branch and bound technique.
In this paper, we propose a new fast updating method for the
TLAESA index. The behaviour of this index has been analysed
theoretical and experimentally. We have obtained a log-square
upper bound of the rebuilding expected time. This bound has
been verified experimentally on several synthetic and real data
experiments.},
keywords = {Prometeo 2012, TIMuL},
pubstate = {published},
tppubtype = {inproceedings}
}
Nearest Neighbour search (NNS) is a widely used
technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. The need to work with large dynamic databases in interactive or online systems, has resulted in an increase interest in adapting or
creating fast methods to update these indexes. TLAESA is a fast search algorithm that computes a very low number of distance computations with sublinear overhead using a branch and bound technique.
In this paper, we propose a new fast updating method for the
TLAESA index. The behaviour of this index has been analysed
theoretical and experimentally. We have obtained a log-square
upper bound of the rebuilding expected time. This bound has
been verified experimentally on several synthetic and real data
experiments.
technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. The need to work with large dynamic databases in interactive or online systems, has resulted in an increase interest in adapting or
creating fast methods to update these indexes. TLAESA is a fast search algorithm that computes a very low number of distance computations with sublinear overhead using a branch and bound technique.
In this paper, we propose a new fast updating method for the
TLAESA index. The behaviour of this index has been analysed
theoretical and experimentally. We have obtained a log-square
upper bound of the rebuilding expected time. This bound has
been verified experimentally on several synthetic and real data
experiments.
Conklin, D.; Ramírez, R.; Iñesta, J. M.
New Directions in Music and Machine Learning Journal Article
In: Journal of New Music Research, vol. 43, no. 3, pp. 251–254, 2014, ISSN: 0929-8215.
BibTeX | Tags:
@article{k317,
title = {New Directions in Music and Machine Learning},
author = {D. Conklin and R. Ramírez and J. M. Iñesta},
issn = {0929-8215},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Journal of New Music Research},
volume = {43},
number = {3},
pages = {251--254},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Martínez-Álvarez, A.; Calvo-Zaragoza, J.; Cuenca-Asensi, S.; Ortiz, A.; Jimeno-Morenilla, A.
Multi-objective adaptive evolutionary strategy for tuning compilations Journal Article
In: Neurocomputing, vol. 123, pp. 381-389, 2014, ISSN: 0925-2312.
BibTeX | Tags:
@article{k309,
title = {Multi-objective adaptive evolutionary strategy for tuning compilations},
author = {A. Martínez-Álvarez and J. Calvo-Zaragoza and S. Cuenca-Asensi and A. Ortiz and A. Jimeno-Morenilla},
issn = {0925-2312},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Neurocomputing},
volume = {123},
pages = {381-389},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Abreu, J.; Rico-Juan, J. R.
A New Iterative Algorithm for Computing a Quality Approximated Median of Strings based on Edit Operations Journal Article
In: Pattern Recognition Letters, vol. 36, pp. 74–80, 2014.
Abstract | Links | BibTeX | Tags: TIASA
@article{k308,
title = {A New Iterative Algorithm for Computing a Quality Approximated Median of Strings based on Edit Operations},
author = {J. Abreu and J. R. Rico-Juan},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/308/PRL+-+A+New+Iterative+Algorithm+for+Computing+a+Quality+Median.pdf},
year = {2014},
date = {2014-01-01},
journal = {Pattern Recognition Letters},
volume = {36},
pages = {74--80},
abstract = {This paper presents a new algorithm that can be used to compute an approximation to the median of a set of strings. The approximate median is obtained through the successive improvements of a partial solution. The edit distance from the partial solution to all the strings in the set is computed in each iteration, thus accounting for the frequency of each of the edit operations in all the positions of the approximate median. A goodness index for edit operations is later computed by multiplying their frequency by the cost. Each operation is tested, starting from that with the highest index, in order to verify whether applying it to the partial solution leads to an improvement. If successful, a new iteration begins from the new approximate median. The algorithm finishes when all the operations have been examined without a better solution being found. Comparative experiments involving Freeman chain codes encoding 2D shapes and the Copenhagen chromosome database show that the quality of the approximate median string is similar to benchmark approaches but achieves a much faster convergence.},
keywords = {TIASA},
pubstate = {published},
tppubtype = {article}
}
This paper presents a new algorithm that can be used to compute an approximation to the median of a set of strings. The approximate median is obtained through the successive improvements of a partial solution. The edit distance from the partial solution to all the strings in the set is computed in each iteration, thus accounting for the frequency of each of the edit operations in all the positions of the approximate median. A goodness index for edit operations is later computed by multiplying their frequency by the cost. Each operation is tested, starting from that with the highest index, in order to verify whether applying it to the partial solution leads to an improvement. If successful, a new iteration begins from the new approximate median. The algorithm finishes when all the operations have been examined without a better solution being found. Comparative experiments involving Freeman chain codes encoding 2D shapes and the Copenhagen chromosome database show that the quality of the approximate median string is similar to benchmark approaches but achieves a much faster convergence.
Higuera, C. De La; Oncina, J.
The most probable string: an algorithmic study Journal Article
In: Journal of Logic and Computation, vol. 24, no. 2, pp. 311-330, 2014, ISSN: 0955-792X.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIASA
@article{k304,
title = {The most probable string: an algorithmic study},
author = {C. De La Higuera and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/304/J+Logic+Computation-2013.pdf},
issn = {0955-792X},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Journal of Logic and Computation},
volume = {24},
number = {2},
pages = {311-330},
abstract = {The problem of finding the consensus (most probable string) for a distribution generated by a weighted finite automaton or a probabilistic grammar is related to a number of important questions: computing the distance between two distributions or finding the best translation (the most probable one) given a probabilistic finite state transducer. The problem is undecidable
with general weights and is NP-hard if the automaton is probabilistic. We give a pseudo-polynomial algorithm that solves a decision problem directly associated with the consensus string and answers if there is a (reasonably short) string whose probability is larger than a given bound in time polynomial in the the size of this bound, both for probabilistic finite automata
and probabilistic context-free grammars.We also study a randomized algorithm solving the same problem. Finally, we report links between the length of the consensus string and the probability of this string.},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {article}
}
The problem of finding the consensus (most probable string) for a distribution generated by a weighted finite automaton or a probabilistic grammar is related to a number of important questions: computing the distance between two distributions or finding the best translation (the most probable one) given a probabilistic finite state transducer. The problem is undecidable
with general weights and is NP-hard if the automaton is probabilistic. We give a pseudo-polynomial algorithm that solves a decision problem directly associated with the consensus string and answers if there is a (reasonably short) string whose probability is larger than a given bound in time polynomial in the the size of this bound, both for probabilistic finite automata
and probabilistic context-free grammars.We also study a randomized algorithm solving the same problem. Finally, we report links between the length of the consensus string and the probability of this string.
with general weights and is NP-hard if the automaton is probabilistic. We give a pseudo-polynomial algorithm that solves a decision problem directly associated with the consensus string and answers if there is a (reasonably short) string whose probability is larger than a given bound in time polynomial in the the size of this bound, both for probabilistic finite automata
and probabilistic context-free grammars.We also study a randomized algorithm solving the same problem. Finally, we report links between the length of the consensus string and the probability of this string.
López-García, G.; Gallego, A. J.; Molina-Carmona, R.; Compañ-Rosique, P.
Construction of Intelligent Virtual Worlds Using a Grammatical Framework Journal Article
In: International Journal of Intelligent Systems, vol. 29, no. 8, pp. 751-766, 2014.
BibTeX | Tags:
@article{k515,
title = {Construction of Intelligent Virtual Worlds Using a Grammatical Framework},
author = {G. López-García and A. J. Gallego and R. Molina-Carmona and P. Compañ-Rosique},
year = {2014},
date = {2014-01-01},
journal = {International Journal of Intelligent Systems},
volume = {29},
number = {8},
pages = {751-766},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2013
Piccoli, H. C. B.; Silla, C. N. Jr.; León, P. J. Ponce; Pertusa, A.
An Evaluation of Symbolic Feature Sets and Their Combination for Music Genre Classification Proceedings Article
In: Proc. of the 2013 IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 1901-1905, IEEE Computer Society, Manchester, UK, 2013, ISBN: 978-0-7695-5154-8.
Abstract | Links | BibTeX | Tags:
@inproceedings{k312,
title = {An Evaluation of Symbolic Feature Sets and Their Combination for Music Genre Classification},
author = {H. C. B. Piccoli and C. N. Jr. Silla and P. J. Ponce León and A. Pertusa},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/312/2013-SMC-MGC-camera-ready.pdf},
isbn = {978-0-7695-5154-8},
year = {2013},
date = {2013-10-01},
booktitle = {Proc. of the 2013 IEEE International Conference on Systems, Man and Cybernetics (SMC)},
pages = {1901-1905},
publisher = {IEEE Computer Society},
address = {Manchester, UK},
abstract = {The automatic music genre classification task is an active area of research in the field of Music Information Retrieval. In this paper we use two different symbolic feature sets for genre classification and combine them using an early fusion approach. Our results show that early fusion achieves better classification accuracy than using any of the individual feature sets. Furthermore, when compared with some of the state of the art approaches using the same experimental conditions, early fusion of symbolic features is ranked the second best method.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The automatic music genre classification task is an active area of research in the field of Music Information Retrieval. In this paper we use two different symbolic feature sets for genre classification and combine them using an early fusion approach. Our results show that early fusion achieves better classification accuracy than using any of the individual feature sets. Furthermore, when compared with some of the state of the art approaches using the same experimental conditions, early fusion of symbolic features is ranked the second best method.
Calvo-Zaragoza, J.; Oncina, J.
Human-Computer Interaction for Optical Music Recognition tasks Proceedings Article
In: Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes, pp. 9-12, Madrid, Spain, 2013, ISBN: 978-84-695-8332-6.
Links | BibTeX | Tags: Prometeo 2012, TIASA
@inproceedings{k306,
title = {Human-Computer Interaction for Optical Music Recognition tasks},
author = {J. Calvo-Zaragoza and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/306/wsrfai2013_submission_3.pdf},
isbn = {978-84-695-8332-6},
year = {2013},
date = {2013-09-01},
urldate = {2013-09-01},
booktitle = {Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes},
pages = {9-12},
address = {Madrid, Spain},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
Pérez-Sancho, C.; Bernabeu, J. F.
A Multimodal Genre Recognition Prototype Proceedings Article
In: Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes, pp. 13-16, Madrid, Spain, 2013, ISBN: 978-84-695-8332-6.
Abstract | Links | BibTeX | Tags: DRIMS, TIASA
@inproceedings{k305,
title = {A Multimodal Genre Recognition Prototype},
author = {C. Pérez-Sancho and J. F. Bernabeu},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/305/wsrfai2013_submission_4.pdf},
isbn = {978-84-695-8332-6},
year = {2013},
date = {2013-09-01},
urldate = {2013-09-01},
booktitle = {Actas del III Workshop de Reconocimiento de Formas y Análisis de Imágenes},
pages = {13-16},
address = {Madrid, Spain},
abstract = {In this paper, a multimodal and interactive prototype to perform music genre classification is presented. The system is oriented to multi-part files in symbolic format but it can be adapted using a transcription system to transform audio content in music scores. This prototype uses different sources of information to give a possible answer to the user. It has been developed to allow a human expert to interact with the system to improve its results. In its current implementation, it offers a limited range of interaction and multimodality. Further development aimed at full interactivity and multimodal interactions is discussed.},
keywords = {DRIMS, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, a multimodal and interactive prototype to perform music genre classification is presented. The system is oriented to multi-part files in symbolic format but it can be adapted using a transcription system to transform audio content in music scores. This prototype uses different sources of information to give a possible answer to the user. It has been developed to allow a human expert to interact with the system to improve its results. In its current implementation, it offers a limited range of interaction and multimodality. Further development aimed at full interactivity and multimodal interactions is discussed.
Higuera, C. De La; Oncina, J.
Computing the Most Probable String with a Probabilistic Finite State Machine Proceedings Article
In: Nederhof, Mark-Jan (Ed.): Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, pp. 1-8, Association for Computational Linguistics, 2013.
Abstract | Links | BibTeX | Tags: Prometeo 2012
@inproceedings{k314,
title = {Computing the Most Probable String with a Probabilistic Finite State Machine},
author = {C. De La Higuera and J. Oncina},
editor = {Mark-Jan Nederhof},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/314/W13-1801.pdf},
year = {2013},
date = {2013-07-01},
urldate = {2013-07-01},
booktitle = {Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing},
pages = {1-8},
publisher = {Association for Computational Linguistics},
abstract = {The problem of finding the consensus / most
probable string for a distribution generated by
a probabilistic finite automaton or a hidden
Markov model arises in a number of natural
language processing tasks: it has to be solved
in several transducer related tasks like opti-
mal decoding in speech, or finding the most
probable translation of an input sentence. We
provide an algorithm which solves these prob-
lems in time polynomial in the inverse of the
probability of the most probable string, which
in practise makes the computation tractable in
many cases. We also show that this exact com-
putation compares favourably with the tradi-
tional Viterbi computation.},
keywords = {Prometeo 2012},
pubstate = {published},
tppubtype = {inproceedings}
}
The problem of finding the consensus / most
probable string for a distribution generated by
a probabilistic finite automaton or a hidden
Markov model arises in a number of natural
language processing tasks: it has to be solved
in several transducer related tasks like opti-
mal decoding in speech, or finding the most
probable translation of an input sentence. We
provide an algorithm which solves these prob-
lems in time polynomial in the inverse of the
probability of the most probable string, which
in practise makes the computation tractable in
many cases. We also show that this exact com-
putation compares favourably with the tradi-
tional Viterbi computation.
probable string for a distribution generated by
a probabilistic finite automaton or a hidden
Markov model arises in a number of natural
language processing tasks: it has to be solved
in several transducer related tasks like opti-
mal decoding in speech, or finding the most
probable translation of an input sentence. We
provide an algorithm which solves these prob-
lems in time polynomial in the inverse of the
probability of the most probable string, which
in practise makes the computation tractable in
many cases. We also show that this exact com-
putation compares favourably with the tradi-
tional Viterbi computation.
Serrano, A.; Micó, L.; Oncina, J.
Which fast nearest neighbour search algorithm to use? Journal Article
In: Lecture Notes in Computer Science, vol. 7887, pp. 567-574, 2013.
Links | BibTeX | Tags: Prometeo 2012, TIASA
@article{k301,
title = {Which fast nearest neighbour search algorithm to use?},
author = {A. Serrano and L. Micó and J. Oncina},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/301/IbPria13.pdf},
year = {2013},
date = {2013-06-01},
journal = {Lecture Notes in Computer Science},
volume = {7887},
pages = {567-574},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {article}
}
Hontanilla, M.; Pérez-Sancho, C.; Iñesta, J. M.
Modeling Musical Style with Language Models for Composer Recognition Journal Article
In: Lecture Notes in Computer Science, vol. 7887, pp. 740-748, 2013, ISSN: 0302-9743.
Abstract | Links | BibTeX | Tags: DRIMS, Prometeo 2012
@article{k300,
title = {Modeling Musical Style with Language Models for Composer Recognition},
author = {M. Hontanilla and C. Pérez-Sancho and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/300/10.1007_978-3-642-38628-2_88.pdf},
issn = {0302-9743},
year = {2013},
date = {2013-06-01},
journal = {Lecture Notes in Computer Science},
volume = {7887},
pages = {740-748},
abstract = {In this paper we present an application of language modeling using n-grams to model the style of different composers. For this, we repeated the experiments performed in previous works by other authors using a corpus of 5 composers from the Baroque and Classical periods. In these experiments we found some signs that the results could be influenced by external factors other than the composers’ styles, such as the heterogeneity in the musical forms selected for the corpus. In order to as- sess the validity of the modeling techniques to capture the own personal style of the composers, a new experiment was performed with a corpus of fugues from Bach and Shostakovich. All these experiments show that language modeling is a suitable tool for modeling musical style, even when the styles of the different datasets are affected by several factors.},
keywords = {DRIMS, Prometeo 2012},
pubstate = {published},
tppubtype = {article}
}
In this paper we present an application of language modeling using n-grams to model the style of different composers. For this, we repeated the experiments performed in previous works by other authors using a corpus of 5 composers from the Baroque and Classical periods. In these experiments we found some signs that the results could be influenced by external factors other than the composers’ styles, such as the heterogeneity in the musical forms selected for the corpus. In order to as- sess the validity of the modeling techniques to capture the own personal style of the composers, a new experiment was performed with a corpus of fugues from Bach and Shostakovich. All these experiments show that language modeling is a suitable tool for modeling musical style, even when the styles of the different datasets are affected by several factors.
Iñesta, J. M.; Pérez-Sancho, C.
Interactive multimodal music transcription Proceedings Article
In: Proc. of IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP 2013), pp. 211-215, IEEE, Vancouver, Canada, 2013, ISBN: 978-1-4799-0356-6.
Abstract | BibTeX | Tags: DRIMS, Prometeo 2012
@inproceedings{k299,
title = {Interactive multimodal music transcription},
author = {J. M. Iñesta and C. Pérez-Sancho},
isbn = {978-1-4799-0356-6},
year = {2013},
date = {2013-05-01},
booktitle = {Proc. of IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP 2013)},
pages = {211-215},
publisher = {IEEE},
address = {Vancouver, Canada},
abstract = {Automatic music transcription has usually been performed as an autonomous task and its evaluation has been made in terms of precision, recall, accuracy, etc. Nevertheless, in this work, assuming that the state of the art is far from being perfect, it is considered as an interactive one, where an expert user is assisted in its work by a transcription tool. In this context, the performance evaluation of the system turns into an assessment of how many user interactions are needed to complete the work. The strategy is that the user interactions can be used by the system to improve its performance in an adaptive way, thus minimizing the workload. Also, a multimodal approach has been implemented, in such a way that different sources of information, like onsets, beats, and meter, are used to detect notes in a musical audio excerpt. The system is focused on monotimbral polyphonic transcription.},
keywords = {DRIMS, Prometeo 2012},
pubstate = {published},
tppubtype = {inproceedings}
}
Automatic music transcription has usually been performed as an autonomous task and its evaluation has been made in terms of precision, recall, accuracy, etc. Nevertheless, in this work, assuming that the state of the art is far from being perfect, it is considered as an interactive one, where an expert user is assisted in its work by a transcription tool. In this context, the performance evaluation of the system turns into an assessment of how many user interactions are needed to complete the work. The strategy is that the user interactions can be used by the system to improve its performance in an adaptive way, thus minimizing the workload. Also, a multimodal approach has been implemented, in such a way that different sources of information, like onsets, beats, and meter, are used to detect notes in a musical audio excerpt. The system is focused on monotimbral polyphonic transcription.
Socorro, R.; Micó, L.
Uso eficiente de pivotes aplicado a la búsqueda aproximada en algoritmos rápidos sobre espacios métricos Journal Article
In: Computación y Sistemas, vol. 17, no. 4, pp. 477-488, 2013.
@article{k310,
title = {Uso eficiente de pivotes aplicado a la búsqueda aproximada en algoritmos rápidos sobre espacios métricos},
author = {R. Socorro and L. Micó},
year = {2013},
date = {2013-01-01},
journal = {Computación y Sistemas},
volume = {17},
number = {4},
pages = {477-488},
abstract = {This work focuses on pivot-based fast nearest neighbor search algorithms that can work in any metric space. One of the objectives of these algorithms is to reduce the time consumed during
search. Reducing time consumption of such algorithms usually consists in reducing the number of distances for computing, due to the high cost that they have in certain applications. We introduce a new version and improvements for a recently proposed algorithm, PiAESA, a variant of the AESA algorithm, used as baseline for performance measurement for over twenty years. The new version is simpler and allows better understanding of the algorithm and parameters used. Moreover, the efficiency is increased by defining an approximated version. Our empirical results with real and artificial databases confirm a consistent improvement in performance, when retrieving very high percentage of the correct answers (given by the exact algorithm).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This work focuses on pivot-based fast nearest neighbor search algorithms that can work in any metric space. One of the objectives of these algorithms is to reduce the time consumed during
search. Reducing time consumption of such algorithms usually consists in reducing the number of distances for computing, due to the high cost that they have in certain applications. We introduce a new version and improvements for a recently proposed algorithm, PiAESA, a variant of the AESA algorithm, used as baseline for performance measurement for over twenty years. The new version is simpler and allows better understanding of the algorithm and parameters used. Moreover, the efficiency is increased by defining an approximated version. Our empirical results with real and artificial databases confirm a consistent improvement in performance, when retrieving very high percentage of the correct answers (given by the exact algorithm).
search. Reducing time consumption of such algorithms usually consists in reducing the number of distances for computing, due to the high cost that they have in certain applications. We introduce a new version and improvements for a recently proposed algorithm, PiAESA, a variant of the AESA algorithm, used as baseline for performance measurement for over twenty years. The new version is simpler and allows better understanding of the algorithm and parameters used. Moreover, the efficiency is increased by defining an approximated version. Our empirical results with real and artificial databases confirm a consistent improvement in performance, when retrieving very high percentage of the correct answers (given by the exact algorithm).
Calvo-Zaragoza, J.; Oncina, J.; Iñesta, J. M.
Recognition of Online Handwritten Music Symbols Proceedings Article
In: Proceedings of the 6th International Workshop on Machine Learning and Music, Prague, Czech Republic, 2013.
Abstract | Links | BibTeX | Tags: Prometeo 2012, TIASA
@inproceedings{k307,
title = {Recognition of Online Handwritten Music Symbols},
author = {J. Calvo-Zaragoza and J. Oncina and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/307/calvozaragoza-mml13.pdf},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
booktitle = {Proceedings of the 6th International Workshop on Machine Learning and Music},
address = {Prague, Czech Republic},
abstract = {An effective way of digitizing a new musical composition is to use an e-pen and tablet application in which the user's pen strokes are recognized online and the digital score is created with the sole effort of the composition itself. This work aims to be a starting point for research on the recognition of online handwritten music notation. To this end, different alternatives within the two modalities of recognition resulting from this data are presented: online recognition, which uses the strokes marked by a pen, and offline recognition, which uses the image generated after drawing the symbol. A comparative experiment with common machine learning algorithms over a dataset of 3800 samples and 32 different music symbols is presented. Results show that samples of the actual user are needed if good classification rates are pursued. Moreover, algorithms using the online data, on average, achieve better classifocation results than the others.},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
An effective way of digitizing a new musical composition is to use an e-pen and tablet application in which the user's pen strokes are recognized online and the digital score is created with the sole effort of the composition itself. This work aims to be a starting point for research on the recognition of online handwritten music notation. To this end, different alternatives within the two modalities of recognition resulting from this data are presented: online recognition, which uses the strokes marked by a pen, and offline recognition, which uses the image generated after drawing the symbol. A comparative experiment with common machine learning algorithms over a dataset of 3800 samples and 32 different music symbols is presented. Results show that samples of the actual user are needed if good classification rates are pursued. Moreover, algorithms using the online data, on average, achieve better classifocation results than the others.
Pertusa, A.; Gallego, A. J.; Bernabeu, M.
MirBot: A multimodal interactive image retrieval system Journal Article
In: Lecture Notes in Computer Science, vol. 7887, pp. 197-204, 2013, ISSN: 1611-3349.
@article{k303,
title = {MirBot: A multimodal interactive image retrieval system},
author = {A. Pertusa and A. J. Gallego and M. Bernabeu},
issn = {1611-3349},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
journal = {Lecture Notes in Computer Science},
volume = {7887},
pages = {197-204},
abstract = {This study presents a multimodal interactive image retrieval system for smartphones (MirBot). The application is designed as a collaborative game where users can categorize photographs according to the WordNet hierarchy. After taking a picture, the region of interest of the target can be selected, and the image information is sent with a set of metadata to a server in order to classify the object. The user can validate the category proposed by the system to improve future queries. The result is a labeled database with a structure similar to ImageNet, but with contents selected by the users, fully marked with regions of interest, and with novel metadata that can be useful to constrain the search space in a future work. The MirBot app is freely available on the Apple app store.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This study presents a multimodal interactive image retrieval system for smartphones (MirBot). The application is designed as a collaborative game where users can categorize photographs according to the WordNet hierarchy. After taking a picture, the region of interest of the target can be selected, and the image information is sent with a set of metadata to a server in order to classify the object. The user can validate the category proposed by the system to improve future queries. The result is a labeled database with a structure similar to ImageNet, but with contents selected by the users, fully marked with regions of interest, and with novel metadata that can be useful to constrain the search space in a future work. The MirBot app is freely available on the Apple app store.
Sanches, J. M.; Micó, L.; Cardoso, J. S.
Pattern Recognition and Image Analysis 6th Iberian Conference, IbPRIA 2013 Book
Springer, 2013.
BibTeX | Tags: Prometeo 2012, TIASA
@book{k302,
title = {Pattern Recognition and Image Analysis 6th Iberian Conference, IbPRIA 2013},
author = {J. M. Sanches and L. Micó and J. S. Cardoso},
editor = {J. M. Sanches and L. Micó and J. S. Cardoso},
year = {2013},
date = {2013-01-01},
publisher = {Springer},
keywords = {Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {book}
}
2012
Abreu, J.; Rico-Juan, J. R.
An improved fast edit approach for two-string approximated mean computation applied to OCR Journal Article
In: Pattern Recognition Letters, vol. 34, no. 5, pp. 496–-504, 2012.
@article{k333,
title = {An improved fast edit approach for two-string approximated mean computation applied to OCR},
author = {J. Abreu and J. R. Rico-Juan},
year = {2012},
date = {2012-12-01},
journal = {Pattern Recognition Letters},
volume = {34},
number = {5},
pages = {496---504},
abstract = {This paper presents a new fast algorithm for computing an approximation to the mean of two strings of characters representing a 2D shape and its application to a new Wilson-based editing procedure. The approximate mean is built up by including some symbols from the two original strings. In addition, a Greedy approach to this algorithm is studied, which allows us to reduce the time required to compute an approximate mean. The new dataset editing scheme relaxes the criterion for deleting instances proposed by the Wilson editing procedure. In practice, not all instances misclassified by their near neighbors are pruned. Instead, an artificial instance is added to the dataset in the hope of successfully classifying the instance in the future. The new artificial instance is the approximated mean of the misclassified sample and its same-class nearest neighbor.
Experiments carried out over three widely known databases of contours show that the proposed algorithm performs very well when computing the mean of two strings, and outperforms methods proposed by other authors. In particular, the low computational time required by the heuristic approach makes it very suitable when dealing with long length strings. Results also show that the proposed preprocessing scheme can reduce the classification error in about 83% of trials. There is empirical evidence that using the Greedy approximation to compute the approximated mean does not affect the performance of the editing procedure.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper presents a new fast algorithm for computing an approximation to the mean of two strings of characters representing a 2D shape and its application to a new Wilson-based editing procedure. The approximate mean is built up by including some symbols from the two original strings. In addition, a Greedy approach to this algorithm is studied, which allows us to reduce the time required to compute an approximate mean. The new dataset editing scheme relaxes the criterion for deleting instances proposed by the Wilson editing procedure. In practice, not all instances misclassified by their near neighbors are pruned. Instead, an artificial instance is added to the dataset in the hope of successfully classifying the instance in the future. The new artificial instance is the approximated mean of the misclassified sample and its same-class nearest neighbor.
Experiments carried out over three widely known databases of contours show that the proposed algorithm performs very well when computing the mean of two strings, and outperforms methods proposed by other authors. In particular, the low computational time required by the heuristic approach makes it very suitable when dealing with long length strings. Results also show that the proposed preprocessing scheme can reduce the classification error in about 83% of trials. There is empirical evidence that using the Greedy approximation to compute the approximated mean does not affect the performance of the editing procedure.
Experiments carried out over three widely known databases of contours show that the proposed algorithm performs very well when computing the mean of two strings, and outperforms methods proposed by other authors. In particular, the low computational time required by the heuristic approach makes it very suitable when dealing with long length strings. Results also show that the proposed preprocessing scheme can reduce the classification error in about 83% of trials. There is empirical evidence that using the Greedy approximation to compute the approximated mean does not affect the performance of the editing procedure.
Socorro, R.
Optimización del uso de pivotes en tareas de búsqueda y clasificación PhD Thesis
2012.
BibTeX | Tags:
@phdthesis{k298,
title = {Optimización del uso de pivotes en tareas de búsqueda y clasificación},
author = {R. Socorro},
editor = {L. Micó},
year = {2012},
date = {2012-12-01},
organization = {Departamento de Lenguajes y Sistemas Informáticos},
keywords = {},
pubstate = {published},
tppubtype = {phdthesis}
}
Bresson, J.; Pérez-Sancho, C.
New Framework for Score Segmentation and Analysis in OpenMusic Proceedings Article
In: Serafin, S. (Ed.): Proceedings of the 9th Sound and Music Computing Conference, pp. 506-513, Sound & Music Computing Logos Verlag, Copenhagen, Denmark, 2012, ISBN: 978-3-8325-3180-5.
Abstract | Links | BibTeX | Tags: DRIMS, PASCAL2
@inproceedings{k295,
title = {New Framework for Score Segmentation and Analysis in OpenMusic},
author = {J. Bresson and C. Pérez-Sancho},
editor = {S. Serafin},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/295/smc2012-149.pdf},
isbn = {978-3-8325-3180-5},
year = {2012},
date = {2012-07-01},
booktitle = {Proceedings of the 9th Sound and Music Computing Conference},
pages = {506-513},
publisher = {Logos Verlag},
address = {Copenhagen, Denmark},
organization = {Sound & Music Computing},
abstract = {We present new tools for the segmentation and analysis of musical scores in the OpenMusic computer-aided composition environment. A modular object-oriented framework enables the creation of segmentations on score objects and the implementation of automatic or semi-automatic analysis processes. The analyses can be performed and displayed thanks to customizable classes and callbacks. Concrete examples are given, in particular with the implementation of a semi-automatic harmonic analysis system and a framework for rhythmic transcription.},
keywords = {DRIMS, PASCAL2},
pubstate = {published},
tppubtype = {inproceedings}
}
We present new tools for the segmentation and analysis of musical scores in the OpenMusic computer-aided composition environment. A modular object-oriented framework enables the creation of segmentations on score objects and the implementation of automatic or semi-automatic analysis processes. The analyses can be performed and displayed thanks to customizable classes and callbacks. Concrete examples are given, in particular with the implementation of a semi-automatic harmonic analysis system and a framework for rhythmic transcription.
Bernabeu, J. F.; Calera-Rubio, J.; Iñesta, J. M.; Rizo, D.
Query Parsing Using Probabilistic Tree Grammars Technical Report
Edinburgh, 2012.
Abstract | Links | BibTeX | Tags: DRIMS
@techreport{k292,
title = {Query Parsing Using Probabilistic Tree Grammars},
author = {J. F. Bernabeu and J. Calera-Rubio and J. M. Iñesta and D. Rizo},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/292/mml2012.pdf},
year = {2012},
date = {2012-06-01},
booktitle = {5th workshop on Music and Machine Learning, MML 2012},
address = {Edinburgh},
organization = {5th workshop on Music and Machine Learning, MML 2012},
abstract = {The tree representation, using rhythm for defining the tree structure and pitch infor- mation for node labeling has proven to be ef- fective in melodic similarity computation. In this paper we propose a solution representing melodies by tree grammars. For that, we in- fer a probabilistic context-free grammars for the melodies in a database, using their tree coding (with duration and pitch) and classify queries represented as a string of pitches. We aim to assess their ability to identify a noisy snippet query among a set of songs stored in symbolic format.},
keywords = {DRIMS},
pubstate = {published},
tppubtype = {techreport}
}
The tree representation, using rhythm for defining the tree structure and pitch infor- mation for node labeling has proven to be ef- fective in melodic similarity computation. In this paper we propose a solution representing melodies by tree grammars. For that, we in- fer a probabilistic context-free grammars for the melodies in a database, using their tree coding (with duration and pitch) and classify queries represented as a string of pitches. We aim to assess their ability to identify a noisy snippet query among a set of songs stored in symbolic format.
Rico-Juan, J. R.; Iñesta, J. M.
Confidence voting method ensemble applied to off-line signature verification Journal Article
In: Pattern Analysis and Applications, vol. 15, no. 2, pp. 113–120, 2012, ISSN: 1433-7541.
Abstract | Links | BibTeX | Tags: MIPRCV, TIASA
@article{k290,
title = {Confidence voting method ensemble applied to off-line signature verification},
author = {J. R. Rico-Juan and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/290/rico_juanConfidenceVotingMethodEmsembleOffLineSignatureVerification.pdf},
issn = {1433-7541},
year = {2012},
date = {2012-04-01},
journal = {Pattern Analysis and Applications},
volume = {15},
number = {2},
pages = {113--120},
abstract = {In this paper, a new approximation to off-line signature verification is proposed based on two-class classifiers using an expert decisions ensemble. Different methods to extract sets of local and a global features from the target sample are detailed. Also a normalisation by confidence voting method is used in order to decrease the final equal error rate (EER). Each set of features is processed by a single expert, and on the other approach proposed, the decisions of the individual classifiers are combined using weighted votes. Experimental results are given using a subcorpus of the large MCYT signature database for random and skilled forgeries. The results show that the weighted combination outperforms the individual classifiers significantly. The best EER obtained were 6.3% in the case of skilled forgeries and 2.3% in the case of random forgeries.},
keywords = {MIPRCV, TIASA},
pubstate = {published},
tppubtype = {article}
}
In this paper, a new approximation to off-line signature verification is proposed based on two-class classifiers using an expert decisions ensemble. Different methods to extract sets of local and a global features from the target sample are detailed. Also a normalisation by confidence voting method is used in order to decrease the final equal error rate (EER). Each set of features is processed by a single expert, and on the other approach proposed, the decisions of the individual classifiers are combined using weighted votes. Experimental results are given using a subcorpus of the large MCYT signature database for random and skilled forgeries. The results show that the weighted combination outperforms the individual classifiers significantly. The best EER obtained were 6.3% in the case of skilled forgeries and 2.3% in the case of random forgeries.
Rico-Juan, J. R.; Iñesta, J. M.
New rank methods for reducing the size of the training set using the nearest neighbor rule Journal Article
In: Pattern Recognition Letters, vol. 33, no. 5, pp. 654–660, 2012, ISSN: 0167-8655.
Abstract | Links | BibTeX | Tags: DRIMS, MIPRCV, TIASA
@article{k283,
title = {New rank methods for reducing the size of the training set using the nearest neighbor rule},
author = {J. R. Rico-Juan and J. M. Iñesta},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/283/rankTrainingSet.pdf},
issn = {0167-8655},
year = {2012},
date = {2012-04-01},
journal = {Pattern Recognition Letters},
volume = {33},
number = {5},
pages = {654--660},
abstract = {(http://dx.doi.org/10.1016/j.patrec.2011.07.019)
Some new rank methods to select the best prototypes from a training set are proposed in this paper in order to establish its size according to an external parameter, while maintaining the classification accuracy. The traditional methods that filter the training set in a classification task like editing or condensing have some rules that apply to the set in order to remove outliers or keep some prototypes that help in the classification. In our approach, new voting methods are proposed to compute the prototype probability and help to classify correctly a new sample. This probability is the key to sorting the training set out, so a relevance factor from 0 to 1 is used to select the best candidates for each class whose accumulated probabilities are less than that parameter. This approach makes it possible to select the number of prototypes necessary to maintain or even increase the classification accuracy. The results obtained in different high dimensional databases show that these methods maintain the final error rate while reducing the size of the training set.},
keywords = {DRIMS, MIPRCV, TIASA},
pubstate = {published},
tppubtype = {article}
}
(http://dx.doi.org/10.1016/j.patrec.2011.07.019)
Some new rank methods to select the best prototypes from a training set are proposed in this paper in order to establish its size according to an external parameter, while maintaining the classification accuracy. The traditional methods that filter the training set in a classification task like editing or condensing have some rules that apply to the set in order to remove outliers or keep some prototypes that help in the classification. In our approach, new voting methods are proposed to compute the prototype probability and help to classify correctly a new sample. This probability is the key to sorting the training set out, so a relevance factor from 0 to 1 is used to select the best candidates for each class whose accumulated probabilities are less than that parameter. This approach makes it possible to select the number of prototypes necessary to maintain or even increase the classification accuracy. The results obtained in different high dimensional databases show that these methods maintain the final error rate while reducing the size of the training set.
Some new rank methods to select the best prototypes from a training set are proposed in this paper in order to establish its size according to an external parameter, while maintaining the classification accuracy. The traditional methods that filter the training set in a classification task like editing or condensing have some rules that apply to the set in order to remove outliers or keep some prototypes that help in the classification. In our approach, new voting methods are proposed to compute the prototype probability and help to classify correctly a new sample. This probability is the key to sorting the training set out, so a relevance factor from 0 to 1 is used to select the best candidates for each class whose accumulated probabilities are less than that parameter. This approach makes it possible to select the number of prototypes necessary to maintain or even increase the classification accuracy. The results obtained in different high dimensional databases show that these methods maintain the final error rate while reducing the size of the training set.
Vicente, O.; Iñesta, J. M.
Bass track selection in MIDI files and multimodal implications to melody Proceedings Article
In: Carmona, J. Salvador Sá Pedro Latorre; nchez,; Fred, Ana (Ed.): Proceedings of the Int. Conf. on Pattern Recognition Applications and Methods (ICPRAM 2012), pp. 449–458, INSTICC SciTePress, Vilamoura, Portugal, 2012, ISBN: 978-989-8425-98-0.
Abstract | BibTeX | Tags: DRIMS, MIPRCV
@inproceedings{k285,
title = {Bass track selection in MIDI files and multimodal implications to melody},
author = {O. Vicente and J. M. Iñesta},
editor = {J. Salvador Sá Pedro Latorre Carmona and nchez and Ana Fred},
isbn = {978-989-8425-98-0},
year = {2012},
date = {2012-02-01},
urldate = {2012-02-01},
booktitle = {Proceedings of the Int. Conf. on Pattern Recognition Applications and Methods (ICPRAM 2012)},
pages = {449--458},
publisher = {SciTePress},
address = {Vilamoura, Portugal},
organization = {INSTICC},
abstract = {Standard MIDI files consist of a number of tracks containing information that can be considered as a symbolic representation of music. Usually each track represents an instrument or voice in a music piece. The goal for this work is to identify the track that contains the bass line. This information is very relevant for a number of tasks like rhythm analysis or harmonic segmentation, among others. It is not easy since a bass line can be performed by very different kinds of instruments. We have approached this problem by using statistical features from the symbolic representation of music and a random forest classifier. The first experiment was to classify a track as bass or non-bass. Then we have tried to select the correct bass track in a multi-track MIDI file. Eventually, we have studied the issue of how different sources of information can help in this latter task. In particular, we have analyzed the interactions between bass and melody information. Yielded results were very accurate and melody track identification was significantly improved when using this kind of multimodal help.},
keywords = {DRIMS, MIPRCV},
pubstate = {published},
tppubtype = {inproceedings}
}
Standard MIDI files consist of a number of tracks containing information that can be considered as a symbolic representation of music. Usually each track represents an instrument or voice in a music piece. The goal for this work is to identify the track that contains the bass line. This information is very relevant for a number of tasks like rhythm analysis or harmonic segmentation, among others. It is not easy since a bass line can be performed by very different kinds of instruments. We have approached this problem by using statistical features from the symbolic representation of music and a random forest classifier. The first experiment was to classify a track as bass or non-bass. Then we have tried to select the correct bass track in a multi-track MIDI file. Eventually, we have studied the issue of how different sources of information can help in this latter task. In particular, we have analyzed the interactions between bass and melody information. Yielded results were very accurate and melody track identification was significantly improved when using this kind of multimodal help.
Serrano, A.; Micó, L.; Oncina, J.
Restructuring Versus non Restructuring Insertions in MDF Indexes Proceedings Article
In: Carmona, J. Salvador Sá Pedro Latorre; nchez,; Fred, Ana (Ed.): ICPRAM 2012: 1st International Conference on Pattern Recognition Applications and Methods, pp. 474–480, INSTICC SciTePress, Vilamoura, Portugal, 2012, ISBN: 978-989-8425-98-0.
Abstract | Links | BibTeX | Tags: MIPRCV, TIASA
@inproceedings{k282,
title = {Restructuring Versus non Restructuring Insertions in MDF Indexes},
author = {A. Serrano and L. Micó and J. Oncina},
editor = {J. Salvador Sá Pedro Latorre Carmona and nchez and Ana Fred},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/282/ICPRAM12.pdf},
isbn = {978-989-8425-98-0},
year = {2012},
date = {2012-02-01},
booktitle = {ICPRAM 2012: 1st International Conference on Pattern Recognition Applications and Methods},
pages = {474--480},
publisher = {SciTePress},
address = {Vilamoura, Portugal},
organization = {INSTICC},
abstract = {MDF tree is a data structure (index) that is used to speed up similarity searches in huge databases. To achieve its goal the indexes should exploit some property of the dissimilarity measure. MDF indexes assume that the dissimilarity measure can be viewed as a distance in a metric space. Moreover, in this framework is assumed that the distance is computationally very expensive and then, counting distance computations is a good measure of the time complexity.
To tackle with a changing world, a problem arises when new points should be inserted in the index. Efficient algorithms should choose between trying to be efficient in search maintaining the “ideal” structure of the index or trying to be efficient when inserting but worsening the search time.
In this work we propose an insertion algorithm for MDF trees that focus on optimizing insertion times. The worst case time complexity of the algorithm only depends on the depth of the MDF tree. We compare this algorithm with a similar one that focuses on search time performance. We also study the range of applicability of each one.},
keywords = {MIPRCV, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
MDF tree is a data structure (index) that is used to speed up similarity searches in huge databases. To achieve its goal the indexes should exploit some property of the dissimilarity measure. MDF indexes assume that the dissimilarity measure can be viewed as a distance in a metric space. Moreover, in this framework is assumed that the distance is computationally very expensive and then, counting distance computations is a good measure of the time complexity.
To tackle with a changing world, a problem arises when new points should be inserted in the index. Efficient algorithms should choose between trying to be efficient in search maintaining the “ideal” structure of the index or trying to be efficient when inserting but worsening the search time.
In this work we propose an insertion algorithm for MDF trees that focus on optimizing insertion times. The worst case time complexity of the algorithm only depends on the depth of the MDF tree. We compare this algorithm with a similar one that focuses on search time performance. We also study the range of applicability of each one.
To tackle with a changing world, a problem arises when new points should be inserted in the index. Efficient algorithms should choose between trying to be efficient in search maintaining the “ideal” structure of the index or trying to be efficient when inserting but worsening the search time.
In this work we propose an insertion algorithm for MDF trees that focus on optimizing insertion times. The worst case time complexity of the algorithm only depends on the depth of the MDF tree. We compare this algorithm with a similar one that focuses on search time performance. We also study the range of applicability of each one.
Moreno-Seco, F.; Oncina, J.; Micó, L.
Improving the Linear Approximating and Eliminating Search Algorithm (LAESA) Error Rates Book Chapter
In: Pattern Recognition and Applications. Frontiers in Artificial Intelli-gence and Applications, Chapter -, pp. 43, IOS Press, 2012.
BibTeX | Tags:
@inbook{k69,
title = {Improving the Linear Approximating and Eliminating Search Algorithm (LAESA) Error Rates},
author = {F. Moreno-Seco and J. Oncina and L. Micó},
year = {2012},
date = {2012-01-01},
urldate = {2012-01-01},
booktitle = {Pattern Recognition and Applications. Frontiers in Artificial Intelli-gence and Applications},
pages = {43},
publisher = {IOS Press},
chapter = {-},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
López, D.; Calera-Rubio, J.; Gallego-Sánchez, A. J.
Inference of k-Testable Directed Acyclic Graph Languages Proceedings Article
In: Journal of Machine Learning Research: Workshop and Conference Proceedings, Vol. 21: ICGI 2012, pp. 149-163, 2012.
Abstract | Links | BibTeX | Tags: PASCAL2, Prometeo 2012, TIASA
@inproceedings{k296,
title = {Inference of k-Testable Directed Acyclic Graph Languages},
author = {D. López and J. Calera-Rubio and A. J. Gallego-Sánchez},
url = {https://grfia.dlsi.ua.es/repositori/grfia/pubs/296/lopez12a.pdf},
year = {2012},
date = {2012-01-01},
booktitle = {Journal of Machine Learning Research: Workshop and Conference Proceedings, Vol. 21: ICGI 2012},
pages = {149-163},
abstract = {In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data.},
keywords = {PASCAL2, Prometeo 2012, TIASA},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data.