检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京工业大学计算机学院,北京100022 [2]内蒙古师范大学计算机与信息工程学院,呼和浩特010022 [3]北京语言大学信息科学学院,北京100083
出 处:《计算机辅助设计与图形学学报》2009年第9期1298-1306,共9页Journal of Computer-Aided Design & Computer Graphics
基 金:国家自然科学基金(60863007;60872121)
摘 要:由于目前计算机缺乏对汉字字形统一有效的形式化描述和比对计算方法,致使无法描画输入所需的各种可能汉字,也无法利用计算机对字形进行比对分析.提出一种具有颗粒度适当、无歧义、规范化基元,能描述各种可能字形(包括错字、古籍异体字、拼合字)骨架异同的笔段网格汉字字形描述方法;并基于该方法给出了字形比对算法,它能自动提取字形包含的简单笔画和复合笔画,根据字形的不同自适应地选取复合笔画或简单笔画,并以此为单位进行比对;最后将计算两字形最优配对笔画间的向量距离总和作为比对结果.实验结果表明,该方法具有很强的字形描述能力,字形比对算法对结构规范字形的比对准确率较高,可用于支持各种汉字的描画输入及面向字形比对分析的各种应用.Due to the lack of a universally applicable yet effective method of formal description and automatic comparison for Chinese character glyph, we can hardly input arbitrary Chinese characters by glyph drawing, nor can glyph comparison and analysis be realized with algorithms. A stroke-segmentmesh description of Chinese character glyph is presented. The stroke elements of a glyph are standardized, with suitable size, capable of depicting the glyph skeleton of any Chinese characters (including wrongly written characters, variant forms of characters in ancient literatures, and combined-characters). Based on this description, a glyph comparing algorithm is developed, which can automatically decompose a glyph into simple strokes and compound strokes, adaptively select either of them for comparison according to the shape of the glyph. It then calculates the sum of the vector distance of best matching strokes of the two candidate characters as the comparing results. Experimental results indicate the versatility of this description and the high accuracy of the proposed algorithm. Our new approach provides support not only to Chinese character input but also to all kinds of glyph-analysis-oriented applications.
分 类 号:TP391.12[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171