A simple fast algorithm for minimization of the elastica energy combining binary and level set representations

Xue-Cheng TAI, Jinming Duan

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)809-821
Number of pages13
JournalInternational Journal of Numerical Analysis and Modeling
Volume14
Issue number6
Publication statusPublished - 2017

Scopus Subject Areas

  • Numerical Analysis

User-Defined Keywords

  • Binary level set method
  • Corner fusion
  • Euler’s elastica energy
  • Fast sweeping
  • Illusory shape
  • Image inpainting
  • Image segmentation
  • Level set method

Fingerprint

Dive into the research topics of 'A simple fast algorithm for minimization of the elastica energy combining binary and level set representations'. Together they form a unique fingerprint.

Cite this