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