arXiv subjects

Eric Klassen

Publications and source records attributed to Eric Klassen.

At least 19 recordsLinked to original sources

arXiv2024

Sobolev Metrics on Spaces of Discrete Regular Curves

Reparametrization invariant Sobolev metrics on spaces of regular curves have been shown to be of importance in the field of mathematical shape analysis. For practical applications, one usually discretizes the space of smooth curves and considers the induced Riemannian metric on a finite dimensional approximation space. Surprisingly, the theoretical properties of the corresponding finite dimensional Riemannian manifolds have not yet been studied in detail, which is the content of the present article. Our main theorem concerns metric and geodesic completeness and mirrors the results of the infinite dimensional setting as obtained by Bruveris, Michor and Mumford.

math.DG↗

arXiv2022

Square Root Normal Fields for Lipschitz surfaces and the Wasserstein Fisher Rao metric

The Square Root Normal Field (SRNF) framework is a method in the area of shape analysis that defines a (pseudo) distance between unparametrized surfaces. For piecewise linear (PL) surfaces it was recently proved that the SRNF distance between unparametrized surfaces is equivalent to the Wasserstein Fisher Rao (WFR) metric on the space of finitely supported measures on $S^2$. In the present article we extend this point of view to a much larger set of surfaces; we show that the SRNF distance on the space of Lipschitz surfaces is equivalent to the WFR distance between Borel measures on $S^2$. For the space of spherical surfaces this result directly allows us to characterize the non-injectivity and the (closure of the) image of the SRNF transform. In the last part of the paper we further generalize this result by showing that the WFR metric for general measure spaces can be interpreted as an optimization problem over the diffeomorphism group of an independent background space.

math.DG↗

arXiv2022

Elastic Metrics on Spaces of Euclidean Curves: Theory and Algorithms

A main goal in the field of statistical shape analysis is to define computable and informative metrics on spaces of immersed manifolds, such as the space of curves in a Euclidean space. The approach taken in the elastic shape analysis framework is to define such a metric by starting with a reparameterization-invariant Riemannian metric on the space of parameterized shapes and inducing a metric on the quotient by the group of diffeomorphisms. This quotient metric is computed, in practice, by finding a registration of two shapes over the diffeomorphism group. For spaces of Euclidean curves, the initial Riemannian metric is frequently chosen from a two-parameter family of Sobolev metrics, called elastic metrics. Elastic metrics are especially convenient because, for several parameter choices, they are known to be locally isometric to Riemannian metrics for which one is able to solve the geodesic boundary problem explictly -- well-known examples of these local isometries include the complex square root transform of Younes, Michor, Mumford and Shah and square root velocity (SRV) transform of Srivastava, Klassen, Joshi and Jermyn. In this paper, we show that the SRV transform extends to elastic metrics for all choices of parameters, for curves in any dimension, thereby fully generalizing the work of many authors over the past two decades. We give a unified treatment of the elastic metrics: we extend results of Trouv\'{e} and Younes, Bruveris as well as Lahiri, Robinson and Klassen on the existence of solutions to the registration problem, we develop algorithms for computing distances and geodesics, and we apply these algorithms to metric learning problems, where we learn optimal elastic metric parameters for statistical shape analysis tasks.

math.DG↗

arXiv2022

Elastic shape analysis of surfaces with second-order Sobolev metrics: a comprehensive numerical framework

This paper introduces a set of numerical methods for Riemannian shape analysis of 3D surfaces within the setting of invariant (elastic) second-order Sobolev metrics. More specifically, we address the computation of geodesics and geodesic distances between parametrized or unparametrized immersed surfaces represented as 3D meshes. Building on this, we develop tools for the statistical shape analysis of sets of surfaces, including methods for estimating Karcher means and performing tangent PCA on shape populations, and for computing parallel transport along paths of surfaces. Our proposed approach fundamentally relies on a relaxed variational formulation for the geodesic matching problem via the use of varifold fidelity terms, which enable us to enforce reparametrization independence when computing geodesics between unparametrized surfaces, while also yielding versatile algorithms that allow us to compare surfaces with varying sampling or mesh structures. Importantly, we demonstrate how our relaxed variational framework can be extended to tackle partially observed data. The different benefits of our numerical pipeline are illustrated over various examples, synthetic and real.

