The most important step in image preprocessing for Optical Character Recognition (OCR) is binarization. Due to the complex background or varying light in the text image, binarization is a very difficult problem. This paper presents the improved binarization algorithm. The algorithm can be divided into several steps. First, the background approximation can be obtained by the polynomial fitting, and the text is sharpened by using bilateral filter. Second, the image contrast compensation is done to reduce the impact of light and improve contrast of the original image. Third, the first derivative of the pixels in the compensated image are calculated to get the average value of the threshold, then the edge detection is obtained. Fourth, the stroke width of the text is estimated through a measuring of distance between edge pixels. The final stroke width is determined by choosing the most frequent distance in the histogram. Fifth, according to the value of the final stroke width, the window size is calculated, then a local threshold estimation approach can begin to binaries the image. Finally, the small noise is removed based on the morphological operators. The experimental result shows that the proposed method can effectively remove the noise caused by complex background and varying light.
[1]
N. Otsu.
A threshold selection method from gray level histograms
,
1979
.
[2]
Bahadir K. Gunturk.
Fast bilateral filter with arbitrary range and domain kernels
,
2010,
ICIP.
[3]
Shijian Lu,et al.
Document image binarization using background estimation and stroke edges
,
2010,
International Journal on Document Analysis and Recognition (IJDAR).
[4]
Ioannis Pratikakis,et al.
ICFHR 2012 Competition on Handwritten Document Image Binarization (H-DIBCO 2012)
,
2012,
2012 International Conference on Frontiers in Handwriting Recognition.
[5]
Nabendu Chaki,et al.
A new image binarization method using iterative partitioning
,
2012,
Machine Vision and Applications.
[6]
Josef Kittler,et al.
Minimum error thresholding
,
1986,
Pattern Recognit..