Finding Significant Points for a Handwritten Classification Task
暂无分享,去创建一个
[1] Allen Gersho,et al. Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.
[2] Mikel L. Forcada,et al. A note on the Nagendraprasad-Wang-Gupta thinning algorithm , 1995, Pattern Recognit. Lett..
[3] Xiaolin Li,et al. On-line handwritten alphanumeric character recognition using dominant points in strokes , 1997, Pattern Recognit..
[4] Michael McGill,et al. Introduction to Modern Information Retrieval , 1983 .
[5] Juan Ramón Rico-Juan,et al. Some Results about the Use of Tree/String Edit Distances in a~Nearest Neighbour Classification Task , 2003, IbPRIA.
[6] Rico-JuanJuan Ramón,et al. Comparison of AESA and LAESA search algorithms using string and tree-edit-distances , 2003 .
[7] Sanghamitra Roy,et al. Hierarchical representation of digitized curves through dominant point detection , 2003, Pattern Recognit. Lett..
[8] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[9] Robert Tibshirani,et al. Classification by Pairwise Coupling , 1997, NIPS.
[10] L. Ruan,et al. X X X X X X X X X X X X X X X X X X X Evaluation of Tsunami Risk in the Great Lakes: Urban Planning and Outreach , 2006 .
[11] Juan Ramón Rico-Juan,et al. Comparison of AESA and LAESA search algorithms using string and tree-edit-distances , 2003, Pattern Recognit. Lett..
[12] Kaizhong Zhang,et al. Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..
[13] Michael G. Strintzis,et al. Use of depth and colour eigenfaces for face recognition , 2003, Pattern Recognit. Lett..
[14] José Manuel Iñesta Quereda,et al. Reliable polygonal approximations of imaged real objects through dominant point detection , 1998, Pattern Recognit..