相关论文: Computing distances and means on manifolds with a …

The gradient method for minimize a differentiable convex function on Riemannian manifolds with lower bounded sectional curvature is analyzed in this paper. The analysis of the method is presented with three different finite procedures for…

We introduce a method to successively locate equilibria (steady states) of dynamical systems on Riemannian manifolds. The manifolds need not be characterized by an a priori known atlas or by the zeros of a smooth map. Instead, they can be…

Riemannian geometry provides the fundamental framework for optimization on nonlinear spaces such as matrix manifolds, which arise in machine learning, signal processing, and robotics. While the underlying theory is classical, existing…

In a family of compact, canonically polarized, complex manifolds the first variation of the lengths of closed geodesics is computed. As an application, we show the coincidence of the Fenchel-Nielsen and Weil-Petersson symplectic forms on…

In this paper, we prove a finite dimensional approximation scheme for the Wiener measure on closed Riemannian manifolds, establishing a generalization for $L^{1}$-functionals, of the approach followed by Andersson and Driver on [1]. We…

A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon…

Motivated by finding an effective way to compute the algebraic complexity of the nearest point problem for algebraic models, we introduce an efficient method for detecting the limit points of the stratified Morse trajectories in a small…

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

Over the past few years, symmetric positive definite (SPD) matrices have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the…

Manifold learning offers nonlinear dimensionality reduction of high-dimensional datasets. In this paper, we bring geometry processing to bear on manifold learning by introducing a new approach based on metric connection for generating a…

The space of embedded submanifolds plays an important role in applications such as computational anatomy and shape analysis. We can define two different classes on Riemannian metrics on this space: so-called outer metrics are metrics that…

Computing geodesics for Riemannian manifolds is a difficult task that often relies on numerical approximations. However, these approximations tend to be either numerically unstable, have slow convergence, or scale poorly with manifold…

The maximum mean discrepancy and Wasserstein distance are popular distance measures between distributions and play important roles in many machine learning problems such as metric learning, generative modeling, domain adaption, and…

Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformation, and for which the number of possible outcomes grows…

In this paper, we extend a recently established subgradient method for the computation of Riemannian metrics that optimizes certain singular value functions associated with dynamical systems. This extension is threefold. First, we introduce…

The surge of research in image segmentation has yielded remarkable performance gains but also exposed a reproducibility crisis. A major contributor is performance evaluation, where both selection and implementation of metrics play critical…

The Gaussian curvature of a two-dimensional Riemannian manifold is uniquely determined by the choice of the metric. The formulas for computing the curvature in terms of components of the metric, in isothermal coordinates, involve the…

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 order to characterize molecular structures we introduce configurational fingerprint vectors which are counterparts of quantities used experimentally to identify structures. The Euclidean distance between the configurational fingerprint…

We introduce geomstats, a python package that performs computations on manifolds such as hyperspheres, hyperbolic spaces, spaces of symmetric positive definite matrices and Lie groups of transformations. We provide efficient and extensively…