Abstract

In this paper, a fast algorithm for Euler’s elastica functional is proposed, in which the Euler’s elastica functional is reformulated as a constrained minimization problem. Combining the augmented Lagrangian method and operator splitting techniques, the resulting saddle-point problem is solved by a serial of subproblems. To tackle the nonlinear constraints arising in the model, a novel fixed-point-based approach is proposed so that all the subproblems either is a linear problem or has a closed-form solution. We show the good performance of our approach in terms of speed and reliability using numerous numerical examples on synthetic, real-world and medical images for image denoising, image inpainting and image zooming problems.

Full Text
Paper version not known

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 call

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.