A fast algorithm for three-Dimensional Otsu’s Thresholding method

While performing well in segmenting on images with low SNR and low contrast, the three-Dimensional Otsupsilas threshold algorithm has the disadvantage of high computational complexity. By removing the redundant computation and computing look-up table with iteration, this paper improves the complexity greatly and gives a fast algorithm for the three-Dimensional Otsupsilas threshold algorithm. experimental results show that the algorithm reduces calculation time substantially with no quality loss in the threshold compared with the original algorithm.