A Simple Fast Algorithm for Minimization of the Elastica Energy Combining Binary and Level Set Representations
Year: 2017
International Journal of Numerical Analysis and Modeling, Vol. 14 (2017), Iss. 6 : pp. 809–821
Abstract
For curves or general interfaces, Euler’s elastica energy has a wide range of applications in computer vision and image processing. It is however difficult to minimize the functionals related to the elastica energy due to its non-convexity, nonlinearity and higher order with derivatives. In this paper, we propose a very simple way to combine level set and binary representations for interfaces and then use a fast algorithm to minimize the functionals involving the elastica energy. The proposed algorithm essentially just needs to solve a total variation type minimization problem and a re-distance problem. Nowadays, there are many fast algorithms to solve these two problems and thus the overall efficiency of the proposed algorithm is very high. We then apply the new Euler’s elastica minimization algorithm to image segmentation, image inpainting and illusory shape reconstruction problems. Extensive experimental results are finally conducted to validate the effectiveness of the proposed algorithm.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2017-IJNAM-10481
International Journal of Numerical Analysis and Modeling, Vol. 14 (2017), Iss. 6 : pp. 809–821
Published online: 2017-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 13
Keywords: Euler's elastica energy image segmentation image inpainting illusory shape corner fusion level set method binary level set method fast sweeping.