628 research outputs found
Numerical inversion of SRNFs for efficient elastic shape analysis of star-shaped objects.
The elastic shape analysis of surfaces has proven useful in several application areas, including medical image analysis, vision, and graphics.
This approach is based on defining new mathematical representations of parameterized surfaces, including the square root normal field (SRNF), and then using the L2 norm to compare their shapes. Past work is based on using the pullback of the L2 metric to the space of surfaces, performing statistical analysis under this induced Riemannian metric. However, if one can estimate the inverse of the SRNF mapping, even approximately, a very efficient framework results: the surfaces, represented by their SRNFs, can be efficiently analyzed using standard Euclidean tools, and only the final results need be mapped back to the surface space. Here we describe a procedure for inverting SRNF maps of star-shaped surfaces, a special case for which analytic results can be obtained. We test our method via the classification of 34 cases of ADHD (Attention Deficit Hyperactivity Disorder), plus controls, in the Detroit Fetal Alcohol and Drug Exposure Cohort study. We obtain state-of-the-art results
Gauge Invariant Framework for Shape Analysis of Surfaces
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 than inheriting it from pre-shape space, and using it to formulate a
path energy that measures only the normal components of velocities along the
path. In other words, this paper defines and solves for geodesics directly on
the shape space and avoids complications resulting from the quotient operation.
This comprehensive framework is invariant to arbitrary parameterizations of
surfaces along paths, a phenomenon termed as gauge invariance. Additionally,
this paper makes a link between different elastic metrics used in the computer
science literature on one hand, and the mathematical literature on the other
hand, and provides a geometrical interpretation of the terms involved. Examples
using real and simulated 3D objects are provided to help illustrate the main
ideas.Comment: 15 pages, 11 Figures, to appear in IEEE Transactions on Pattern
Analysis and Machine Intelligence in a better resolutio
A relaxed approach for curve matching with elastic metrics
In this paper we study a class of Riemannian metrics on the space of
unparametrized curves and develop a method to compute geodesics with given
boundary conditions. It extends previous works on this topic in several
important ways. The model and resulting matching algorithm integrate within one
common setting both the family of -metrics with constant coefficients and
scale-invariant -metrics on both open and closed immersed curves. These
families include as particular cases the class of first-order elastic metrics.
An essential difference with prior approaches is the way that boundary
constraints are dealt with. By leveraging varifold-based similarity metrics we
propose a relaxed variational formulation for the matching problem that avoids
the necessity of optimizing over the reparametrization group. Furthermore, we
show that we can also quotient out finite-dimensional similarity groups such as
translation, rotation and scaling groups. The different properties and
advantages are illustrated through numerical examples in which we also provide
a comparison with related diffeomorphic methods used in shape registration.Comment: 27 page
A Mathematical Framework for Protein Structure Comparison
Comparison of protein structures is important for revealing the evolutionary relationship among proteins, predicting protein functions and predicting protein structures. Many methods have been developed in the past to align two or multiple protein structures. Despite the importance of this problem, rigorous mathematical or statistical frameworks have seldom been pursued for general protein structure comparison. One notable issue in this field is that with many different distances used to measure the similarity between protein structures, none of them are proper distances when protein structures of different sequences are compared. Statistical approaches based on those non-proper distances or similarity scores as random variables are thus not mathematically rigorous. In this work, we develop a mathematical framework for protein structure comparison by treating protein structures as three-dimensional curves. Using an elastic Riemannian metric on spaces of curves, geodesic distance, a proper distance on spaces of curves, can be computed for any two protein structures. In this framework, protein structures can be treated as random variables on the shape manifold, and means and covariance can be computed for populations of protein structures. Furthermore, these moments can be used to build Gaussian-type probability distributions of protein structures for use in hypothesis testing. The covariance of a population of protein structures can reveal the population-specific variations and be helpful in improving structure classification. With curves representing protein structures, the matching is performed using elastic shape analysis of curves, which can effectively model conformational changes and insertions/deletions. We show that our method performs comparably with commonly used methods in protein structure classification on a large manually annotated data set
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.Comment: 25 pages, 16 figures, 1 tabl
Numerical inversion of SRNFs for efficient elastic shape analysis of star-shaped objects
The elastic shape analysis of surfaces has proven useful in several application areas, including medical image analysis, vision, and graphics. This approach is based on defining new mathematical representations of parameterized surfaces, including the square root normal field (SRNF), and then using the L2 norm to compare their shapes. Past work is based on using the pullback of the L2 metric to the space of surfaces, performing statistical analysis under this induced Riemannian metric. However, if one can estimate the inverse of the SRNF mapping, even approximately, a very efficient framework results: the surfaces, represented by their SRNFs, can be efficiently analyzed using standard Euclidean tools, and only the final results need be mapped back to the surface space. Here we describe a procedure for inverting SRNF maps of star-shaped surfaces, a special case for which analytic results can be obtained. We test our method via the classification of 34 cases of ADHD (Attention Deficit Hyperactivity Disorder), plus controls, in the Detroit Fetal Alcohol and Drug Exposure Cohort study. We obtain state-of-the-art results
- …