Finding Significant Points for a Handwritten Classification Task

1. Gersho, A., Gray, R.M.: Vector quantization and signal compression. Kluwer Academic Publishers, Dordrecht (1991)

   Google Scholar 

2. Hastie, T., Tibshirani, R.: Classification by pairwise coupling. Technical report, Stanford University and University of Toronto (1996)

   Google Scholar 

3. Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval. McGraw Hill, NewYork (1983)

   MATH  Google Scholar 

4. Li, X., Yeung, D.: On-line handwritten alphanumeric character recognition using dominant points in strokes. Pattern Recognition 30, 31–34 (1997)

   Article  Google Scholar 

5. Iñesta, J.M., Mateo, B., Sarti, M.A.: Reliable polygonal approximations of imaged read objects though dominant point detection. Pattern Recognition 31, 685–697 (1998)

   Article  Google Scholar 

6. Rico-Juan, J.R., Micó, L.: Comparison of AESA and LAESA search algorithms using string and tree edit distances. Pattern Recognition Letters 24(9), 1427–1436 (2003)

   Article  Google Scholar 

7. Sarkar, B., Roy, S., Sarkar, D.: Hierarchical representation of digitized curves though dominant point detection. Pattern Recognition Letters 24, 2869–2882 (2003)

   Article  MATH  Google Scholar 

8. Rico-Juan, J.R., Micó, L.: Some results about the use of tree/string edit distances in a nearest neighbour classification task. In: Perales, F.J., Campilho, A.C., Pérez, N., Sanfeliu, A. (eds.) IbPRIA 2003. LNCS, vol. 2652, pp. 821–828. Springer, Heidelberg (2003)

   Chapter  Google Scholar 

9. Rico-Juan, J.R.: Off-line cursive handwrittenword recognition based on tree extraction and an optimized classification distance. In: Torres, M.I., Sanfeliu, A. (eds.) Pattern Recognition and Image Analysis: Proceedings of the VII Symposium Nacional de Reconocimiento de Formas y Análisis de Imágenes, Bilbao, Spain, May 1999, vol. 3, pp. 15–16 (1999)

   Google Scholar 

10. Carrasco, R.C., Forcada, M.L.: A note on the Nagendraprasad-Wang-Gupta thinning algorithm. Pattern Recognition Letters 16, 539–541 (1995)

    Article  MATH  Google Scholar 

11. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing 18, 1245–1262 (1989)

    Article  MATH  MathSciNet  Google Scholar 

12. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21, 168–173 (1974)

    Article  MATH  MathSciNet  Google Scholar 

Download references