2016/2017
Fast Binarization with Chebyshev Inequality
DocEng 2017 - Proceedings of the 2017 ACM Symposium on Document Engineering, 2017:113-116
Author(s) | Ka-Hou Chan (ESAP)/
Sio-Kei Im (CG)/ Wei Ke (ESAP) |
---|---|
Summary | In order to enhance the binarization result of degraded document images with smudged and bleed-through background, we present a fast binarization technique that applies the Chebyshev theory in the image preprocessing. We introduce the Chebyshev lter which uses the Chebyshev inequality in the segmentation of objects and background. Our result shows that the Chebyshev lter is not only eective, but also simple, robust and easy to implement. Because of its simplicity, our method is suciently ecient to process live image sequences in real-time. We have implemented and compared with the Document Image Binarization Contest datasets (H-DIBCO 2014) for testing and evaluation. e experimental outcomes have demonstrated that this method achieved good result in this literature. |