The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein (1989) proposed to use an adaptive threshold surface, determined by interpolation of the image gray levels at points where the image gradient is high. The rationale is that a high image gradient indicates probable object edges, and there the image values are between the object and background gray levels. The threshold surface was determined by successive overrelaxation as the solution of the Laplace equation. This work proposes a different method to determine an adaptive threshold surface. In this new method, inspired by multiresolution approximation, the threshold surface is constructed with considerably lower computational complexity and is smooth, yielding faster image binarizations and better visual performance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient computation of adaptive threshold surfaces for image binarization


    Contributors:
    Blayvas, I. (author) / Bruckstein, A. (author) / Kimmel, R. (author)


    Publication date :

    2001-01-01


    Size :

    638031 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Efficient Computation of Adaptive Threshold Surfaces for Image Binarization

    Blayvas, I. / Bruckstein, A. / Kimmel, R. et al. | British Library Conference Proceedings | 2001


    Adaptive Choice of Global Threshold for Binarization of Gradient Images

    Miroshnichenko, S. Y. / Degtyarev, S. V. / Rukavitsin, Y. A. | British Library Online Contents | 2005


    Improved Adaptive Fingerprint Binarization

    Bartunek, Josef Ström / Nilsson, Mikael / Nordberg, Jörgen et al. | IEEE | 2008


    Document image cleanup and binarization

    Wu, Victor / Manmatha, Raghaven | SPIE | 1998