Fast Algorithm for Two-dimensional Otsu Adaptive Threshold Algorithm

As a classical image segmentation method, Otsu adaptive threshold algorithm has applied widely in image processing. The application of the two-dimensional Otsu threshold algorithm based on the Otsu threshold algorithm has been restricted for the long-paying computation. This paper gives a fast algorithm for two-dimensional Otsu adaptive threshold algorithm that overcomes the disadvantage of high computational complexity. The fast algorithm changes the two-dimensional threshold to one-dimensional threshold by using new area partition method, and enhances the computational speed of the two-dimensional Otsu algorithm. The experimental result has demonstrated that the computational time of the fast method is far less than that of the source two-dimensional one.