By Topic

An OCR-character segmentation using Routing based fast replacement paths in Reach Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Muralikrishna ; Andhra University, Visakhapatnam, 530 003, INDIA ; D. V. R. Koti Reddy

An Optical Character Recognition (OCR) system with high recognition rate is challenging to develop. One of the major contributors to OCR errors is smeared characters. Several factors lead to the smearing of characters such as bad scanning and a poor binarization technique. Typical approaches to character segmentation falls into three major categories: image-based, recognition-based and holistic-based. Among these approaches, the segmentation path can be linear or non-linear. Our paper proposes a non-linear approach to segment the characters on grayscale document images. Our method first determines whether characters are smeared together using general character features. The correct segmentation path is found using a Routing based Reach Algorithm. The replacement paths in the Algorithm make Robust and speedup the Reach Algorithm. This method corrects most of errors produced by segmentation process. We achieved a segmentation accuracy of 97% with less computation time over a set of about 4,000 smeared characters. This approach is useful in real-time applications for robust OCR with smeared character detection and provides accurate character recognition with less computation time under various recognition scenarios.

Published in:

Image Information Processing (ICIIP), 2011 International Conference on

Date of Conference:

3-5 Nov. 2011