Global Minimum for a Finsler Elastica Minimal Path Approach

In this paper, we propose a novel curvature penalized minimal path model via an orientation-lifted Finsler metric and the Euler elastica curve. The original minimal path model computes the globally minimal geodesic by solving an Eikonal partial differential equation (PDE). Essentially, this first-order model is unable to penalize curvature which is related to the path rigidity property in the classical active contour models. To solve this problem, we present an Eikonal PDE-based Finsler elastica minimal path approach to address the curvature-penalized geodesic energy minimization problem. We were successful at adding the curvature penalization to the classical geodesic energy (Caselles et al. in Int J Comput Vis 22(1):61–79, 1997; Cohen and Kimmel in Int J Comput Vis 24(1):57–78, 1997). The basic idea of this work is to interpret the Euler elastica bending energy via a novel Finsler elastica metric that embeds a curvature penalty. This metric is non-Riemannian, anisotropic and asymmetric, and is defined over an orientation-lifted space by adding to the image domain the orientation as an extra space dimension. Based on this orientation lifting, the proposed minimal path model can benefit from both the curvature and orientation of the paths. Thanks to the fast marching method, the global minimum of the curvature-penalized geodesic energy can be computed efficiently. We introduce two anisotropic image data-driven speed functions that are computed by steerable filters. Based on these orientation-dependent speed functions, we can apply the proposed Finsler elastica minimal path model to the applications of closed contour detection, perceptual grouping and tubular structure extraction. Numerical experiments on both synthetic and real images show that these applications of the proposed model indeed obtain promising results.

[1]  Laurent D. Cohen,et al.  Fast Object Segmentation by Growing Minimal Paths from a Single Point on 2D or 3D Images , 2009, Journal of Mathematical Imaging and Vision.

[2]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[3]  Jean-Marie Mirebeau,et al.  Efficient fast marching with Finsler metrics , 2012, Numerische Mathematik.

[4]  Anthony J. Yezzi,et al.  Detecting Curves with Unknown Endpoints and Arbitrary Topology Using Minimal Paths , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Laurent D. Cohen,et al.  Tubular Structure Segmentation Based on Minimal Path Method and Anisotropic Enhancement , 2011, International Journal of Computer Vision.

[6]  Silvano Di Zenzo,et al.  A note on the gradient of a multi-image , 1986, Comput. Vis. Graph. Image Process..

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  R. P. van Wijk van Brievingh The Geometric Model , 1975 .

[9]  Laurent D. Cohen,et al.  Fast extraction of minimal paths in 3D images and applications to virtual endoscopy , 2001, Medical Image Anal..

[10]  P. Lions Generalized Solutions of Hamilton-Jacobi Equations , 1982 .

[11]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[12]  Remco Duits,et al.  A PDE Approach to Data-Driven Sub-Riemannian Geodesics in SE(2) , 2015, SIAM J. Imaging Sci..

[13]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[14]  Laurent D. Cohen,et al.  Combination of Piecewise-Geodesic Paths for Interactive Segmentation , 2014, International Journal of Computer Vision.

[15]  Baba C. Vemuri,et al.  Shape Modeling with Front Propagation: A Level Set Approach , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Daniel Cremers,et al.  The Elastic Ratio: Introducing Curvature Into Ratio-Based Image Segmentation , 2011, IEEE Transactions on Image Processing.

[17]  Baba C. Vemuri,et al.  Evolutionary Fronts for Topology-Independent Shape Modeling and Recoveery , 1994, ECCV.

[18]  David Mumford,et al.  The 2.1-D sketch , 1990, [1990] Proceedings Third International Conference on Computer Vision.

[19]  Hugues Talbot,et al.  Globally Optimal Geodesic Active Contours , 2005, Journal of Mathematical Imaging and Vision.

[20]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .

[21]  Ron Kimmel,et al.  Fast Marching Methods , 2004 .

[22]  Leo Grady,et al.  Fast global optimization of curvature , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[23]  Fredrik Kahl,et al.  Shortest Paths with Higher-Order Regularization , 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Laurent D. Cohen,et al.  Anisotropic Geodesics for Perceptual Grouping and Domain Meshing , 2008, ECCV.

