Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/415
Full metadata record
DC FieldValueLanguage
dc.contributor.supervisorLehal, G. S.-
dc.contributor.authorVerma, Anil Kumar-
dc.date.accessioned2007-09-17T11:57:00Z-
dc.date.available2007-09-17T11:57:00Z-
dc.date.issued2007-09-17T11:57:00Z-
dc.identifier.urihttp://hdl.handle.net/123456789/415-
dc.description.abstractCharacter segmentation is an important process of optical character recognition depends very much on the success rate of segmentation. Touching characters are a major factor of error in segmentation. A lot of work has been done on segmentation for scripts like Roman (for English), Kanji (for Chinese) and Kana (for Japanese). But none of these is fully applicable to Gurmukhi script. The OCR system development for Gurmukhi script is difficult because the characters in a world are topologically connected, two or more characters in a world may have intersecting minimum bounding rectangles, presence of multi-component characters and further the presence of touching characters make it even more harder. In the proposed work, the document image captured by a flat-bad scanner is subjected to thinning (skeletonization), line segmentation, zone detection, world segmentation & character segmentation. An attempt is made to segment the touching characters in Gurmukhi script. Keywords: OCR, Gurmukhi Script, Thinning (Skeletonization), Segmentation, Touching Characters.en
dc.description.sponsorshipThapar Institute of Engineering and Technology, Department of Computer Science and Engineeringen
dc.format.extent9537271 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectSegmentationen
dc.subjectGurmukhi Scripten
dc.subjectBounding Rectanglesen
dc.titleOffline Segmentation of Machine Printed Gurmukhi Script with Emphasis on Touching Charactersen
dc.typeThesisen
Appears in Collections:Masters Theses@CSED

Files in This Item:
File Description SizeFormat 
91715.pdf9.31 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.