{"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}
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.