A fast two-dimensional entropic thresholding algorithm

Two-dimensional thresholding method behaves well in segmenting images of low signal-to-noise ratio, but itpsilas time consuming. In this paper, a fast algorithm is proposed based on recursive formula and search strategy. Firstly, this paper represents the concept of optimal 2-D entropy function. Then proposes an undistorted fast recursion method and a distorted optimal search strategy, so the proposed method can decrease computational time largely when it provides good quality segmentation. Finally we analysis and validate the algorithm by theory and experiment.