Multi-threshold algorithm about image segmentation based on polynomial uniform approximation

Aiming at those shortcomings of previous multi-threshold image segmentation algorithm such as large complexity and instability caused by the image histogram glitch interference,a new multi-threshold image segmentation algorithm was proposed using Bernstein polynomial to uniformly approximate histogram curve.First,according to the approximation theory of Weierstrass to construct Bernstein polynomial for the histogram curve,then more difficult peak value calculating of the histogram was reduced to the Bernstein polynomial extremal generating,that was exported easily by the first and second derivative of Bernstein polynomial function,and finally obtain the actual peak value of the image histogram by picking up these extremes and polar values and filtering through classification algorithm,and finish multi-threshold image segmentation.Experimental results show that the algorithm is insensitive for histogram glitch interference,the overall is stable,the redundant computation and time complexity are smaller,with less time and high efficiency,the approximate performance and segmentation effect are better.