- Source: Bayesian model of computational anatomy
Computational anatomy (CA) is a discipline within medical imaging focusing on the study of anatomical shape and form at the visible or gross anatomical scale of morphology.
The field is broadly defined and includes foundations in anatomy, applied mathematics and pure mathematics, including medical imaging, neuroscience, physics, probability, and statistics. It focuses on the anatomical structures being imaged, rather than the medical imaging devices.
The central focus of the sub-field of computational anatomy within medical imaging is mapping information across anatomical coordinate systems most often dense information measured within a magnetic resonance image (MRI). The introduction of flows into CA, which are akin to the equations of motion used in fluid dynamics, exploit the notion that dense coordinates in image analysis follow the Lagrangian and Eulerian equations of motion. In models based on Lagrangian and Eulerian flows of diffeomorphisms, the constraint is associated to topological properties, such as open sets being preserved, coordinates not crossing implying uniqueness and existence of the inverse mapping, and connected sets remaining connected. The use of diffeomorphic methods grew quickly to dominate the field of mapping methods post Christensen's
original paper, with fast and symmetric methods becoming available.
The main statistical model
The central statistical model of Computational Anatomy in the context of medical imaging has been the source-channel model of Shannon theory; the source is the deformable template of images
I
∈
I
{\displaystyle I\in {\mathcal {I}}}
, the channel outputs are the imaging sensors with observables
I
D
∈
I
D
{\displaystyle I^{D}\in {\mathcal {I}}^{\mathcal {D}}}
(see Figure). The importance of the source-channel model is that the variation in the anatomical configuration are modelled separated from the sensor variations of the Medical imagery. The Bayes theory dictates that the model is characterized by the prior on the source,
π
I
(
⋅
)
{\displaystyle \pi _{\mathcal {I}}(\cdot )}
on
I
∈
I
{\displaystyle I\in {\mathcal {I}}}
, and the conditional density on the observable
p
(
⋅
∣
I
)
on
I
D
∈
I
D
{\displaystyle p(\cdot \mid I){\text{ on }}I^{D}\in {\mathcal {I}}^{\mathcal {D}}}
conditioned on
I
∈
I
{\displaystyle I\in {\mathcal {I}}}
.
In deformable template theory, the images are linked to the templates, with the deformations a group which acts on the template;
see group action in computational anatomy
For image action
I
(
g
)
≐
g
⋅
I
t
e
m
p
,
g
∈
G
{\displaystyle I(g)\doteq g\cdot I_{\mathrm {temp} },g\in {\mathcal {G}}}
, then the prior on the group
π
G
(
⋅
)
{\displaystyle \pi _{\mathcal {G}}(\cdot )}
induces the prior on images
π
I
(
⋅
)
{\displaystyle \pi _{\mathcal {I}}(\cdot )}
, written as densities the log-posterior takes the form
log
p
(
I
(
g
)
∣
I
D
)
≃
log
p
(
I
D
∣
I
(
g
)
)
+
log
π
G
(
g
)
.
{\displaystyle \log p(I(g)\mid I^{D})\simeq \log p(I^{D}\mid I(g))+\log \pi _{\mathcal {G}}(g).}
The random orbit model which follows specifies how to generate the group elements and therefore the random spray of objects which form the prior distribution.
The random orbit model of computational anatomy
The random orbit model of Computational Anatomy first appeared in modelling the change in coordinates associated to the randomness of the group acting on the templates, which induces the randomness on the source of images in the anatomical orbit of shapes and forms and resulting observations through the medical imaging devices. Such a random orbit model in which randomness on the group induces randomness on the images was examined for the Special Euclidean Group for object recognition in which the group element
g
∈
G
{\displaystyle g\in {\mathcal {G}}}
was the special Euclidean group in.
For the study of deformable shape in CA, the high-dimensional diffeomorphism groups used in computational anatomy are generated via smooth flows
φ
t
,
t
∈
[
0
,
1
]
{\displaystyle \varphi _{t},t\in [0,1]}
which satisfy the Lagrangian and Eulerian specification of the flow fields satisfying the ordinary differential equation:
with
v
≐
(
v
1
,
v
2
,
v
3
)
{\displaystyle v\doteq (v_{1},v_{2},v_{3})}
the vector fields on
R
3
{\displaystyle {\mathbb {R} }^{3}}
termed the Eulerian velocity of the particles at position
φ
{\displaystyle \varphi }
of the flow. The vector fields are functions in a function space, modelled as a smooth Hilbert space with the vector fields having 1-continuous derivative . For
v
t
=
φ
˙
t
∘
φ
t
−
1
,
t
∈
[
0
,
1
]
{\displaystyle v_{t}={\dot {\varphi }}_{t}\circ \varphi _{t}^{-1},t\in [0,1]}
, the inverse of the flow is given by
and the
3
×
3
{\displaystyle 3\times 3}
Jacobian matrix for flows in
R
3
{\displaystyle \mathbb {R} ^{3}}
given as
D
φ
≐
(
∂
φ
i
∂
x
j
)
.
{\displaystyle \ D\varphi \doteq \left({\frac {\partial \varphi _{i}}{\partial x_{j}}}\right).}
To ensure smooth flows of diffeomorphisms with inverse, the vector fields
R
3
{\displaystyle {\mathbb {R} }^{3}}
must be at least 1-time continuously differentiable in space which are modelled as elements of the Hilbert space
(
V
,
‖
⋅
‖
V
)
{\displaystyle (V,\|\cdot \|_{V})}
using the Sobolev embedding theorems so that each element
v
i
∈
H
0
3
,
i
=
1
,
2
,
3
,
{\displaystyle v_{i}\in H_{0}^{3},i=1,2,3,}
has 3-square-integrable derivatives. Thus
(
V
,
‖
⋅
‖
V
)
{\displaystyle (V,\|\cdot \|_{V})}
embed smoothly in 1-time continuously differentiable functions. The diffeomorphism group are flows with vector fields absolutely integrable in Sobolev norm:
where
‖
v
t
‖
V
2
≐
∫
X
A
v
t
⋅
v
t
d
x
{\displaystyle \|v_{t}\|_{V}^{2}\doteq \int _{X}Av_{t}\cdot v_{t}dx}
with
A
{\displaystyle A}
a linear operator
A
:
V
↦
V
∗
{\displaystyle A:V\mapsto V^{*}}
defining the norm of the RKHS. The integral is calculated by integration by parts when
A
v
{\displaystyle Av}
is a generalized function in the dual space
V
∗
{\displaystyle V^{*}}
.
= Riemannian exponential
=In the random orbit model of computational anatomy, the entire flow is reduced to the initial condition which forms the coordinates encoding the diffeomorphism. From the initial condition
v
0
{\displaystyle v_{0}}
then geodesic positioning with respect to the Riemannian metric of Computational anatomy solves for the flow of the Euler-Lagrange equation.
Solving the geodesic from the initial condition
v
0
{\displaystyle v_{0}}
is termed the Riemannian-exponential, a mapping
Exp
i
d
(
⋅
)
:
V
→
Diff
V
{\displaystyle \operatorname {Exp} _{\mathrm {id} }(\cdot ):V\to \operatorname {Diff} _{V}}
at identity to the group.
The Riemannian exponential satisfies
Exp
i
d
(
v
0
)
=
φ
1
{\displaystyle \operatorname {Exp} _{\mathrm {id} }(v_{0})=\varphi _{1}}
for initial condition
φ
˙
0
=
v
0
{\displaystyle {\dot {\varphi }}_{0}=v_{0}}
, vector field dynamics
φ
˙
t
=
v
t
∘
φ
t
,
t
∈
[
0
,
1
]
{\displaystyle {\dot {\varphi }}_{t}=v_{t}\circ \varphi _{t},t\in [0,1]}
,
for classical equation diffeomorphic shape momentum
∫
X
A
v
t
⋅
w
d
x
{\displaystyle \int _{X}Av_{t}\cdot w\,dx}
,
A
v
∈
V
{\displaystyle Av\in V}
, then
d
d
t
A
v
t
+
(
D
v
t
)
T
A
v
t
+
(
D
A
v
t
)
v
t
+
(
∇
⋅
v
)
A
v
t
=
0
;
{\displaystyle {\frac {d}{dt}}Av_{t}+(Dv_{t})^{T}Av_{t}+(DAv_{t})v_{t}+(\nabla \cdot v)Av_{t}=0\ ;}
for generalized equation, then
A
v
∈
V
∗
{\displaystyle Av\in V^{*}}
,
w
∈
V
{\displaystyle w\in V}
∫
X
d
d
t
A
v
t
⋅
w
d
x
+
∫
X
A
v
t
⋅
(
(
D
v
t
)
w
−
(
D
w
)
v
t
)
d
x
=
0.
{\displaystyle \int _{X}{\frac {d}{dt}}Av_{t}\cdot w\,dx+\int _{X}Av_{t}\cdot ((Dv_{t})w-(Dw)v_{t})\,dx=0.}
It is extended to the entire group,
φ
=
Exp
φ
(
v
0
∘
φ
)
≐
Exp
i
d
(
v
0
)
∘
φ
.
{\displaystyle \varphi =\operatorname {Exp} _{\varphi }(v_{0}\circ \varphi )\doteq \operatorname {Exp} _{\mathrm {id} }(v_{0})\circ \varphi .}
Depicted in the accompanying figure is a depiction of the random orbits around each exemplar,
m
0
∈
M
{\displaystyle m_{0}\in {\mathcal {M}}}
, generated by randomizing the flow by generating the initial tangent space vector field at the identity
v
0
∈
V
{\displaystyle v_{0}\in V}
, and then generating random object
n
≐
Exp
i
d
(
v
0
)
⋅
m
0
∈
M
{\displaystyle n\doteq \operatorname {Exp} _{\mathrm {id} }(v_{0})\cdot m_{0}\in {\mathcal {M}}}
.
Shown in the Figure on the right the cartoon orbit, are a random spray of the subcortical manifolds generated by randomizing the vector fields
v
0
{\displaystyle v_{0}}
supported over the submanifolds. The random orbit model induces the prior on shapes and images
I
∈
I
{\displaystyle I\in {\mathcal {I}}}
conditioned on a particular atlas
I
a
∈
I
{\displaystyle I_{a}\in {\mathcal {I}}}
. For this the generative model generates the mean field
I
{\displaystyle I}
as a random change in coordinates of the template according to
I
≐
φ
⋅
I
a
{\displaystyle I\doteq \varphi \cdot I_{a}}
, where the diffeomorphic change in coordinates is generated randomly via the geodesic flows.
MAP estimation in the multiple-atlas orbit model
The random orbit model induces the prior on shapes and images
I
∈
I
{\displaystyle I\in {\mathcal {I}}}
conditioned on a particular atlas
I
a
∈
I
{\displaystyle I_{a}\in {\mathcal {I}}}
. For this the generative model generates the mean field
I
{\displaystyle I}
as a random change in coordinates of the template according to
I
≐
φ
⋅
I
a
{\displaystyle I\doteq \varphi \cdot I_{a}}
, where the diffeomorphic change in coordinates is generated randomly via the geodesic flows. The prior on random transformations
π
D
i
f
f
(
d
φ
)
{\displaystyle \pi _{\mathrm {Diff} }(d\varphi )}
on
Diff
V
{\displaystyle \operatorname {Diff} _{V}}
is induced by the flow
Exp
i
d
(
v
)
{\displaystyle \operatorname {Exp} _{\mathrm {id} }(v)}
, with
v
∈
V
{\displaystyle v\in V}
constructed as a Gaussian random field prior
π
V
(
d
v
)
{\displaystyle \pi _{V}(dv)}
. The density on the random observables at the output of the sensor
I
D
∈
I
D
{\displaystyle I^{D}\in {\mathcal {I}}^{D}}
are given by
p
(
I
D
∣
I
a
)
=
∫
V
p
(
I
D
∣
Exp
i
d
(
v
)
⋅
I
a
)
π
V
(
d
v
)
.
{\displaystyle p(I^{D}\mid I_{a})=\int _{V}p(I^{D}\mid \operatorname {Exp} _{\mathrm {id} }(v)\cdot I_{a})\pi _{V}(dv)\ .}
Maximum a posteriori estimation (MAP) estimation is central to modern statistical theory. Parameters of interest
θ
∈
Θ
{\displaystyle \theta \in \Theta }
take many forms including (i) disease type such as neurodegenerative or neurodevelopmental diseases, (ii) structure type such as cortical or subcortical structures in problems associated to segmentation of images, and (iii) template reconstruction from populations. Given the observed image
I
D
{\displaystyle I^{D}}
, MAP estimation maximizes the posterior:
θ
^
≐
arg
max
θ
∈
Θ
log
p
(
θ
∣
I
D
)
.
{\displaystyle {\hat {\theta }}\doteq \arg \max _{\theta \in \Theta }\log p(\theta \mid I^{D}).}
This requires computation of the conditional probabilities
p
(
θ
∣
I
D
)
=
p
(
I
D
,
θ
)
p
(
I
D
)
{\displaystyle p(\theta \mid I^{D})={\frac {p(I^{D},\theta )}{p(I^{D})}}}
. The multiple atlas orbit model randomizes over the denumerable set of atlases
{
I
a
,
a
∈
A
}
{\displaystyle \{I_{a},a\in {\mathcal {A}}\}}
. The model on images in the orbit take the form of a multi-modal mixture distribution
p
(
I
D
,
θ
)
=
∑
a
∈
A
p
(
I
D
,
θ
∣
I
a
)
π
A
(
a
)
.
{\displaystyle p(I^{D},\theta )=\sum _{a\in {\mathcal {A}}}p(I^{D},\theta \mid I_{a})\pi _{\mathcal {A}}(a)\ .}
The conditional Gaussian model has been examined heavily for inexact matching in dense images and for landmark matching.
= Dense emage matching
=Model
I
D
(
x
)
,
x
∈
X
{\displaystyle I^{D}(x),x\in X}
as a conditionally Gaussian random field conditioned, mean field,
φ
1
⋅
I
≐
I
(
φ
1
−
1
)
,
φ
1
∈
D
i
f
f
V
{\displaystyle \varphi _{1}\cdot I\doteq I(\varphi _{1}^{-1}),\varphi _{1}\in Diff_{V}}
. For uniform variance the endpoint error terms plays the role of the log-conditional (only a function of the mean field) giving the endpoint term:
= Landmark matching
=Model
Y
=
{
y
1
,
y
2
,
…
}
{\displaystyle Y=\{y_{1},y_{2},\dots \}}
as conditionally Gaussian with mean field
φ
1
(
x
i
)
,
i
=
1
,
2
,
…
,
φ
1
∈
Diff
V
{\displaystyle \varphi _{1}(x_{i}),i=1,2,\dots ,\varphi _{1}\in \operatorname {Diff} _{V}}
, constant noise variance independent of landmarks. The log-conditional (only a function of the mean field) can be viewed as the endpoint term:
−
log
p
(
I
D
∣
I
(
g
)
)
≃
E
(
φ
1
)
≐
1
2
σ
2
∑
i
‖
y
i
−
φ
1
(
x
i
)
‖
2
.
{\displaystyle -\log p(I^{D}\mid I(g))\simeq \operatorname {E} (\varphi _{1})\doteq {\frac {1}{2\sigma ^{2}}}\sum _{i}\|y_{i}-\varphi _{1}(x_{i})\|^{2}.}
MAP segmentation based on multiple atlases
The random orbit model for multiple atlases models the orbit of shapes as the union over multiple anatomical orbits generated from the group action of diffeomorphisms,
I
=
⋃
a
∈
A
Diff
V
⋅
I
a
{\displaystyle {\mathcal {I}}=\textstyle \bigcup _{a\in {\mathcal {A}}}\displaystyle \operatorname {Diff} _{V}\cdot I_{a}}
, with each atlas having a template and predefined segmentation field
(
I
a
,
W
a
)
,
a
=
a
1
,
a
2
,
…
{\displaystyle (I_{a},W_{a}),a=a_{1},a_{2},\ldots }
. incorporating the parcellation into anatomical structures of the coordinate of the MRI.. The pairs are indexed over the voxel lattice
I
a
(
x
i
)
,
W
a
(
x
i
)
,
x
i
∈
X
⊂
R
3
{\displaystyle I_{a}(x_{i}),W_{a}(x_{i}),x_{i}\in X\subset {\mathbb {R} }^{3}}
with an MRI image and a dense labelling of every voxel coordinate. The anatomical labelling of parcellated structures are manual delineations by neuroanatomists.
The Bayes segmentation problem is given measurement
I
D
{\displaystyle I^{D}}
with mean field and parcellation
(
I
,
W
)
{\displaystyle (I,W)}
, the anatomical labelling
θ
≐
W
{\displaystyle \theta \doteq W}
. mustg be estimated for the measured MRI image. The mean-field of the observable
I
D
{\displaystyle I^{D}}
image is modelled as a random deformation from one of the templates
I
≐
φ
⋅
I
a
{\displaystyle I\doteq \varphi \cdot I_{a}}
, which is also randomly selected,
A
=
a
{\displaystyle A=a}
,. The optimal diffeomorphism
φ
∈
G
{\displaystyle \varphi \in {\mathcal {G}}}
is hidden and acts on the background space of coordinates of the randomly selected template image
I
a
{\displaystyle I_{a}}
. Given a single atlas
a
{\displaystyle a}
, the likelihood model for inference is determined by the joint probability
p
(
I
D
,
W
∣
A
=
a
)
{\displaystyle p(I^{D},W\mid A=a)}
; with multiple atlases, the fusion of the likelihood functions yields the multi-modal mixture model with the prior averaging over models.
The MAP estimator of segmentation
W
a
{\displaystyle W_{a}}
is the maximizer
max
W
log
p
(
W
∣
I
D
)
{\displaystyle \max _{W}\log p(W\mid I^{D})}
given
I
D
{\displaystyle I^{D}}
, which involves the mixture over all atlases.
W
^
≐
arg
max
W
log
p
(
I
D
,
W
)
with
p
(
I
D
,
W
)
=
∑
a
∈
A
p
(
I
D
,
W
∣
A
=
a
)
π
A
(
a
)
.
{\displaystyle {\hat {W}}\doteq \arg \textstyle \max _{W}\displaystyle \log p(I^{D},W){\text{ with }}p(I^{D},W)=\textstyle \sum _{a\in {\mathcal {A}}}\displaystyle p(I^{D},W\mid A=a)\pi _{A}(a).}
The quantity
p
(
I
D
,
W
)
{\displaystyle p(I^{D},W)}
is computed via a fusion of likelihoods from multiple deformable atlases, with
π
A
(
a
)
{\displaystyle \pi _{A}(a)}
being the prior probability that the observed image evolves from the specific template image
I
a
{\displaystyle I_{a}}
.
The MAP segmentation can be iteratively solved via the expectation–maximization algorithm
W
new
≐
arg
max
W
∫
log
p
(
W
,
I
D
,
A
,
φ
)
d
p
(
A
,
φ
∣
W
old
,
I
D
)
.
{\displaystyle W^{\text{new}}\doteq \arg \max _{W}\int \log p(W,I^{D},A,\varphi )\,dp(A,\varphi \mid W^{\text{old}},I^{D}).}
MAP estimation of volume templates from populations and the EM algorithm
Generating templates empirically from populations is a fundamental operation ubiquitous to the discipline.
Several methods based on Bayesian statistics have emerged for submanifolds and dense image volumes.
For the dense image volume case, given the observable
I
D
1
,
I
D
2
,
…
{\displaystyle I^{D_{1}},I^{D_{2}},\dots }
the problem is to estimate the template in the orbit of dense images
I
∈
I
{\displaystyle I\in {\mathcal {I}}}
. Ma's procedure takes an initial hypertemplate
I
0
∈
I
{\displaystyle I_{0}\in {\mathcal {I}}}
as the starting point, and models the template in the orbit under the unknown to be estimated diffeomorphism
I
≐
φ
0
⋅
I
0
{\displaystyle I\doteq \varphi _{0}\cdot I_{0}}
, with the parameters to be estimated the log-coordinates
θ
≐
v
0
{\displaystyle \theta \doteq v_{0}}
determining the geodesic mapping of the hyper-template
Exp
i
d
(
v
0
)
⋅
I
0
=
I
∈
I
{\displaystyle \operatorname {Exp} _{\mathrm {id} }(v_{0})\cdot I_{0}=I\in {\mathcal {I}}}
.
In the Bayesian random orbit model of computational anatomy the observed MRI images
I
D
i
{\displaystyle I^{D_{i}}}
are modelled as a conditionally Gaussian random field with mean field
φ
i
⋅
I
{\displaystyle \varphi _{i}\cdot I}
, with
φ
i
{\displaystyle \varphi _{i}}
a random unknown transformation of the template. The MAP estimation problem is to estimate the unknown template
I
∈
I
{\displaystyle I\in {\mathcal {I}}}
given the observed MRI images.
Ma's procedure for dense imagery takes an initial hypertemplate
I
0
∈
I
{\displaystyle I_{0}\in {\mathcal {I}}}
as the starting point, and models the template in the orbit under the unknown to be estimated diffeomorphism
I
≐
φ
0
⋅
I
0
{\displaystyle I\doteq \varphi _{0}\cdot I_{0}}
. The observables are modelled as conditional random fields,
I
D
i
{\displaystyle I^{D_{i}}}
a conditional-Gaussian random field with mean field
φ
i
⋅
I
≐
φ
i
⋅
φ
0
⋅
I
0
{\displaystyle \varphi _{i}\cdot I\doteq \varphi _{i}\cdot \varphi _{0}\cdot I_{0}}
. The unknown variable to be estimated explicitly by MAP is the mapping of the hyper-template
φ
0
{\displaystyle \varphi _{0}}
, with the other mappings considered as nuisance or hidden variables which are integrated out via the Bayes procedure. This is accomplished using the expectation–maximization algorithm.
The orbit-model is exploited by associating the unknown to be estimated flows to their log-coordinates
v
i
,
i
=
1
,
…
{\displaystyle v_{i},i=1,\dots }
via the Riemannian geodesic log and exponential for computational anatomy the initial vector field in the tangent space at the identity so that
Exp
i
d
(
v
i
)
≐
φ
i
{\displaystyle \operatorname {Exp} _{\mathrm {id} }(v_{i})\doteq \varphi _{i}}
, with
Exp
i
d
(
v
0
)
{\displaystyle \operatorname {Exp} _{\mathrm {id} }(v_{0})}
the mapping of the hyper-template.
The MAP estimation problem becomes
max
v
0
p
(
I
D
,
θ
=
v
0
)
=
∫
p
(
I
D
,
θ
=
v
0
∣
v
1
,
v
2
,
…
)
π
(
v
1
,
v
2
,
…
)
d
v
{\displaystyle \max _{v_{0}}p(I^{D},\theta =v_{0})=\int p(I^{D},\theta =v_{0}\mid v_{1},v_{2},\dots )\pi (v_{1},v_{2},\dots )\,dv}
The EM algorithm takes as complete data the vector-field coordinates parameterizing the mapping,
v
i
,
i
=
1
,
…
{\displaystyle v_{i},i=1,\dots }
and compute iteratively the conditional-expectation
{
Q
(
θ
=
v
0
;
θ
old
=
v
0
old
)
=
−
E
(
log
p
(
I
D
,
θ
=
v
0
∣
v
1
,
v
2
,
…
)
∣
I
D
,
θ
old
)
=
−
‖
(
I
¯
old
−
I
0
∘
Exp
i
d
(
v
0
)
−
1
)
β
old
‖
2
−
‖
v
0
‖
V
2
{\displaystyle {\begin{cases}Q(\theta =v_{0};\theta ^{\text{old}}=v_{0}^{\text{old}})&=-\operatorname {E} (\log p(I^{D},\theta =v_{0}\mid v_{1},v_{2},\dots )\mid I^{D},\theta ^{\text{old}})\\&=-\|({\bar {I}}^{\text{old}}-I_{0}\circ \operatorname {Exp} _{\mathrm {id} }(v_{0})^{-1}){\sqrt {\beta ^{\text{old}}}}\|^{2}-\|v_{0}\|_{V}^{2}\end{cases}}}
Compute new template maximizing Q-function, setting
θ
new
≐
v
0
new
=
arg
max
θ
=
v
0
Q
(
θ
;
θ
old
=
v
0
old
)
=
−
‖
(
I
¯
old
−
I
0
∘
Exp
i
d
(
v
0
)
−
1
)
β
old
‖
2
−
‖
v
0
‖
V
2
{\displaystyle \theta ^{\text{new}}\doteq v_{0}^{\text{new}}=\arg \max _{\theta =v_{0}}Q(\theta ;\theta ^{\text{old}}=v_{0}^{\text{old}})=-\left\|({\bar {I}}^{\text{old}}-I_{0}\circ \operatorname {Exp} _{\mathrm {id} }(v_{0})^{-1}){\sqrt {\beta ^{\text{old}}}}\right\|^{2}-\|v_{0}\|_{V}^{2}}
Compute the mode-approximation for the expectation updating the expected-values for the mode values:
v
i
new
=
arg
max
v
:
φ
˙
=
v
∘
φ
−
∫
0
1
‖
v
t
‖
V
2
d
t
−
‖
I
D
i
−
I
0
∘
Exp
i
d
(
v
0
old
)
−
1
∘
Exp
i
d
(
v
)
−
1
‖
2
.
i
=
1
,
2
,
…
{\displaystyle v_{i}^{\text{new}}=\arg \max _{v:{\dot {\varphi }}=v\circ \varphi }-\int _{0}^{1}\|v_{t}\|_{V}^{2}\,dt-\|I^{D_{i}}-I_{0}\circ \operatorname {Exp} _{\mathrm {id} }(v_{0}^{\text{old}})^{-1}\circ \operatorname {Exp} _{\mathrm {id} }(v)^{-1}\|^{2}.i=1,2,\dots }
β
new
(
x
)
=
∑
i
=
1
n
|
D
Exp
i
d
(
v
i
new
)
(
x
)
|
,
with
I
¯
new
(
x
)
=
∑
i
=
1
n
I
D
i
∘
Exp
i
d
(
v
i
new
)
|
D
Exp
i
d
(
v
i
new
)
(
x
)
|
β
old
(
x
)
{\displaystyle \beta ^{\text{new}}(x)=\sum _{i=1}^{n}|D\operatorname {Exp} _{\mathrm {id} }(v_{i}^{\text{new}})(x)|,{\text{ with }}{\bar {I}}^{\text{new}}(x)={\frac {\sum _{i=1}^{n}I^{D_{i}}\circ \operatorname {Exp} _{\mathrm {id} }(v_{i}^{\text{new}})|D\operatorname {Exp} _{\mathrm {id} }(v_{i}^{\text{new}})(x)|}{\beta ^{\text{old}}(x)}}}
References
Kata Kunci Pencarian:
- Evolusi manusia
- Bayesian model of computational anatomy
- List of things named after Thomas Bayes
- Computational anatomy
- Statistical shape analysis
- Bayesian estimation of templates in computational anatomy
- Computational neuroscience
- Shape analysis
- Neural network (machine learning)
- Computational biology
- Machine learning
