Fast pyramidal algorithms for image thresholding

In this paper we present fast pyramidal versions of three sequential algorithms for the thresholding of images consisting of n grey levels. For each of the sequential algorithms, having complexities between O(n) time and O(n2) time, we propose a parallel version which runs in O(lg) n) time on a pyramidal machine with an n × n base.

[1]  Josef Kittler,et al.  Minimum error thresholding , 1986, Pattern Recognit..

[2]  Azriel Rosenfeld,et al.  Multiresolution image processing and analysis , 1984 .

[3]  P.K Sahoo,et al.  A survey of thresholding techniques , 1988, Comput. Vis. Graph. Image Process..

[4]  King-Sun Fu,et al.  A survey on image segmentation , 1981, Pattern Recognit..

[5]  Joan S. Weszka,et al.  A survey of threshold selection techniques , 1978 .

[6]  Russ Miller,et al.  Data Movement Techniques for the Pyramid Computer , 1987, SIAM J. Comput..

[7]  Stefano Levialdi,et al.  Pyramidal Systems for Computer Vision , 2011, NATO ASI Series.

[8]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[9]  Andrew K. C. Wong,et al.  A new method for gray-level picture thresholding using the entropy of the histogram , 1985, Comput. Vis. Graph. Image Process..