cs.CV↗

arXiv2021

The Square Root Normal Field Distance and Unbalanced Optimal Transport

This paper explores a novel connection between two areas: shape analysis of surfaces and unbalanced optimal transport. Specifically, we characterize the square root normal field (SRNF) shape distance as the pullback of the Wasserstein-Fisher-Rao (WFR) unbalanced optimal transport distance. In addition, we propose a new algorithm for computing the WFR distance and present numerical results that highlight the effectiveness of this algorithm. As a consequence of our results we obtain a precise method for computing the SRNF shape distance directly on piecewise linear surfaces and gain new insights about the degeneracy of this distance.

math.DG↗

arXiv2021

Supervised deep learning of elastic SRV distances on the shape space of curves

Motivated by applications from computer vision to bioinformatics, the field of shape analysis deals with problems where one wants to analyze geometric objects, such as curves, while ignoring actions that preserve their shape, such as translations, rotations, or reparametrizations. Mathematical tools have been developed to define notions of distances, averages, and optimal deformations for geometric objects. One such framework, which has proven to be successful in many applications, is based on the square root velocity (SRV) transform, which allows one to define a computable distance between spatial curves regardless of how they are parametrized. This paper introduces a supervised deep learning framework for the direct computation of SRV distances between curves, which usually requires an optimization over the group of reparametrizations that act on the curves. The benefits of our approach in terms of computational speed and accuracy are illustrated via several numerical experiments.

cs.CV↗

arXiv2020

Intrinsic Riemannian metrics on spaces of curves: theory and computation

This chapter reviews some past and recent developments in shape comparison and analysis of curves based on the computation of intrinsic Riemannian metrics on the space of curves modulo shape-preserving transformations. We summarize the general construction and theoretical properties of quotient elastic metrics for Euclidean as well as non-Euclidean curves before considering the special case of the square root velocity metric for which the expression of the resulting distance simplifies through a particular transformation. We then examine different numerical approaches that have been proposed to estimate such distances in practice and in particular to quotient out curve reparametrization in the resulting minimization problems.

math.DG↗

arXiv2019

Closed surfaces with different shapes that are indistinguishable by the SRNF

The Square Root Normal Field (SRNF), introduced by Jermyn et al. in [3], provides a way of representing immersed surfaces in $\mathbb R^3$, and equipping the set of these immersions with a "distance function" (to be precise, a pseudometric) that is easy to compute. Importantly, this distance function is invariant under reparametrizations (i.e., under self-diffeomorphisms of the domain surface) and under rigid motions of $\mathbb R^3$. Thus, it induces a distance function on the shape space of immersions, i.e., the space of immersions modulo reparametrizations and rigid motions of $\mathbb R^3$. In this paper, we give examples of the degeneracy of this distance function, i.e., examples of immersed surfaces (some closed and some open) that have the same SRNF, but are not the same up to reparametrization and rigid motions. We also prove that the SRNF does distinguish the shape of a standard sphere from the shape of any other immersed surface, and does distinguish between the shapes of any two embedded strictly convex surfaces.

math.DG↗

arXiv2019

Shape Analysis of Surfaces Using General Elastic Metrics

In this article we introduce a family of elastic metrics on the space of parametrized surfaces in 3D space using a corresponding family of metrics on the space of vector valued one-forms. We provide a numerical framework for the computation of geodesics with respect to these metrics. The family of metrics is invariant under rigid motions and reparametrizations; hence it induces a metric on the "shape space" of surfaces. This new class of metrics generalizes a previously studied family of elastic metrics and includes in particular the Square Root Normal Function (SRNF) metric, which has been proven successful in various applications. We demonstrate our framework by showing several examples of geodesics and compare our results with earlier results obtained from the SRNF framework.

math.DG↗

arXiv2018

A diffeomorphism-invariant metric on the space of vector-valued one-forms

