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.