Geodesic Models with Convexity Shape Prior - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Pattern Analysis and Machine Intelligence Year : 2023

Geodesic Models with Convexity Shape Prior

(1) , (2) , (1) , (3) , (4)
1
2
3
4

Abstract

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 in conjunction with geometric regularization terms, such as Euclidean curve length or curvature-penalized length, for computing geodesic curves. In this paper, we take into account a more complicated problem: finding curvature-penalized geodesic curves which are imposed a convexity shape prior. We establish new geodesic models relying on the strategy of orientation-lifting, by which a planar curve can be mapped to an high-dimensional orientation-dependent space. The convexity shape prior serves as a constraint for the construction of local geodesic metrics encoding a particular curvature constraint. Then the geodesic distances and the corresponding closed geodesic curves in the orientation-lifted space can be efficiently computed through state-of-the-art Hamiltonian fast marching method. In addition, we apply the proposed geodesic models to the active contours, leading to efficient interactive image segmentation algorithms that preserve the advantages of convexity shape prior and curvature penalization.
Fichier principal
Vignette du fichier
TPAMI_Convexity_R0.pdf (25.04 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03359125 , version 1 (29-09-2021)

Identifiers

  • HAL Id : hal-03359125 , version 1

Cite

Da Chen, Jean-Marie Mirebeau, Minglei Shu, Xuecheng Tai, Laurent D. Cohen. Geodesic Models with Convexity Shape Prior. IEEE Transactions on Pattern Analysis and Machine Intelligence, In press. ⟨hal-03359125⟩
36 View
3 Download

Share

Gmail Facebook Twitter LinkedIn More