In this article we introduce a diffeomorphism-invariant Riemannian metric on the space of vector valued one-forms. The particular choice of metric is motivated by potential future applications in the field of functional data and shape analysis and by connections to the Ebin metric on the space of all Riemannian metrics. In the present work we calculate the geodesic equations and obtain an explicit formula for the solutions to the corresponding initial value problem. Using this we show that it is a geodesically and metrically incomplete space and study the existence of totally geodesic subspaces. Furthermore, we calculate the sectional curvature and observe that, depending on the dimension of the base manifold and the target space, it either has a semidefinite sign or admits both signs.

math.DG↗

arXiv2018

Robust Comparison of Kernel Densities on Spherical Domains

While spherical data arises in many contexts, including in directional statistics, the current tools for density estimation and population comparison on spheres are quite limited. Popular approaches for comparing populations (on Euclidean domains) mostly involvea two-step procedure: (1) estimate probability density functions (pdfs) from their respective samples, most commonly using the kernel density estimator, and, (2) compare pdfs using a metric such as the L2 norm. However, both the estimated pdfs and their differences depend heavily on the chosen kernels, bandwidths, and sample sizes. Here we develop a framework for comparing spherical populations that is robust to these choices. Essentially, we characterize pdfs on spherical domains by quantifying their smoothness. Our framework uses a spectral representation, with densities represented by their coefficients with respect to the eigenfunctions of the Laplacian operator on a sphere. The change in smoothness, akin to using different kernel bandwidths, is controlled by exponential decays in coefficient values. Then we derive a proper distance for comparing pdf coefficients while equalizing smoothness levels, negating influences of sample size and bandwidth. This signifies a fair and meaningful comparisons of populations, despite vastly different sample sizes, and leads to a robust and improved performance. We demonstrate this framework using examples of variables on S1 and S2, and evaluate its performance using a number of simulations and real data experiments.

stat.ME↗

arXiv2017

Comparing Curves in Homogeneous Spaces

Of concern is the study of the space of curves in homogeneous spaces. Motivated by applications in shape analysis we identify two curves if they only differ by their parametrization and/or a rigid motion. For curves in Euclidean space the Square-Root-Velocity-Function (SRVF) allows to define and efficiently compute a distance on this infinite dimensional quotient space. In this article we present a generalization of the SRVF to curves in homogeneous spaces. We prove that, under mild conditions on the curves, there always exist optimal reparametrizations realizing the quotient distance and demonstrate the efficiency of our framework in selected numerical examples.

math.DG↗

arXiv2017

The Square Root Velocity Framework for Curves in a Homogeneous Space

In this paper we study the shape space of curves with values in a homogeneous space $M = G/K$, where $G$ is a Lie group and $K$ is a compact Lie subgroup. We generalize the square root velocity framework to obtain a reparametrization invariant metric on the space of curves in $M$. By identifying curves in $M$ with their horizontal lifts in $G$, geodesics then can be computed. We can also mod out by reparametrizations and by rigid motions of $M$. In each of these quotient spaces, we can compute Karcher means, geodesics, and perform principal component analysis. We present numerical examples including the analysis of a set of hurricane paths.

math.DG↗

arXiv2017

Nonparametric Spherical Regression Using Diffeomorphic Mappings

Spherical regression explores relationships between variables on spherical domains. We develop a nonparametric model that uses a diffeomorphic map from a sphere to itself. The restriction of this mapping to diffeomorphisms is natural in several settings. The model is estimated in a penalized maximum-likelihood framework using gradient-based optimization. Towards that goal, we specify a first-order roughness penalty using the Jacobian of diffeomorphisms. We compare the prediction performance of the proposed model with state-of-the-art methods using simulated and real data involving cloud deformations, wind directions, and vector-cardiograms. This model is found to outperform others in capturing relationships between spherical variables.

stat.OT↗

arXiv2016

Phase-Amplitude Separation and Modeling of Spherical Trajectories

This paper studies the problem of separating phase-amplitude components in sample paths of a spherical process (longitudinal data on a unit two-sphere). Such separation is essential for efficient modeling and statistical analysis of spherical longitudinal data in a manner that is invariant to any phase variability. The key idea is to represent each path or trajectory with a pair of variables, a starting point and a Transported Square-Root Velocity Curve (TSRVC). A TSRVC is a curve in the tangent (vector) space at the starting point and has some important invariance properties under the L2 norm. The space of all such curves forms a vector bundle and the L2 norm, along with the standard Riemannian metric on S2, provides a natural metric on this vector bundle. This invariant representation allows for separating phase and amplitude components in given data, using a template-based idea. Furthermore, the metric property is useful in deriving computational procedures for clustering, mean computation, principal component analysis (PCA), and modeling. This comprehensive framework is demonstrated using two datasets: a set of bird-migration trajectories and a set of hurricane paths in the Atlantic ocean.

