DocumentCode :
2347470
Title :
Efficient computation of adaptive threshold surfaces for image binarization
Author :
Blayvas, Ilya ; Bruckstein, Alfred ; Kimmel, Ron
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
Volume :
1
fYear :
2001
fDate :
2001
Abstract :
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.
Keywords :
Laplace equations; adaptive signal processing; computational complexity; image resolution; image segmentation; interpolation; Laplace equation; adaptive threshold surface; background gray levels; computational complexity; gray level image binarization; image gradient; interpolation; multiresolution approximation; nonuniform illumination; object edges; object gray levels; successive overrelaxation; Computational complexity; Computer science; Degradation; Interpolation; Laplace equations; Lighting; Pixel; Relaxation methods; Surface waves;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition, 2001. CVPR 2001. Proceedings of the 2001 IEEE Computer Society Conference on
ISSN :
1063-6919
Print_ISBN :
0-7695-1272-0
Type :
conf
DOI :
10.1109/CVPR.2001.990549
Filename :
990549
Link To Document :
بازگشت