JOSE MARIA
ONCINA CARRATALA
CATEDRATICO/A DE UNIVERSIDAD
Publicaciones (70) Publicaciones de JOSE MARIA ONCINA CARRATALA
2020
-
Adaptively Learning to Recognize Symbols in Handwritten Early Music
Communications in Computer and Information Science
2017
-
An efficient approach for Interactive Sequential Pattern Recognition
Pattern Recognition, Vol. 64, pp. 295-304
-
Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton
International Journal of Foundations of Computer Science, Vol. 28, Núm. 5, pp. 603-621
-
Recognition of pen-based music notation with finite-state machines
Expert Systems with Applications, Vol. 72, pp. 395-406
-
Staff-line detection and removal using a convolutional neural network
Machine Vision and Applications, Vol. 28, Núm. 5-6, pp. 665-674
2016
-
Computing the expected edit distance from a string to a PFA
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
Music staff removal with supervised pixel classification
International Journal on Document Analysis and Recognition, Vol. 19, Núm. 3, pp. 211-219
2015
-
Clustering of strokes from pen-based music notation: An experimental study
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014
-
Dynamic Insertions in TLAESA fast NN search algorithm
Proceedings - International Conference on Pattern Recognition
-
Recognition of pen-based music notation: The HOMUS dataset
Proceedings - International Conference on Pattern Recognition
-
The most probable string: An algorithmic study
Journal of Logic and Computation, Vol. 24, Núm. 2, pp. 311-330
2013
-
Computing the most probable string with a probabilistic finite state machine
FSMNLP 2013 - Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
-
Which fast nearest neighbour search algorithm to use?
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2012
-
A log square average case algorithm to make insertions in fast similarity search
Pattern Recognition Letters, Vol. 33, Núm. 9, pp. 1060-1065
-
Restructuring versus non restructuring insertions in MDF indexes
ICPRAM 2012 - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods
2011
-
A fast pivot-based indexing algorithm for metric spaces
Pattern Recognition Letters, Vol. 32, Núm. 11, pp. 1511-1516
-
Efficient search supporting several similarity queries by reordering pivots
Proceedings of the 8th IASTED International Conference on Signal Processing, Pattern Recognition, and Applications, SPPRA 2011
-
Finding the most probable string and the consensus string: An algorithmic study
IWPT 2011 - Proceedings of the 12th International Conference on Parsing Technologies
-
Impact of the initialization in tree-based fast similarity search techniques
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
Interactive structured output prediction: Application to chromosome classification
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)