二维Otsu自适应阈值选取算法的快速实现

A Fast Algorithm for Two-dimensional Otsu Adaptive Threshold Algorithm

Otsu自适应阈值算法作为图像阈值分割的经典算法,在图像领域得到了广泛的应用,在此基础上发展起来的二维阈值法因为计算时间长而制约了其应用.针对一维Otsu自适应阈值算法计算复杂度高的缺点,通过消除二维自适应阈值算法中的冗余计算,用迭代的方式得到查询表,从而大大提高了二维阈值算法的计算速度.实验结果表明,该算法不仅计算时间远远小于原始二维Otsu算法,并且求得的阈值跟原始的算法一样.

As a classical image segmentation method, Otsu adaptive threshold algorithm has been applied widely in image processing. But the long-time computation limits the use of the two-dimensional Otsu threshold algorithm based on the Otsu threshold algorithm. This paper gives a fast algorithm for twodimensional Otsu adaptive threshold algorithm that overcomes the disadvantage of computational complexity. This fast algorithm gets rid of redundant computation and yields a look-up table by iteration. The experimental result has demonstrated that the computational time of the fast method is not only far less than that of the original two-dimensional one, but also yields the same threshold as that of the original method.