Stefan Sommer
Professor at Department of Computer Science, University of Copenhagen
Faculty of Science, University of Copenhagen
Stefan Sommer
Department of Computer Science, University of Copenhagen
ϕ
Session 1: (L 9-9:45) Shape analysis and actions of the diffeomorphism group
Session 2: (E 10-10:45) Landmark analysis in Theano Geometry
Session 3: (L 11-11:45) Linear representations and random orbit model
Session 4: (E 12:30-13:15) Landmarks statistics in Theano Geometry
Session 5: (L 13:30-14:15) Shape spaces of images, curves and surfaces
Session 6: (E 14:30-15:15) Analysis of continuous shapes
ϕ∈Diff(Ω) diffeomorphism of domain Ω
ϕ
Variational problem to find optimal ϕ∈G:
ϕt:[0,T]→Diff(Ω) path of diffeomorphisms (parameter t)
Constructing diffeomorphisms:
Forward flow:
dtdϕ(x,t)=v(ϕ(x,t),t), ∀x∈Ω
ϕ(x,0)=x
ϕt∈G=Diff(Ω)
vt is a vector field on Ω: v∈V⊂X
It is the Eulerian velocity that controls the flow
The family vt, t∈[0,T] determines the flow
Variational problem:
Es0,s1(ϕ)=minϕtR(ϕt)+λ1S(ϕT.s0,s1)
R(ϕt):=∫0T∥∂tϕt∥ϕt2dt, vt=∂tϕt∘ϕt−1
So we need a norm on V for defining ∥∂tϕt∥ϕt=∥vt∥
Norm on V is defined via a Reproducible Kernel Hilbert Space (RKHS) structure
Velocity v
Momentum m=Lv (recall: p for landmarks)
L is the momentum operator L:V→V∗
Kernel K is the inverse momentum: K=L−1
K is as well a matrix-valued function on Ω×Ω: K:Ω×Ω→Rd×d
e.g. K(x,y)=αe−2σ2∥x−y∥2
Kernel K is the inverse momentum: K=L−1
K is as well a matrix-valued function on Ω×Ω: K:Ω×Ω→Rd×d
e.g. K(x,y)=αe−2σ2∥x−y∥2
For a∈Rd, K(⋅,x)a∈V
⟨K(⋅,x)a,K(⋅,y)b⟩=aTK(x,y)b
V is the completion of finite linear combination of K(⋅,x)a
V is embedded in L2(Ω,Rd)
V is the completion of finite linear combination of K(⋅,x)a
V is embedded in L2(Ω,Rd)
vector w∈L2(Ω,Rd) gives covector
v↦∫Ωw(x)Tv(x)dx
velocity vectors vt are often smooth
momenta mt=Lvt are often rough
e.g. Dirac deltas:
vt=∑i=1NK(⋅,xi)ai
mt=∑i=1Nai⊗δxi(⋅) i.e. landmark momenta pi=ai⊗δxi(⋅)
The norm ∥∂tϕt∥ϕt2 determines a Riemannian metric (that's why we draw G curved)
Riemannian geodesics, length/energy minimizing:
ϕt=argminϕt∫0T∥∂tϕt∥ϕt2dt
v0=∂tϕt∣t=0 determines evolution
Exp:V→G endpoint map
Log:G→V initial velocity map
π is a Riemannian submersion
it induces a Riemannian metric on S
Geodesics on S lift to
horizontal geodesics on G
Horizontal geodesics on G
project to geodesics on S
Those were the landmark geodesics
But we can do this for any shape space
Exp/Log maps are defined on S as well
V is a vector space (infinite dimensional)
We can perform regular statistics on V
Normal distribution N(0,Σ) maps to distribution Exp∗N(0,Σ) on G - random orbits
Data s1,…,sN can be analysed
in V: vi=Log(si)
Template estimation (mean shape/image):
s0=argmins∈Si=1∑nd(s,si)2
Geodesic distance on S:
d(s,si)=ϕt,ϕT.s=siargmin∫0T∥vt∥2dt
Tangent space Principal Component Analysis:
PCA(Log(s0,s1),…,Log(s0,sn))
e.g. Riemannian Brownian motion
Exercise session:
hint: use a low number of landmarks to reduce computation time
By Stefan Sommer
Professor at Department of Computer Science, University of Copenhagen