http://people.idsia.ch/~juergen/handwriting.html

https://tel.archives-ouvertes.fr/tel-01249405/document Deep Neural Networks for Large Vocabulary Handwritten Text Recognition

http://pkmital.com/home/2015/02/06/handwriting-recognition-with-lstms-and-ofxcaffe/

http://human.ait.kyushu-u.ac.jp/publications/ICDAR2015-Frinken.pdf

http://www.rsipvision.com/deep-learning-for-ocr/

Jaderberg, Max, Andrea Vedaldi, and Andrew Zisserman. “Deep features for text spotting.” Computer Vision–ECCV 2014. Springer International Publishing, 2014. 512-528.

Cireşan, Dan C., et al. “Handwritten digit recognition with a committee of deep neural nets on gpus.” arXiv preprint arXiv:1103.4487 (2011).

Jaderberg, Max, et al. “Synthetic data and artificial neural networks for natural scene text recognition.” arXiv preprint arXiv:1406.2227 (2014).

Cireşan, Dan C., Ueli Meier, and Jürgen Schmidhuber. “Transfer learning for Latin and Chinese characters with deep neural networks.” Neural Networks (IJCNN), The 2012 International Joint Conference on. IEEE, 2012.

Achanta, Rakesh, and Trevor Hastie. “Telugu OCR Framework using Deep Learning.” arXiv preprint arXiv:1509.05962 (2015).

http://www.fki.inf.unibe.ch/databases/iam-on-line-handwriting-database

http://distill.pub/2016/handwriting/

https://github.com/hardmaru/write-rnn-tensorflow

https://github.com/codeaudit/sketch-rnn

http://www.cedar.buffalo.edu/handwriting/HRdatabase.html

https://srdata.nist.gov/gateway/gateway?keyword=handwriting+recognition

http://www.gavo.t.u-tokyo.ac.jp/~qiao/database.html

https://github.com/jan-auer/rnnlib-iam

http://www.ee.surrey.ac.uk/CVSSP/demos/chars74k/

https://arxiv.org/pdf/1709.06389v1.pdf A General Framework for the Recognition of Online Handwritten Graphics

We model a graphic as a labeled graph generated from a graph grammar. Non-terminal vertices represent subcomponents, terminal vertices represent symbols, and edges represent relations between subcomponents or symbols. We then model the recognition problem as a graph parsing problem: given an input stroke set, we search for a parse tree that represents the best interpretation of the input. Our graph parsing algorithm generates multiple interpretations (consistent with the grammar) and then we extract an optimal interpretation according to a cost function that takes into consideration the likelihood scores of symbols and structures. The parsing algorithm consists in recursively partitioning the stroke set according to structures defined in the grammar and it does not impose constraints present in some previous works (e.g. stroke ordering).