stat.ME↗

arXiv2015

Video-Based Action Recognition Using Rate-Invariant Analysis of Covariance Trajectories

Statistical classification of actions in videos is mostly performed by extracting relevant features, particularly covariance features, from image frames and studying time series associated with temporal evolutions of these features. A natural mathematical representation of activity videos is in form of parameterized trajectories on the covariance manifold, i.e. the set of symmetric, positive-definite matrices (SPDMs). The variable execution-rates of actions implies variable parameterizations of the resulting trajectories, and complicates their classification. Since action classes are invariant to execution rates, one requires rate-invariant metrics for comparing trajectories. A recent paper represented trajectories using their transported square-root vector fields (TSRVFs), defined by parallel translating scaled-velocity vectors of trajectories to a reference tangent space on the manifold. To avoid arbitrariness of selecting the reference and to reduce distortion introduced during this mapping, we develop a purely intrinsic approach where SPDM trajectories are represented by redefining their TSRVFs at the starting points of the trajectories, and analyzed as elements of a vector bundle on the manifold. Using a natural Riemannain metric on vector bundles of SPDMs, we compute geodesic paths and geodesic distances between trajectories in the quotient space of this vector bundle, with respect to the re-parameterization group. This makes the resulting comparison of trajectories invariant to their re-parameterization. We demonstrate this framework on two applications involving video classification: visual speech recognition or lip-reading and hand-gesture recognition. In both cases we achieve results either comparable to or better than the current literature.

cs.CV↗

arXiv2015

Precise Matching of PL Curves in $R^N$ in the Square Root Velocity Framework

The square root velocity function (SRVF), introduced by Srivastava et al, has proved to be an effective way to compare absolutely continuous curves in $R^N$ modulo reparametrization. Several computational papers have been published based on this method. In this paper, we carefully establish the theoretical foundations of the SRVF method. In particular, we analyze the quotient construction of the set of absolutely continuous curves modulo the group (or in some cases, semigroup) of reparametrizations, proving an important theorem about the structure of the closed orbits required in this quotient construction. We observe that the set of piecewise linear curves is dense in the space of absolutely continuous curves with respect to the SRVF metric. Finally, given two piecewise linear curves, we establish a precise algorithm for producing the optimal matching between these curves. This also results in a precise determination of the geodesic between the points in the quotient space corresponding to these curves. In the past, this geodesic has only been approximated using the method of Dynamic Programming. We show examples resulting from this algorithm.

math.DG↗

arXiv2014

Statistical analysis of trajectories on Riemannian manifolds: Bird migration, hurricane tracking and video surveillance

We consider the statistical analysis of trajectories on Riemannian manifolds that are observed under arbitrary temporal evolutions. Past methods rely on cross-sectional analysis, with the given temporal registration, and consequently may lose the mean structure and artificially inflate observed variances. We introduce a quantity that provides both a cost function for temporal registration and a proper distance for comparison of trajectories. This distance is used to define statistical summaries, such as sample means and covariances, of synchronized trajectories and "Gaussian-type" models to capture their variability at discrete times. It is invariant to identical time-warpings (or temporal reparameterizations) of trajectories. This is based on a novel mathematical representation of trajectories, termed transported square-root vector field (TSRVF), and the $\mathbb{L}^2$ norm on the space of TSRVFs. We illustrate this framework using three representative manifolds---$\mathbb{S}^2$, $\mathrm {SE}(2)$ and shape space of planar contours---involving both simulated and real data. In particular, we demonstrate: (1) improvements in mean structures and significant reductions in cross-sectional variances using real data sets, (2) statistical modeling for capturing variability in aligned trajectories, and (3) evaluating random trajectories under these models. Experimental results concern bird migration, hurricane tracking and video surveillance.

stat.AP↗