
Data Trajectory SRV Geodesic
REML Geodesic Data Trajectory Predicted by REML (a*)
Predicted by SRV
Theory
Figure 1: Summary and results of the proposed approach. Left: A trajectory may follow a geodesic
as calculated by one metric but not follow a geodesic as calculated by another metric. Our paradigm
learns the elastic metric (parameterized by
a
) that best represents the data trajectory as a geodesic
on the manifold of discrete curves. Right: true cell trajectory overlaid with 1) cells predicted by
a regression which utilizes our paradigm’s learned metric parameter (
a∗
) 2) cells predicted by a
square-root-velocity (SRV) regression. Regression predictions using the SRV metric (red) do not
match the data trajectory (blue), but our algorithm’s
a∗
predicts the data trajectory perfectly: our
prediction (green) perfectly overlays the data trajectory (blue).
regular planar curves
C=C1([0,1],R2)
. Our metric learning approach will require us to calculate
distances between cell shapes in C. To do so, we introduce the concept of elastic metrics.
Elastic metrics
ARiemannian metric
g
on a manifold
C
is a set of smoothly varying inner products
defined on tangent spaces of
C
. These define geometric measurements on
C
, including distances,
geodesics and exponential maps. Geodesics on manifolds generalize straight lines on vector spaces:
they are curves that locally minimize the distance between points. Exponential maps generalize
addition on vector spaces.
We equip Cwith a family of elastic metrics ga,b parameterized by a, b > 0[9]:
ga,b
c(h, k) = a2Z1
0
hDsh, NihDsk, Nids+b2Z1
0
hDsh, T ihDsk, T ids, ∀c∈ C, h, k ∈TcC,(1)
where
c
is a cell outline (a point in
C
),
h, k
are infinitesimal deformations of
c
(tangent vectors in
TcC
),
Ds
is the derivative with respect to arc-length
s
along the curve
c
,
(T, N )
denote the unit
tangent and the unit normal to
c
, respectively, and
<, >
is the canonical Euclidean inner-product of
R2
. An elastic metric
ga,b
depends on two parameters: a “bending” parameter
b
and a “stretching”
parameter a, which respectively evaluate whether two curves are “bent” or “stretched” compared to
one another and then define how far apart these curves should be on
C
. For example, when
a
is large,
two curves that differ by a stretching operation will be far apart. When
b
is large, two curves that
differ by a bending operation will be far apart. Elastic metrics are invariant under shape-preserving
transformations, i.e., elements in the group
G
of 2D translations, 2D rotations, and re-scaling of
cell outlines [12]. As such, elastic metrics are well-defined on the space of curve shapes, which is
formally given by the quotient M=C1([0,1],R2)/G. The elastic metric with a= 1 and b= 0.5is
called the square-root-velocity (SRV) metric, and is often used as the “default metric” on the manifold
of discrete curves. For this reason, we will consider the statistical analysis with the SRV metric as a
baseline in our experiments.
Geodesic regression
Because
M
is a manifold, we consider geodesic regression, which is the
linear regression equivalent for manifolds. Geodesic regression on
(M, ga,b)
solves a least-square
fitting problem [5]:
min
(p,v)∈TM
T
X
i=1
d2Expp(tiv), ci,(2)
where
d
and
Exp
are the Riemannian distance and exponential maps associated with the metric
ga,b
.
When the metric is Euclidean, this expression simplifies to the usual linear regression with intercept
p
and slope
v
. In geodesic regression, choice of metric affects the goodness of fit. Because metrics
define distances between points in shape space, a data trajectory may follow the geodesic calculated
by one metric but not another. We design an algorithm that finds the "optimal" metric for regression
of a particular trajectory —the metric where the trajectory is closest to a geodesic, as judged by
the value of the coefficient of determination
R2
. This optimal metric gives the regression fit more
predictive power, which in the case of microscopy image analysis in cell biology can thus provide a
more accurate prediction of future cell shapes. We will perform metric learning across all possible
elastic metrics and compare our results to the commonly used SRV metric.
2