相关论文: From Active Contours to Minimal Geodesic Paths: Ne…
Neuroscientific studies of drawing-like movements usually analyze neural representation of either geometric (eg. direction, shape) or temporal (eg. speed) features of trajectories rather than trajectory's representation as a whole. This…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
We propose a Fast Marching based implementation for computing sub-Riemanninan (SR) geodesics in the roto-translation group SE(2), with a metric depending on a cost induced by the image data. The key ingredient is a Riemannian approximation…
In this paper, we explore the concept of metric-driven numerical methods as a powerful tool for solving various types of multiscale partial differential equations. Our focus is on computing constrained minimizers of functionals - or,…
We propose a novel optimization algorithm for continuous functions using geodesics and contours under conformal mapping.The algorithm can find multiple optima by first following a geodesic curve to a local optimum then traveling to the next…
We propose three iterative methods for solving the Moser-Veselov equation, which arises in the discretization of the Euler-Arnold differential equations governing the motion of a generalized rigid body. We start by formulating the problem…
What is the shortest path between two data points lying in a high-dimensional space? While the answer is trivial in Euclidean geometry, it becomes significantly more complex when the data lies on a curved manifold -- requiring a Riemannian…
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on…
This paper describes a novel framework for computing geodesic paths in shape spaces of spherical surfaces under an elastic Riemannian metric. The novelty lies in defining this Riemannian metric directly on the quotient (shape) space, rather…
In this paper the optimal transport and the metamorphosis perspectives are combined. For a pair of given input images geodesic paths in the space of images are defined as minimizers of a resulting path energy. To this end, the underlying…
We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…
The fact that minimal surfaces in the four-dimensional Euclidean space admit natural parameters implies that any minimal surface is determined uniquely up to a motion by two curvature functions, satisfying a system of two PDE's (the system…
This paper focuses on establishing the existence of a class of steady solutions, termed least total curvature solutions, to the incompressible Euler system in a strip. The solutions obtained in this paper complement the least total…
The Dijkstra algorithm is a classic path planning method, which operates in a discrete graph space to determine the shortest path from a specified source point to a target node or all other nodes based on non-negative edge weights. Numerous…
This paper investigates the relationship between a system of differential equations and the underlying geometry associated with it. The geometry of a surface determines shortest paths, or geodesics connecting nearby points, which are…
We first derive the relation between the eikonal approximation to the Maxwell wave equations in an inhomogeneous anisotropic medium and geodesic motion in a three dimensional Riemannian manifold using a method which identifies the…
Solutions of certain partial differential equations (PDEs) are often represented by the steepest descent curves of corresponding functionals. Minimizing movement scheme was developed in order to study such curves in metric spaces.…
The numerical computation of shortest paths or geodesics on surfaces, along with the associated geodesic distance, has a wide range of applications. Compared to Euclidean distance computation, these tasks are more complex due to the…
We propose here a proof of existence of a minimizer of a segmentation functional based on a priori information on target shapes, and formulated with level sets. The existence of a minimizer is very important, because it guarantees the…
We consider the minimal action problem min \int\_R 1/2 |$\gamma$'|^2 + W($\gamma$) dt among curves lying in a non-locally-compact metric space and connecting two given zeros of W $\ge$ 0. For this problem, the optimal curves are usually…