A Fast Algorithm for Image Segmentation Based on Global Cosine Fitting Energy Model

Abstract

Image segmentation plays an important role in computer vision and image processing. Level set model is a classical image segmentation method. During level set evolution, almost all the level set energy minimization of image segmentation are based on the gradient descent method and the finite difference scheme. The speed of evolution is slow and easy to fall into local minima. In this paper, we propose a fast sweeping optimization algorithm to minimize global cosine fitting (GCF) model. When moving a pixel from the one side region to the another side region of evolving contour, the sweeping algorithm calculates the energy change directly and checks whether the cosine fitting energy is decreased. With this, we can avoid solving the Euler-Lagrange equation and the partial differential equation, which usually take a lot of time. Moreover, our proposal is robust to initial level set contour and it automatically handles the topological variety, algorithm automatic termination and no longer requires the reinitialization step, parameter adjustment and the distance regularization term. The experiments on real noise and synthetic images show the effectiveness of the sweeping algorithm.