This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 1
Efficient Computation of Adaptive Threshold Surfaces for Image Binarization
Kauai, Hawaii
December 08-December 14
ISBN: 0-7695-1272-0
Ilya Blayvas, Technion Institute of Technology
Alfred Bruckstein, Technion Institute of Technology
Ron Kimmel, Technion Institute of Technology
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive threshold surface, determined by interpolation of the image gray levels at points where the image gradient is high. The rationale is that high image gradient indicates probable object edges, and there the image values are between the object and the background gray levels. The threshold surface was determined by successive over-relaxation 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.
Citation:
Ilya Blayvas, Alfred Bruckstein, Ron Kimmel, "Efficient Computation of Adaptive Threshold Surfaces for Image Binarization," cvpr, vol. 1, pp.737, 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 1, 2001
Usage of this product signifies your acceptance of the Terms of Use.