DOE OSTI · 1454974
A faster-converging algorithm for image segmentation with a modified Chan-Vese model
Abstract
We propose an algorithm for segmentation of grayscale images. Our algorithm computes a solution to the convex, unconstrained minimization problem proposed by T. Chan., S. Esedoglu, and M. Nikolova in [1], which is closely related to the Chan-Vese level set algorithm for the Mumford-Shah segmentation model. Up to now this problem has been solved with a gradient descent method. Our approach is a quasi-Newton method based on the lagged diffusivity algorithm [2] for minimizing the total-variation functional for image denoising [3]. Our results show that our algorithm requires a much smaller number of iterations and less time to converge than gradient descent, and is able to segment noisy images correctly.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Chartrand, Rick, Staneva, Valentina. 2007-11-27. A faster-converging algorithm for image segmentation with a modified Chan-Vese model. https://doi.org/10.2172/1454974. https://searchnasa.com/record/osti%3A1454974/a-faster-converging-algorithm-for-image-segmentation-with-a-modified-chan-vese-model
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.