Abstract
AbstractImage segmentation plays a pivotal role in image processing. Level set model is a traditional variation image segmentation method. In order to achieve level set evolution equation, the level set energy functionals are minimized with the gradient descent methods and then the partial differential equation (PDE) was solved by finite difference scheme. Slow speed is one of its disadvantages. We propose a sweep optimization algorithm based on global cosine fitting (GCF) energy. Instead of calculating the PDE and the curvature, the proposed sweeping algorithm directly calculates the energy change when a pixel moves from one side of evolving contour to the other. It checks whether the GCF energy is decreased or not. The proposed algorithm has many advantages. For example, independent of initial level set contour positions and parameters, need not consider the Courant Friedrichs Lew condition and the regularization energy term. The proposed algorithm can be easily extended to high dimension image segmentation. The experiments on synthetic images, noise images and real images demonstrate the effectiveness of the proposed sweeping optimization algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
