Variational Dynamics of Free Triple Junctions
- 188 Downloads
We propose a level set framework for representing triple junctions either with or without free endpoints. For triple junctions without free endpoints, our method uses two level set functions to represent the three segments that constitute the structure. For free triple junctions, we extend our method using the free curve work of Schaeffer and Vese (J Math Imaging Vis, 1–17, 2013), Smereka (Phys D Nonlinear Phenom 138(3–4):282–301, 2000). For curves moving under length minimizing flows, it is well known that the endpoints either intersect perpendicularly to the boundary, do not intersect the boundary of the domain or the curve itself (free endpoints), or meet at triple junctions. Although many of these cases can be formulated within the level set framework, the case of free triple junctions does not appear in the literature. Therefore, the proposed free triple junction formulation completes the important curve structure representations within the level set framework. We derive an evolution equation for the dynamics of the triple junction under length and area minimizing flow. The resulting system of partial differential equations are both coupled and highly non-linear, so the system is solved numerically using the Sobolev preconditioned descent. Qualitative numerical experiments are presented on various triple junction and free triple junction configurations, as well as an example with a quadruple junction instability. Quantitative results show convergence of the preconditioned algorithm to the correct solutions.
KeywordsTriple junction Free endpoints Energy minimization Level set method Essentially non-oscillatory Curve evolution
This research was made possible by the Department of Defense (DoD) through the National Defense Science and Engineering Graduate Fellowship (NDSEG) and by NSF DMS 1217239. The authors would like to thank Selim Esedoglu for his helpful discussion and the reviewers and editor for their useful comments. The authors would also like to thank Stanley Osher for his helpful comments.
- 8.Chung, G., Vese, L.A.: Energy minimization based segmentation and denoising using a multilayer level set approach. In: Energy Minimization Methods in Computer Vision and Pattern Recognition, pp. 439–455. Springer, Berlin (2005)Google Scholar
- 12.Dal Maso, G., Toader, R.: A model for the quasi-static growth of brittle fractures based on local minimization. ArXiv Mathematics e-prints, June (2002)Google Scholar
- 17.Jung, M., Chung, G., Sundaramoorthi, G., Vese, L.A., Yuille, A.L.: Sobolev gradients and joint variational image segmentation, denoising, and deblurring. Proc. SPIE, 7246(1), 72460I–72460I-13 (2009)Google Scholar
- 21.Larsen, C.J., Richardson, C.L., Sarkis, M.: A level set method for the mumford -Shah functional and fracture. Preprint serie A, Instituto Nacional de Matemática Pura e Aplicada, Brazilian Ministry for Science and Technology (2008)Google Scholar
- 22.Li, H., X-C T.: Piecewise constant level set methods for multiphase motion. Int. J. Numer. Anal. Mod. 4(2), 291–305 (2007)Google Scholar
- 24.Melonakos, J., Pichon, E., Angenent, S., Tannenbaum, A.: Finsler active contours. Pattern Anal. Mach. Intell. IEEE Trans. 30(3), 412–423 (2008)Google Scholar
- 27.Neuberger, J.W.: Sobolev Gradients and Differential Equations. Springer, Berlin (2009)Google Scholar
- 29.Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79(1), 12–49 (1988)Google Scholar
- 31.Renka, R.J.: A simple explanation of the sobolev gradient method (2006). http://www.cse.unt.edu/~renka/papers/sobolev.pdf
- 35.Schaeffer, H.: Active arcs and contours. UCLA CAM Report, pp. 12–54 (2012)Google Scholar
- 36.Schaeffer, H., Vese, L.: Active contours with free endpoints. J. Math. Imaging Vis. (2013). doi: 10.1007/s10851-013-0437-4