| 基于混合距离树的海量书法字索引 |
| |
| 引用本文： | 庄毅,庄越挺,吴飞. 基于混合距离树的海量书法字索引[J]. 计算机辅助设计与图形学学报, 2007, 19(2): 233-239 |
| |
| 作者姓名： | 庄毅 庄越挺 吴飞 |
| |
| 作者单位： | 浙江大学计算机科学与技术学院,杭州,310027;浙江大学计算机科学与技术学院,杭州,310027;浙江大学计算机科学与技术学院,杭州,310027 |
| |
| 基金项目： | 国家自然科学基金 , 国家自然科学基金 , 高等学校中英文图书数字化国际合作计划 |
| |
| 摘 要： | 提出一种基于混合距离树的高维书法字索引方法以加速检索.首先将n个书法字通过层次聚类聚成若干类,然后分别计算每个字对应的统一化始点距离和质心距离,最后将两者结合生成索引键值.给定一个查询字,借助混合距离树索引完成高维书法字的查询.实验证明,该方法能够取得较高的查询效率,特别适合海量书法字检索.
|
| 关 键 词： | 书法字检索 高维索引 质心距离 |
| 收稿时间： | 2006-03-07 |
| 修稿时间： | 2006-03-072006-11-13 |
A Hybrid-Distance-Tree-Based Index for Large Chinese Calligraphic Characters Database |
| |
| Zhuang Yi,Zhuang Yueting,Wu Fei. A Hybrid-Distance-Tree-Based Index for Large Chinese Calligraphic Characters Database[J]. Journal of Computer-Aided Design & Computer Graphics, 2007, 19(2): 233-239 |
| |
| Authors: | Zhuang Yi Zhuang Yueting Wu Fei |
| |
| Affiliation: | College of Computer Science and Technology, Zhejiang University, Hangzhou 310027 |
| |
| Abstract: | The paper proposes a hybrid-distance-tree(HD-Tree)-based high-dimensional indexing method which is to facilitate and speedup the Chinese calligraphic characters retrieval. Two steps are made in HD-Tree, first for every character in high-dimensional space are grouped into T clusters using hierarchy-based cluster algorithm, then the uniform start distance and centroid distance of every characters are pre-calculated and indexed by a partition-based B -tree. Comprehensive experiments are conducted to indicate the efficiency of our approach which is especially suitable for the retrieval for the large Chinese calligraphic characters database. |
| |
| Keywords: | Chinese calligraphy character retrieval high-dimensional indexing centroid distance |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
