Abstract: Line segmentation is a critical phase of the Optical Character Recognition (OCR) which separates the individual lines from the image documents. The accuracy rate of the OCR tool is directly proportional to the line segmentation accuracy followed by the word/character segmentation. In this context, an algorithm, named height_based_segmentation is proposed for the text line segmentation of printed Odia documents. The proposed algorithm finds the average height of a text line and it helps to minimize the overlapped text line cases. The algorithm also includes post-processing steps to combine the modifier zone with the base zone. The performance of the algorithm is evaluated through the ground truth and also by comparing it with the existing segmentation approaches.

Sanjibani Sudha Pattanayak, Sateesh Kumar Pradhan and Ramesh Chandra Mallik, “An Efficient Algorithm to Find the Height of a Text Line and Overcome Overlapped and Broken Line Problem during Segmentation” International Journal of Advanced Computer Science and Applications(IJACSA), 10(12), 2019. http://dx.doi.org/10.14569/IJACSA.2019.0101271

@article{Pattanayak2019,
title = {An Efficient Algorithm to Find the Height of a Text Line and Overcome Overlapped and Broken Line Problem during Segmentation},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2019.0101271},
url = {http://dx.doi.org/10.14569/IJACSA.2019.0101271},
year = {2019},
publisher = {The Science and Information Organization},
volume = {10},
number = {12},
author = {Sanjibani Sudha Pattanayak and Sateesh Kumar Pradhan and Ramesh Chandra Mallik}
}