Abstract: The classic two-dimensional maximum entropy threshold segmentation algorithm takes a long time to compute and consumes large space to store information.To solve these problems,in this paper a fast threshold recursion method was proposed based on the standard two-dimensional maximum entropy threshold segmentation algorithm,at the same time,the threshold obtained by Sobel operator edge diction was applied to the fast threshold segmentation algorithm in order to solve the problem of the loss of details.Finally,the experiments show that this improved algorithm makes processing time reduce from O(L⁴) to O(L²) through the recursive formula.It not only reduces the complexity of the calculation,but also protects the details.

Key words: Two-dimensional maximum entropy algorithm,Fast recursive,Edge of stack,Sobel algorithm,Image segmentation