期刊文献+

Efficient shape matching for Chinese calligraphic character retrieval 被引量:1

Efficient shape matching for Chinese calligraphic character retrieval
原文传递
导出
摘要 An efficient search method is desired for calligraphic characters due to the explosive growth of calligraphy works in digital libraries. However, traditional optical character recognition (OCR) and handwritten character recognition (HCR) technologies are not suitable for calligraphic character retrieval. In this paper, a novel shape descriptor called SC-HoG is proposed by integrating global and local features for more discriminability, where a gradient descent algorithm is used to learn the optimal combining parameter. Then two efficient methods, keypoint-based method and locality sensitive hashing (LSH) based method, are proposed to accelerate the retrieval by reducing the feature set and converting the feature set to a feature vector. Finally, a re-ranking method is described for practicability. The approach filters query-dissimilar characters using the LSH-based method to obtain candidates first, and then re-ranks the candidates using the keypointor sample-based method. Experimental results demonstrate that our approaches are effective and efficient for calligraphic character retrieval. An efficient search method is desired for calligraphic characters due to the explosive growth of calligraphy works in digital libraries. However, traditional optical character recognition (OCR) and handwritten character recognition (HCR) technologies are not suitable for calligraphic character retrieval. In this paper, a novel shape descriptor called SC-HoG is proposed by integrating global and local features for more discriminability, where a gradient descent algorithm is used to learn the optimal combining parameter. Then two efficient methods, keypoint-based method and locality sensitive hashing (LSH) based method, are proposed to accelerate the retrieval by reducing the feature set and converting the feature set to a feature vector. Finally, a re-ranking method is described for practicability. The approach filters query-dissimilar characters using the LSH-based method to obtain candidates first, and then re-ranks the candidates using the keypoint- or sample-based method. Experimental results demonstrate that our approaches are effective and efficient for calligraphic character retrieval.
出处 《Journal of Zhejiang University-Science C(Computers and Electronics)》 SCIE EI 2011年第11期873-884,共12页 浙江大学学报C辑(计算机与电子(英文版)
基金 supported by the National Natural Science Foundation of China (Nos. 60673088, 61070066, and 61103099) the China Postdoctoral Science Foundation (No. 20110491781) the Major National Science and Technology Special Project of China(No. 2010ZX01042-002-003) the China Academic Digital Associative Library Project
  • 相关文献

参考文献1

共引文献6

同被引文献21

引证文献1

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部