Segmentation of Horizontally Overlapping lines in Printed Gurmukhi Script

M. Jindal, R.K. Sharma, G. Lehal
{"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}
引用次数: 13

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
印刷古尔穆克文字中水平重叠线的分割
由于报纸印刷采用了高度压缩的方法,因此在几乎所有语言的印刷报纸中,通常都会发现多条水平重叠的线条。对于任何光学字符识别(OCR)系统,存在水平重叠的线条会大大降低识别精度。在本文中,我们提出了一个分割水平重叠线的解决方案。将整个文档划分为条带,并应用该算法对水平重叠的线进行分割,并将小条带与各自的线相关联。结果表明,该算法应用于古穆克文字时,准确率接近99%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message Integrity in the World Wide Web: Use of Nested Hash Function and a Fast Stream Cipher Feature Extraction Learning for Stereovision Based Robot Navigation System Semantics for a Distributed Programming Language Using SACS and Weakest Pre-Conditions On Evaluating Obfuscatory Strength of Alias-based Transforms using Static Analysis A Multi-Algorithmic Face Recognition System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1