从结扎到字符:一种基于形状的手写分割算法

C. Stefano, A. Marcelli
{"title":"从结扎到字符:一种基于形状的手写分割算法","authors":"C. Stefano, A. Marcelli","doi":"10.1109/IWFHR.2002.1030955","DOIUrl":null,"url":null,"abstract":"This paper presents a method for locating the points where most likely joints between successive characters within a word occur. The proposed method, whose basic assumptions follow from handwriting generation studies, relies upon a set of morphological criteria applied to both the ligatures and the terminal regions of successive characters in order to decide the most appropriate position for the segmentation points. It does not exploit any temporal information, but rather it manipulates shape information, thus is suitable for both online and off-line handwriting processing. An experimental procedure, adopted to quantitatively evaluate the performance of the proposed algorithm without using any classification method, is also introduced.","PeriodicalId":114017,"journal":{"name":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"From ligatures to characters: a shape-based algorithm for handwriting segmentation\",\"authors\":\"C. Stefano, A. Marcelli\",\"doi\":\"10.1109/IWFHR.2002.1030955\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method for locating the points where most likely joints between successive characters within a word occur. The proposed method, whose basic assumptions follow from handwriting generation studies, relies upon a set of morphological criteria applied to both the ligatures and the terminal regions of successive characters in order to decide the most appropriate position for the segmentation points. It does not exploit any temporal information, but rather it manipulates shape information, thus is suitable for both online and off-line handwriting processing. An experimental procedure, adopted to quantitatively evaluate the performance of the proposed algorithm without using any classification method, is also introduced.\",\"PeriodicalId\":114017,\"journal\":{\"name\":\"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWFHR.2002.1030955\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWFHR.2002.1030955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文提出了一种定位单词中连续字符之间最有可能出现连接点的方法。所提出的方法,其基本假设遵循笔迹生成研究,依赖于一套形态学标准,适用于连续字符的结扎和终端区域,以确定最合适的切分点位置。它不利用任何时间信息,而是利用形状信息,因此适合在线和离线手写处理。本文还介绍了一个实验程序,在不使用任何分类方法的情况下,对所提出的算法的性能进行了定量评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
From ligatures to characters: a shape-based algorithm for handwriting segmentation
This paper presents a method for locating the points where most likely joints between successive characters within a word occur. The proposed method, whose basic assumptions follow from handwriting generation studies, relies upon a set of morphological criteria applied to both the ligatures and the terminal regions of successive characters in order to decide the most appropriate position for the segmentation points. It does not exploit any temporal information, but rather it manipulates shape information, thus is suitable for both online and off-line handwriting processing. An experimental procedure, adopted to quantitatively evaluate the performance of the proposed algorithm without using any classification method, is also introduced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信