A New Finsler Minimal Path Model With Curvature Penalization for Image Segmentation and Closed Contour Detection
In this paper, we propose a new curvature penalized minimal path model for image segmentation via closed contour detection based on the weighted Euler elastica curves, firstly introduced to the field of computer vision in [22]. Our image segmentation method extracts a collection of curvature penalized minimal geodesics, concatenated to form a closed contour, by connecting a set of user-specified points. Globally optimal minimal paths can be computed by solving an Eikonal equation. This first order PDE is traditionally regarded as unable to penalize curvature, which is related to the path acceleration in active contour models. We introduce here a new approach that enables finding a global minimum of the geodesic energy including a curvature term. We achieve this through the use of a novel Finsler metric adding to the image domain the orientation as an extra space dimension. This metric is non-Riemannian and asymmetric, defined on an orientation lifted space, incorporating the curvature penalty in the geodesic energy. Experiments show that the proposed Finsler minimal path model indeed outperforms state-of-the-art minimal path models in both synthetic and real images.
Code (0)
등록된 구현이 없습니다.
Tasks
Contour DetectionImage SegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
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 so…
Contour DetectionGeodesics with Unified Tangent-constrained Priors and Curvature Regularization
Curvature-penalized geodesic models have proven their effectiveness in image segmentation by computing globally optimal curves. Unfortunately, these models remain susceptible to shortcuts when delineating objects with co…
Image SegmentationGeodesic Models with Convexity Shape Prior
The minimal geodesic models based on the Eikonal equations are capable of finding suitable solutions in various image segmentation scenarios. Existing geodesic-based segmentation approaches usually exploit image features…
Image SegmentationSegmentationSemantic SegmentationFrom Active Contours to Minimal Geodesic Paths: New Solutions to Active Contours Problems by Eikonal Equations
In this chapter, we give an overview of part of our previous work based on the minimal path framework and the Eikonal partial differential equation (PDE). We show that by designing adequate Riemannian and Randers geodesi…
Boundary DetectionImage SegmentationSemantic SegmentationComputing Smooth Geodesics under Two-Sided Curvature Bounds with Applications to Robotics and Image Analysis
Curvature of planar curves serves as a key regularization term for computing second-order minimal paths, due to its tight relevance to desirable geometric properties such as smoothness, rigidity, and elasticity. In this …