CVJan 25, 2012

A New Local Adaptive Thresholding Technique in Binarization

arXiv:1201.5227v1301 citations
Originality Synthesis-oriented
AI Analysis

This is an incremental improvement for document image processing, addressing computational efficiency in local thresholding.

The paper tackles binarization of degraded document images with background noise and illumination variations by proposing a locally adaptive thresholding technique that uses local mean and mean deviation, achieving faster processing times compared to other local thresholding methods.

Image binarization is the process of separation of pixel values into two groups, white as background and black as foreground. Thresholding plays a major in binarization of images. Thresholding can be categorized into global thresholding and local thresholding. In images with uniform contrast distribution of background and foreground like document images, global thresholding is more appropriate. In degraded document images, where considerable background noise or variation in contrast and illumination exists, there exists many pixels that cannot be easily classified as foreground or background. In such cases, binarization with local thresholding is more appropriate. This paper describes a locally adaptive thresholding technique that removes background by using local mean and mean deviation. Normally the local mean computational time depends on the window size. Our technique uses integral sum image as a prior processing to calculate local mean. It does not involve calculations of standard deviations as in other local adaptive techniques. This along with the fact that calculations of mean is independent of window size speed up the process as compared to other local thresholding techniques.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes