Fast Binarization with Chebyshev Inequality

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

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 filter which uses the Chebyshev inequality in the segmentation of objects and background. Our result shows that the Chebyshev filter is not only e.ective, but also simple, robust and easy to implement. Because of its simplicity, our method is su.ciently e.cient 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.

Original languageEnglish
Title of host publicationDocEng 2017 - Proceedings of the 2017 ACM Symposium on Document Engineering
PublisherAssociation for Computing Machinery, Inc
Pages113-116
Number of pages4
ISBN (Electronic)9781450346894
DOIs
Publication statusPublished - 31 Aug 2017
Event17th ACM Symposium on Document Engineering, DocEng 2017 - Valletta, Malta
Duration: 4 Sept 20177 Sept 2017

Publication series

NameDocEng 2017 - Proceedings of the 2017 ACM Symposium on Document Engineering

Conference

Conference17th ACM Symposium on Document Engineering, DocEng 2017
Country/TerritoryMalta
CityValletta
Period4/09/177/09/17

Keywords

  • Binarization
  • Chebyshev Inequality
  • Handwritten Document
  • Segmentation
  • Thresholding

Fingerprint

Dive into the research topics of 'Fast Binarization with Chebyshev Inequality'. Together they form a unique fingerprint.

Cite this