Graph Cut-Based Binarisation of Noisy Check Images
Criminal Justice, Forensic Science, and Security
Binarisation of document images with poor contrast, strong noise, complex patterns and variable modalities in the greyscale histograms is a challenging problem. This study proposes an algorithm for the binarisation of noisy check images to extract handwriting text using normalised graph cuts (GCs). The proposed algorithm uses a normalised GC measure as a thresholding principle to distinguish the handwriting characters from the noisy background. The authors propose a factor to penalise extracting objects that do not have the elongated shape of the characters. Improving the structural quality of the characters' skeleton facilitates better feature extraction and classification, which improves the overall performance of optical character recognition (OCR). Experimental results performed on 560 check images showed significant improvements in OCR recognition rates compared to other well-established segmentation algorithms.
IET Image Processing
(2012). Graph Cut-Based Binarisation of Noisy Check Images. IET Image Processing, 6(9), 1256-1261.
Available at: https://aquila.usm.edu/fac_pubs/7735