Bayesian estimation of templates in computational anatomy: Difference between revisions

Content deleted Content added
m clean up spacing around commas and other punctuation fixes, replaced: ,M → , M, ,R → , R, ,i → , i (2), ,v → , v (5), ,x → , x, , → , (4), ; → ; (2)
No edit summary
 
(3 intermediate revisions by 3 users not shown)
Line 1:
{{Further|LDDMMLarge |deformation diffeomorphic metric mapping|Bayesian model of computational anatomy}}
{{COI|date=December 2017}}
 
{{Main|Computational anatomy}}
 
[[Statistical shape analysis]] and [[Computational anatomy#Statistical shape theory in computational anatomy|statistical shape theory]] in [[computational anatomy]] (CA) is performed relative to templates, therefore it is a local theory of statistics on shape. [[Computational anatomy#Template Estimationestimation from Populationspopulations|Template estimation]] in [[computational anatomy]] from populations of observations is a fundamental operation ubiquitous to the discipline. Several methods for template estimation based on [[Bayesian probability|Bayesian]] probability and statistics in the [[Computational anatomy#The random orbit model of computational anatomy|random orbit model of CA]] have emerged for submanifolds<ref>{{Cite journal|title = A Bayesian Generative Model for Surface Template Estimation|journal = International Journal of Biomedical Imaging|date = 2010-01-01|issn = 1687-4188|pmc = 2946602|pmid = 20885934|pages = 1–14|volume = 2010|doi = 10.1155/2010/974957|first1 = Jun|last1 = Ma|first2 = Michael I.|last2 = Miller|first3 = Laurent|last3 = Younes|doi-access = free}}</ref><ref>{{Cite journal|title = Atlas Generation for Subcortical and Ventricular Structures with its Applications in Shape Analysis|journal = IEEE Transactions on Image Processing|date = 2010-06-01|issn = 1057-7149|pmc = 2909363|pmid = 20129863|pages = 1539–1547|volume = 19|issue = 6|doi = 10.1109/TIP.2010.2042099|first1 = Anqi|last1 = Qiu|first2 = Timothy|last2 = Brown|first3 = Bruce|last3 = Fischl|first4 = Jun|last4 = Ma|first5 = Michael I.|last5 = Miller|bibcode = 2010ITIP...19.1539Q}}</ref> and dense image volumes.<ref>{{Cite journal|title = Bayesian Template Estimation in Computational Anatomy|journal = NeuroImage|date = 2008-08-01|issn = 1053-8119|pmc = 2602958|pmid = 18514544|pages = 252–261|volume = 42|issue = 1|doi = 10.1016/j.neuroimage.2008.03.056|first1 = Jun|last1 = Ma|first2 = Michael I.|last2 = Miller|first3 = Alain|last3 = Trouvé|first4 = Laurent|last4 = Younes}}</ref>
 
== The deformable template model of shapes and forms via diffeomorphic group actions ==
Line 29:
== Geodesic positioning via the Riemannian exponential ==
For the study of deformable shape in CA, a more general diffeomorphism group has been the group of choice, which is the infinite dimensional analogue. The high-dimensional diffeomorphism groups used in computational anatomy are generated via smooth flows <math> \phi_t, t \in [0,1] </math> which satisfy the Lagrangian and Eulerian specification of the flow fields satisfying the ordinary differential equation: [[File:Lagrangian flow.png|thumb|Showing the Lagrangian flow of coordinates <math>x \in X</math> with associated vector fields <math>v_t, t \in [0,1]</math> satisfying ordinary differential equation <math>\dot \phi_t = v_t(\phi_t), \phi_0=id</math>.]]
: {{NumBlk|:|<math>
\frac{d}{dt} \phi_t = v_t \circ \phi_t , \ \phi_0 = id \ ; </math>|{{EquationRef|Lagrangian flow}}}}
with <math> v \doteq (v_1,v_2,v_3) </math> the vector fields on <math> {\mathbb R}^3 </math> termed the [[Lagrangian and Eulerian specification of the flow field|Eulerian]] velocity of the particles at position <math>\phi</math> of the flow. The vector fields are functions in a function space, modelled as a smooth [[Hilbert space|Hilbert]] space with the vector fields having 1-continuous derivative . For <math>v_t = \dot \phi_t \circ \phi_t^{-1}, t \in [0,1]</math>, with the inverse for the flow given by
 
: {{NumBlk|:|<math>
\frac{d}{dt} \phi_t^{-1} = -(D \phi_t^{-1}) v_t, \ \phi_0^{-1} = id \ , </math>|{{EquationRef|Eulerianflow}}}}
and the <math>3 \times 3</math> Jacobian matrix for flows in <math>\mathbb{R}^3</math> given as <math> \ D\phi \doteq \left(\frac{\partial \phi_i}{\partial x_j}\right). </math>
Line 78:
In the [[Computational anatomy#The random orbit model of computational anatomy|Bayesian random orbit model of computational anatomy]] the observed MRI images <math>I^{D_i}</math> are modelled as a conditionally Gaussian random field with mean field <math>\phi_i \cdot I</math>, with <math>\phi_i</math> a random unknown transformation of the template. The MAP estimation problem is to estimate the unknown template <math> I \in \mathcal{I}</math> given the observed MRI images.
 
Ma's procedure for dense imagery takes an initial hypertemplate <math> I_0 \in \mathcal{I} </math> as the starting point, and models the template in the orbit under the unknown to be estimated diffeomorphism <math> I \doteq \phi_0 \cdot I_0 </math>. The observables are modelled as conditional random fields, <math> I^{D_i} </math> a {{EquationNote|conditional-Gaussian}} random field with mean field <math> \phi_i \cdot I \doteq \phi_i \cdot \phi_0 \cdot I_0 </math>. The unknown variable to be estimated explicitly by MAP is the mapping of the hyper-template <math> \phi_0</math>, 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]]expectation–maximization algorithm|expectation–maximization (EM) algorithm]].
 
The orbit-model is exploited by associating the unknown to be estimated flows to their log-coordinates <math>v_i,i=1,\dots</math> [[Computational anatomy#Riemannian exponential (geodesic positioning) and Riemannian logarithm (geodesic coordinates)|via the Riemannian geodesic log and exponential]] for [[computational anatomy]] the initial vector field in the tangent space at the identity so that <math> \mathrm{Exp}_\mathrm{id}(v_{i}) \doteq \phi_i </math>, with <math> \mathrm{Exp}_\mathrm{id}(v_{0}) </math> the mapping of the hyper-template.