[25]  Anthony J. Yezzi,et al.  A geometric snake model for segmentation of medical imagery , 1997, IEEE Transactions on Medical Imaging.

[26]  D. Mumford Elastica and Computer Vision , 1994 .

[27]  Ronen Basri,et al.  Image Segmentation by Probabilistic Bottom-Up Aggregation and Cue Integration , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Remco Duits,et al.  Sub-Riemannian Fast Marching in SE(2) , 2015, CIARP.

[29]  Laurent D. Cohen,et al.  Geodesic voting for the automatic extraction of tree structures. Methods and applications , 2013, Comput. Vis. Image Underst..

[30]  Daniel Cremers,et al.  A Linear Framework for Region-Based Image Segmentation and Inpainting Involving Curvature Penalization , 2011, International Journal of Computer Vision.

[31]  Charless C. Fowlkes,et al.  Contour Detection and Hierarchical Image Segmentation , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[33]  F. Bornemann,et al.  Finite-element Discretization of Static Hamilton-Jacobi Equations based on a Local Variational Principle , 2004, math/0403517.

[34]  Jean-Marie Mirebeau,et al.  Anisotropic Fast-Marching on Cartesian Grids Using Lattice Basis Reduction , 2012, SIAM J. Numer. Anal..

[35]  Anthony J. Yezzi,et al.  Active geodesics: Region-based active contour segmentation with a global edge-based constraint , 2011, 2011 International Conference on Computer Vision.

[36]  Laurent D. Cohen,et al.  Global Minimum for Active Contour Models: A Minimal Path Approach , 1997, International Journal of Computer Vision.

[37]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[38]  Mathews Jacob,et al.  Design of steerable filters for feature detection using canny-like criteria , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[39]  Wei Huang,et al.  MMSE Reconstruction for 3D Freehand Ultrasound Imaging , 2008, Int. J. Biomed. Imaging.

[40]  Laurent D. Cohen,et al.  On active contour models and balloons , 1991, CVGIP Image Underst..

[41]  Laurent D. Cohen,et al.  Geodesic Methods in Computer Vision and Graphics , 2010, Found. Trends Comput. Graph. Vis..

[42]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[43]  Jean Daunizeau,et al.  Accurate Anisotropic Fast Marching for Diffusion-Based Geodesic Tractography , 2007, Int. J. Biomed. Imaging.

[44]  J. Petitot The neurogeometry of pinwheels as a sub-Riemannian contact structure , 2003, Journal of Physiology-Paris.

[45]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[46]  Xue-Cheng Tai,et al.  A Fast Algorithm for Euler's Elastica Model Using Augmented Lagrangian Method , 2011, SIAM J. Imaging Sci..

[47]  Laurent D. Cohen,et al.  Global Minimum for Curvature Penalized Minimal Path Method , 2015, BMVC.

[48]  Xue-Cheng Tai,et al.  Image Segmentation Using Euler’s Elastica as the Regularization , 2013, J. Sci. Comput..

[49]  Gabriel Peyré,et al.  Extraction of tubular structures over an orientation domain , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[50]  Max W. K. Law,et al.  Three Dimensional Curvilinear Structure Detection Using Optimally Oriented Flux , 2008, ECCV.

[51]  D CohenLaurent On active contour models and balloons , 1991 .

[52]  Anthony J. Yezzi,et al.  Vessels as 4-D Curves: Global Minimal 4-D Paths to Extract 3-D Tubular Surfaces and Centerlines , 2007, IEEE Transactions on Medical Imaging.

[53]  Ron Kimmel,et al.  Optimal Algorithm for Shape from Shading and Path Planning , 2001, Journal of Mathematical Imaging and Vision.

[54]  Tony F. Chan,et al.  Euler's Elastica and Curvature-Based Inpainting , 2003, SIAM J. Appl. Math..

[55]  Laurent D. Cohen Multiple Contour Finding and Perceptual Grouping using Minimal Paths , 2004, Journal of Mathematical Imaging and Vision.