Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digitalizing Scheme of Handwritten Hanja Historical Documents
DIAL '04 Proceedings of the First International Workshop on Document Image Analysis for Libraries (DIAL'04)
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Exact indexing of dynamic time warping
Knowledge and Information Systems
Efficient Shape Matching Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Word matching using single closed contours for indexing handwritten historical documents
International Journal on Document Analysis and Recognition
Word spotting for historical documents
International Journal on Document Analysis and Recognition
International Journal on Document Analysis and Recognition
Skeleton-Based Recognition of Chinese Calligraphic Character Image
PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Combining Slanted-Frame Classifiers for Improved HMM-Based Arabic Handwriting Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Off-line handwritten word recognition using multi-stream hidden Markov models
Pattern Recognition Letters
Retrieval of chinese calligraphic character image
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part I
Hi-index | 0.10 |
Historical Chinese calligraphy is now being scanned by ongoing project of Universal Digital Library to enable universal access. 483 Calligraphic page images are segmented into 13,351 individual characters, followed by character feature extraction. When an image query submits, a short list of candidates from the database is selected according to simple features of stroke transect. Then the selected candidates are ranked by shape matching using two-dimensional Dynamic Time Warping (DTW). After that, similar calligraphic characters are retrieved and ranked, then the query is recognized as the label of the most similar retrieved characters.