印刷古尔穆克文字中水平重叠线的分割

M. Jindal, R.K. Sharma, G. Lehal
{"title":"印刷古尔穆克文字中水平重叠线的分割","authors":"M. Jindal, R.K. Sharma, G. Lehal","doi":"10.1109/ADCOM.2006.4289888","DOIUrl":null,"url":null,"abstract":"Multiple horizontally overlapping lines are normally found in printed newspapers of almost every language due to high compression methods used for printing of the newspapers. For any optical character recognition (OCR) system, presence of horizontally overlapping lines decreases the recognition accuracy drastically. In this paper, we have proposed a solution for segmenting horizontally overlapping lines. Whole document has been divided into strips and proposed algorithm has been applied for segmenting horizontally overlapping lines and associating small strips to their respective lines. The results reveal that the algorithm is almost 99% perfect when applied to the Gurmukhi script.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Segmentation of Horizontally Overlapping lines in Printed Gurmukhi Script\",\"authors\":\"M. Jindal, R.K. Sharma, G. Lehal\",\"doi\":\"10.1109/ADCOM.2006.4289888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple horizontally overlapping lines are normally found in printed newspapers of almost every language due to high compression methods used for printing of the newspapers. For any optical character recognition (OCR) system, presence of horizontally overlapping lines decreases the recognition accuracy drastically. In this paper, we have proposed a solution for segmenting horizontally overlapping lines. Whole document has been divided into strips and proposed algorithm has been applied for segmenting horizontally overlapping lines and associating small strips to their respective lines. The results reveal that the algorithm is almost 99% perfect when applied to the Gurmukhi script.\",\"PeriodicalId\":296627,\"journal\":{\"name\":\"2006 International Conference on Advanced Computing and Communications\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Advanced Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADCOM.2006.4289888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Advanced Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2006.4289888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

由于报纸印刷采用了高度压缩的方法,因此在几乎所有语言的印刷报纸中,通常都会发现多条水平重叠的线条。对于任何光学字符识别(OCR)系统,存在水平重叠的线条会大大降低识别精度。在本文中,我们提出了一个分割水平重叠线的解决方案。将整个文档划分为条带,并应用该算法对水平重叠的线进行分割,并将小条带与各自的线相关联。结果表明,该算法应用于古穆克文字时,准确率接近99%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Segmentation of Horizontally Overlapping lines in Printed Gurmukhi Script
Multiple horizontally overlapping lines are normally found in printed newspapers of almost every language due to high compression methods used for printing of the newspapers. For any optical character recognition (OCR) system, presence of horizontally overlapping lines decreases the recognition accuracy drastically. In this paper, we have proposed a solution for segmenting horizontally overlapping lines. Whole document has been divided into strips and proposed algorithm has been applied for segmenting horizontally overlapping lines and associating small strips to their respective lines. The results reveal that the algorithm is almost 99% perfect when applied to the Gurmukhi script.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信