×

zbMATH — the first resource for mathematics

Augmented Lagrangian method for an Euler’s elastica based segmentation model that promotes convex contours. (English) Zbl 1416.94013
Summary: In this paper, we propose an image segmentation model where an \(L^1\) variant of the Euler’s elastica energy is used as boundary regularization. An interesting feature of this model lies in its preference for convex segmentation contours. However, due to the high order and non-differentiability of Euler’s elastica energy, it is nontrivial to minimize the associated functional. As in recent work on the ordinary \(L^2\)-Euler’s elastica model in imaging, we propose using an augmented Lagrangian method to tackle the minimization problem. Specifically, we design a novel augmented Lagrangian functional that deals with the mean curvature term differently than in previous works. The new treatment reduces the number of Lagrange multipliers employed, and more importantly, it helps represent the curvature more effectively and faithfully. Numerical experiments validate the efficiency of the proposed augmented Lagrangian method and also demonstrate new features of this particular segmentation model, such as shape driven and data driven properties.

MSC:
94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
65K10 Numerical optimization and variational techniques
49M05 Numerical methods based on necessary conditions
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] L. Ambrosio, A direct variational approach to a problem arising in image reconstruction,, Interfaces Free Bound, 5, 63, (2003) · Zbl 1029.49037
[2] L. Ambrosio, On a variational problem arising in image reconstruction,, Free boundary problems (Trento, 147, 17, (2004)
[3] L. Ambrosio, Approximation of functionals depending on jumps by elliptic functionals via Gamma convergence,, Comm. Pure Appl. Math. 43 (1990), 43, 999, (1990) · Zbl 0722.49020
[4] E. Bae, Graph Cuts for Curvature Based Image Denoising,, IEEE Transactions on Image Processing, 20, 1199, (2011) · Zbl 1372.94015
[5] K. Bredies, A convex, lower semicontinuous approximation of Euler’s elastica energy,, SIAM J. Math. Anal., 47, 566, (2015) · Zbl 1319.49018
[6] C. Brito-Loeza, Multigrid algorithm for high order denoising,, SIAM J. Imaging. Sciences, 3, 363, (2010) · Zbl 1205.68474
[7] V. Caselles, Geodesic active contours,, Int. J. Comput. Vision, 22, 61, (1997) · Zbl 0894.68131
[8] T. Chan, Active contours without edges,, IEEE Trans. Image Process., 10, 266, (2001) · Zbl 1039.68779
[9] T. Chan, Aspects of total variation regularized \(L^{1}\) function approximation,, SIAM J. Appl. Math., 65, 1817, (2005) · Zbl 1096.94004
[10] T. Chan, Algorithms for finding global minimizers of denoising and segmentation models,, SIAM J. Appl. Math., 66, 1632, (2006) · Zbl 1117.94002
[11] T. Chan, Euler’s elastica and curvature based inpaintings,, SIAM J. Appl. Math., 63, 564, (2002) · Zbl 1028.68185
[12] T. Chan, Level set based shape prior segmentation,, Proc. of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1164, (2005)
[13] Y. Chen, Using prior shapes in geometric active contours in a variational framework,, Int. J. Comput. Vision, 50, 315, (2002) · Zbl 1012.68787
[14] D. Cremers, Diffusion Snakes: Introducing statistical shape knowledge into the Mumford-Shah functional,, Int. J. Comput. Vision, 50, 295, (2002) · Zbl 1012.68785
[15] E. De Giorgi, Some remarks on \(Γ\)-convergence and least squares methods,, in Composite Media and Homogenization Theory, 135, (1991) · Zbl 0747.49008
[16] M. P. do Carmo, <em>Differential Geometry of Curves and Surfaces,</em>, Prentice-Hall, (1976) · Zbl 0326.53001
[17] Y. Duan, A fast augmented Lagrangian method for Euler’s elastica model,, SSVM 2011, 6667, 144, (2012)
[18] N. El-Zehiry, Fast global optimization of curvature,, Proc. of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 3257, (2010)
[19] M. Elsey, Analogue of the total variation denoising model in the context of geometry processing,, SIAM J. Multiscale Modeling and Simulation, 7, 1549, (2009) · Zbl 1185.68803
[20] S. Esedoglu, Segmentation with depth but without detecting junctions,, J. Math. Imaging and Vision., 18, 7, (2003) · Zbl 1033.68132
[21] M. Hintermüller, Functional-analytic and numerical issues in splitting methods for total variation-based image reconstruction,, Inverse Problems, 30, (2014) · Zbl 1293.94015
[22] M. Kass, Snakes: Active contour models,, Int. J. Comput. Vision, 1, 321, (1988)
[23] M. Leventon, Statistical shape influence in geodesic active contours,, Proc. of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 316, (2000)
[24] P. L. Lions, Splitting algorithms for the sume of two nonlinear opertors,, SIAM J. Numer. Amal., 16, 964, (1979) · Zbl 0426.65050
[25] R. March, A variational method for the recovery of smooth boundaries,, Image and Vision Computing, 15, 705, (1997)
[26] S. Masnou, Disocclusion: A variational approach using level lines,, IEEE Trans. Image Process., 11, 68, (2002)
[27] S. Masnou, Level lines based disocclusion,, Proc. IEEE Int. Conf. on Image Processing, 259, (1998)
[28] D. Mumford, Optimal approximation by piecewise smooth functions and associated variational problems,, Comm. Pure Appl. Math., 42, 577, (1989) · Zbl 0691.49036
[29] M. Myllykoski, A new augmented Lagrangian approach for L1-mean curvature image denoising,, SIAM J. Imaging Sci., 8, 95, (2015) · Zbl 1330.94011
[30] M. Nitzberg, <em>Filering, Segmentation, and Depth,</em>, Lecture Notes in Computer Science, (1993)
[31] S. Osher, Fronts propagating with curvature-dependent speed-algorithm based on Hamilton-Jacobi formulations,, J. Comput. Phys., 79, 12, (1988) · Zbl 0659.65132
[32] S. Osher, <em>Level Set Methods and Dynamic Implicit Surfaces,</em>, Springer-Verlag, (2003) · Zbl 1026.76001
[33] D. Peng, A PDE-based fast local level set method,, J. Comput. Phys., 155, 410, (1999) · Zbl 0964.76069
[34] R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming,, Mathematics of Operations Research, 1, 97, (1976) · Zbl 0402.90076
[35] L. Rudin, Nonlinear total variation based noise removal algorithm,, Physica D, 60, 259, (1992) · Zbl 0780.49028
[36] T. Schoenemann, <em>Curvature Regularity for Region-Based Image Segmentation and Inpainting: A Linear Programming Relaxation,</em>, IEEE International Conference on Computer Vision (ICCV), (2009)
[37] T. Schoenemann, A linear framework for region-based image segmentation and inpainting involving curvature penalization,, Int. J. Comput. Vision, 99, 53, (2012) · Zbl 1254.68282
[38] E. Strekalovskiy, Generalized ordering constraints for multilabel optimization,, IEEE International Conference on Computer Vision, 2619, (2011)
[39] X. C. Tai, A fast algorithm for Euler’s Elastica model using augmented Lagrangian method,, SIAM J. Imaging Sciences, 4, 313, (2011) · Zbl 1215.68262
[40] C. Wu, Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, Vectorial TV, and high order models,, SIAM J. Imaging Sciences, 3, 300, (2010) · Zbl 1206.90245
[41] F. Yang, Homotopy method for a mean curvature-based denoising model,, Appl. Numer. Math., 62, 185, (2012) · Zbl 1416.65173
[42] W. Zhu, A variational model for capturing illusory contours using curvature,, J. Math. Imaging Vision, 27, 29, (2007)
[43] W. Zhu, Image denoising using mean curvature of image surface,, SIAM J. Imaging Sciences, 5, 1, (2012) · Zbl 1258.94021
[44] W. Zhu, Image segmentation using Euler’s elastica as the regularization,, J. Sci. Comput., 57, 414, (2013) · Zbl 1282.65037
[45] W. Zhu, Augmented Lagrangian method for a mean curvature based image denoising model,, Inverse Probl. Imag., 7, 1409, (2013) · Zbl 1311.94015
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.