Geodesics with Unified Tangent-constrained Priors and Curvature Regularization

• URL: http://arxiv.org/abs/2606.00139v1
• Date: Thu, 28 May 2026 23:27:05 GMT
• Title: Geodesics with Unified Tangent-constrained Priors and Curvature Regularization
• Abstract summary: Curvature-penalized geodesic models have proven their effectiveness in image segmentation by computing globally optimal curves.<n>We propose a unified geodesic framework that integrates tangent-constrained priors with curvature penalization.
• Score: 24.540173691581575
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 complex shapes and image intensity distributions, as they lack mechanisms to enforce shape-aware tangent constraints. To address this limitation, we propose a unified geodesic framework that integrates tangent-constrained priors with curvature penalization. The key idea is to formulate tangent admissibility directly within the orientation-lifted space, where path tangents are restricted to spatially varying angular sectors derived from intrinsic shape representatives (ISR) such as skeletons or interior landmarks. This formulation gives rise to a family of tangent-constrained Finslerian metrics, extending the classical curvature-penalized geodesic models while enforcing mandatory tangent constraints. The resulting Hamilton-Jacobi-Bellman (HJB) partial differential equations (PDEs) admit efficient numerical solutions via variants of the fast marching method, preserving the single-pass computational complexity. Experiments on synthetic, natural, and medical images demonstrate that the proposed geodesic framework indeed improves robustness against weak boundaries and topological shortcuts, yielding segmentation results with enhanced shape fidelity compared to existing geodesic models.

Related papers

• Curvature-Independent Regret Bounds for Distributed Online Optimization on Hadamard Manifolds [9.035866986287205]
  This work addresses decentralized online convexian optimization on Hadamard.<n>To our knowledge these are the first curvature-independent regret guarantees on embeddings for predicted rates, with no degradation due to curvature.
  arXiv  Detail & Related papers  (2026-09-12T01:53:49Z)
• Computing Smooth Geodesics under Two-Sided Curvature Bounds with Applications to Robotics and Image Analysis [23.336775580260337]
  Curvature of planar curves serves as a key regularization term for computing second-order minimal paths.<n>We propose a new curvature-bounded geodesic model, developed under the Hamilton-Jacobi-Bellman (HJB) partial differential equation (PDE) framework.<n> Numerical experiments demonstrate that the proposed curvature-bounded geodesic model serves as a powerful and robust tool for finding satisfactory paths.
  arXiv  Detail & Related papers  (2026-06-11T14:13:24Z)
• Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization [1.7430416823420511]
  In this paper we propose dynamic estimation on the Grassmann manifold with a factor model (textscDegfm)<n>We model the time-varying precision matrix sequence as a low-rank-plus-diagonal structure governed by a latent elliptical graph factor model.<n>Experiments on both synthetic benchmarks and real-world datasets demonstrate that textscDegfm consistently outperforms state-of-the-art evaluations.
  arXiv  Detail & Related papers  (2026-05-18T12:34:44Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Riemannian gradient descent for Hartree-Fock theory [0.0]
  We present an optimization framework for Hartree-Fock theory formulated directly in the Sobolev space $H1$.<n>Explicit expressions for Euclidean and Riemannian gradients, tangent-space projections, and retractions are derived.<n>The proposed formulation provides a geometrically consistent and discretization-independent perspective on electronic structure optimization.
  arXiv  Detail & Related papers  (2026-03-16T19:58:42Z)
• Riemannian Flow Matching for Disentangled Graph Domain Adaptation [51.98961391065951]
  Graph Domain Adaptation (GDA) typically uses adversarial learning to align graph embeddings in Euclidean space.<n>DisRFM is a geometry-aware GDA framework that unifies embedding and flow-based transport.
  arXiv  Detail & Related papers  (2026-01-31T11:05:35Z)
• Curvature Learning for Generalization of Hyperbolic Neural Networks [51.888534247573894]
  Hyperbolic neural networks (HNNs) have demonstrated notable efficacy in representing real-world data with hierarchical structures.<n>Inappropriate curvatures may cause HNNs to converge to suboptimal parameters, degrading overall performance.<n>We propose a sharpness-aware curvature learning method to smooth the loss landscape, thereby improving the generalization of HNNs.
  arXiv  Detail & Related papers  (2025-08-24T07:14:30Z)
• Enforcing Latent Euclidean Geometry in Single-Cell VAEs for Manifold Interpolation [79.27003481818413]
  We introduce FlatVI, a training framework that regularises the latent manifold of discrete-likelihood variational autoencoders towards Euclidean geometry.<n>By encouraging straight lines in the latent space to approximate geodesics on the decoded single-cell manifold, FlatVI enhances compatibility with downstream approaches.
  arXiv  Detail & Related papers  (2025-07-15T23:08:14Z)
• Follow the Energy, Find the Path: Riemannian Metrics from Energy-Based Models [63.331590876872944]
  We propose a method for deriving Riemannian metrics directly from pretrained Energy-Based Models.<n>These metrics define spatially varying distances, enabling the computation of geodesics.<n>We show that EBM-derived metrics consistently outperform established baselines.
  arXiv  Detail & Related papers  (2025-05-23T12:18:08Z)
• A space-decoupling framework for optimization on bounded-rank matrices with orthogonally invariant constraints [8.902244235284229]
  We propose a space-decoupling framework for optimization on bounded-rank matrices.<n>We show that the tangent cone of coupled constraints is the intersection of tangent cones of each constraint.<n>We unveil the equivalence between the reformulated problem and the original problem.
  arXiv  Detail & Related papers  (2025-01-23T16:54:03Z)
• Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learning [77.1421343649344]
  We propose a generalization of Transformers towards operating entirely on the product of constant curvature spaces. We also provide a kernelized approach to non-Euclidean attention, which enables our model to run in time and memory cost linear to the number of nodes and edges.
  arXiv  Detail & Related papers  (2023-09-08T02:44:37Z)
• Geodesic Models with Convexity Shape Prior [8.932981695464761]
  In this paper, we take into account a more complicated problem: finding curvature-penalized geodesic paths with a convexity shape prior. We establish new geodesic models relying on the strategy of orientation-lifting. The convexity shape prior serves as a constraint for the construction of local geodesic metrics encoding a curvature constraint.
  arXiv  Detail & Related papers  (2021-11-01T09:41:54Z)
• Geodesic Paths for Image Segmentation with Implicit Region-based Homogeneity Enhancement [19.309722425910465]
  We introduce a flexible interactive image segmentation model based on the Eikonal partial differential equation (PDE) framework. The proposed model indeed outperforms state-of-the-art minimal paths-based image segmentation approaches.
  arXiv  Detail & Related papers  (2020-08-16T13:29:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.