Francisco Alvaro
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Francisco Alvaro has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Joan-Andreu Sánchez
4 shared publicationsJose-Miguel Benedi
4 shared publicationsJoan-Andreu Sanchez
3 shared publications- José-Miguel Benedí
Universitat Politècnica València
3 shared publications - Francisco Cruz
Universitat Autónoma de Barcelona
2 shared publications José-Miguel Benedí
Universitat Politècnica de València
2 shared publications
Latest Publications
- Open Access
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 247-252
Crowdsourcing Online Handwriting Acquisition to Develop and Deploy a Unicode Character Classifier
There are thousands of Unicode characters and hence it can be hard to visually find a particular one. For this reason, we aimed at developing a tool that allows to handwrite a character and receive a list of the most similar candidates to that input. This tool will be integrated in a math editor which handles more than 5,000 different Unicode characters. Since no public datasets were found to fit our needs, we crowdsourced the acquisition of online handwritten data for training purposes. We developed a neural network combining convolutional layers with shape-based features to classify online handwritten Unicode characters. To make the model more robust to input variability, we used data augmentation in the form of affine transformations. We achieved a top-20 error rate of 12.64% on validation data and received positive feedback from users, thus validating that crowdsourcing is a proper method for online handwriting acquisition. Finally, we deployed the model wrapped in a JSON-based REST API and released a public demo using it. This way, we present the full development cycle of a Unicode character classifier.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 247-252
Open AccessCrowdsourcing Online Handwriting Acquisition to Develop and Deploy a Unicode Character Classifier
There are thousands of Unicode characters and hence it can be hard to visually find a particular one. For this reason, we aimed at developing a tool that allows to handwrite a character and receive a list of the most similar candidates to that input. This tool will be integrated in a math editor which handles more than 5,000 different Unicode characters. Since no public datasets were found to fit our needs, we crowdsourced the acquisition of online handwritten data for training purposes. We developed a neural network combining convolutional layers with shape-based features to classify online handwritten Unicode characters. To make the model more robust to input variability, we used data augmentation in the form of affine transformations. We achieved a top-20 error rate of 12.64% on validation data and received positive feedback from users, thus validating that crowdsourcing is a proper method for online handwriting acquisition. Finally, we deployed the model wrapped in a JSON-based REST API and released a public demo using it. This way, we present the full development cycle of a Unicode character classifier.
- 1 March 2016
- Published by Elsevier in Pattern Recognition
- Vol. 51, 135-147
An integrated grammar-based approach for mathematical expression recognition
- 1 March 2016
- Published by Elsevier in Pattern Recognition
- Vol. 51, 135-147
An integrated grammar-based approach for mathematical expression recognition
- 7 May 2015
- Published by Taylor & Francis in International Journal of Human–Computer Interaction
- Vol. 31 (7) , 457-471
μcaptcha: Human Interaction Proofs Tailored to Touch-Capable Devices via Math Handwriting
- 7 May 2015
- Published by Taylor & Francis in International Journal of Human–Computer Interaction
- Vol. 31 (7) , 457-471
μcaptcha: Human Interaction Proofs Tailored to Touch-Capable Devices via Math Handwriting
- 1 February 2015
- Published by Elsevier in Neurocomputing
- Vol. 150, 147-154
Structure detection and segmentation of documents using 2D stochastic context-free grammars
- 1 February 2015
- Published by Elsevier in Neurocomputing
- Vol. 150, 147-154
Structure detection and segmentation of documents using 2D stochastic context-free grammars
- 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4477 (10514651) , 2944-2949
Offline Features for Classifying Handwritten Math Symbols with Recurrent Neural Networks
In mathematical expression recognition, symbol classification is a crucial step. Numerous approaches for recognizing handwritten math symbols have been published, but most of them are either an online approach or a hybrid approach. There is an absence of a study focused on offline features for handwritten math symbol recognition. Furthermore, many papers provide results difficult to compare. In this paper we assess the performance of several well-known offline features for this task. We also test a novel set of features based on polar histograms and the vertical repositioning method for feature extraction. Finally, we report and analyze the results of several experiments using recurrent neural networks on a large public database of online handwritten math expressions. The combination of online and offline features significantly improved the recognition rate.
- 1 August 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4477 (10514651) , 2944-2949
Offline Features for Classifying Handwritten Math Symbols with Recurrent Neural Networks
In mathematical expression recognition, symbol classification is a crucial step. Numerous approaches for recognizing handwritten math symbols have been published, but most of them are either an online approach or a hybrid approach. There is an absence of a study focused on offline features for handwritten math symbol recognition. Furthermore, many papers provide results difficult to compare. In this paper we assess the performance of several well-known offline features for this task. We also test a novel set of features based on polar histograms and the vertical repositioning method for feature extraction. Finally, we report and analyze the results of several experiments using recurrent neural networks on a large public database of online handwritten math expressions. The combination of online and offline features significantly improved the recognition rate.
- Open Access
- 1 January 2014
- Published by Elsevier in Pattern Recognition Letters
- Vol. 35, 58-67
Recognition of on-line handwritten mathematical expressions using 2D stochastic context-free grammars and hidden Markov models
- 1 January 2014
- Published by Elsevier in Pattern Recognition Letters
- Vol. 35, 58-67
Open AccessRecognition of on-line handwritten mathematical expressions using 2D stochastic context-free grammars and hidden Markov models
- Open Access
- 10 September 2013
- Published by Association for Computing Machinery (ACM)
- p. 123-126
A shape-based layout descriptor for classifying spatial relationships in handwritten math
- 10 September 2013
- Published by Association for Computing Machinery (ACM)
- p. 123-126
Open AccessA shape-based layout descriptor for classifying spatial relationships in handwritten math
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1012-1016
Classification of On-Line Mathematical Symbols with Hybrid Features and Recurrent Neural Networks
Recognition of on-line handwritten mathematical symbols has been tackled using different methods, but the recognition rates achieved until now still leave room for improvement. Many of the published approaches are based on hidden Markov models, and some of them use off-line information extracted from the on-line data. In this paper, we present a set of hybrid features that combine both on-line and off-line information. Lately, recurrent neural networks have demonstrated to obtain good results and they have outperformed hidden Markov models in several sequence learning tasks, including handwritten text recognition. Hence, we also studied a state-of-the-art recurrent neural network classifier and we compared its performance with a classifier based on hidden Markov models. Experiments using a large public database showed that both the new proposed features and recurrent neural network classifier improved significantly the classification results.
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1012-1016
Classification of On-Line Mathematical Symbols with Hybrid Features and Recurrent Neural Networks
Recognition of on-line handwritten mathematical symbols has been tackled using different methods, but the recognition rates achieved until now still leave room for improvement. Many of the published approaches are based on hidden Markov models, and some of them use off-line information extracted from the on-line data. In this paper, we present a set of hybrid features that combine both on-line and off-line information. Lately, recurrent neural networks have demonstrated to obtain good results and they have outperformed hidden Markov models in several sequence learning tasks, including handwritten text recognition. Hence, we also studied a state-of-the-art recurrent neural network classifier and we compared its performance with a classifier based on hidden Markov models. Experiments using a large public database showed that both the new proposed features and recurrent neural network classifier improved significantly the classification results.
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 682-690
An Image-Based Measure for Evaluation of Mathematical Expression Recognition
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 682-690
An Image-Based Measure for Evaluation of Mathematical Expression Recognition
- 1 January 2013
- Published by Springer Nature
- p. 133-140
Page Segmentation of Structured Documents Using 2D Stochastic Context-Free Grammars
- 1 January 2013
- Published by Springer Nature
- p. 133-140
Page Segmentation of Structured Documents Using 2D Stochastic Context-Free Grammars