This is an old revision of this page, as edited by Mim.cis(talk | contribs) at 19:57, 13 February 2016(←Created page with '{{Userspace draft|source=ArticleWizard|date={{Subst:CURRENTMONTHNAME}} {{Subst:CURRENTYEAR}}}} {{Subst:Nul|<==do not change this line, it will set the date autom...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 19:57, 13 February 2016 by Mim.cis(talk | contribs)(←Created page with '{{Userspace draft|source=ArticleWizard|date={{Subst:CURRENTMONTHNAME}} {{Subst:CURRENTYEAR}}}} {{Subst:Nul|<==do not change this line, it will set the date autom...')
This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable.For guidance on developing this draft, see Wikipedia:So you made a userspace draft.
Finished writing a draft article? Are you ready to request an experienced editor review it for possible inclusion in Wikipedia? Submit your draft for review!
Beg's LDDMM for Dense Image Matching
In CA the geodesics and their coordinates are generated by solving inexact matching problems calculating the geodesic
flows of diffeomorphisms from their start point onto targets. Inexact matching has been examined in many cases and have come to be called Large Deformation Diffeomorphic Metric Mapping (LDDMM) originally solved for dense image matching by Faisal Beg for his PhD at Johns Hopkins University.[1] It was the first example in Computational Anatomy where a numerical code had been created whose fixed points satisfy the necessary conditions for geodesic shortest paths solving the Euler equatoin and minimizing the dense image matching problem for which Dupuis, Grenander and Miller[2] had derived the necessary Sobolev condition for existence of solutions of geodesic flows of diffeomorphisms in image matching. These methods have been extended to landmarks without registration via measure matching,[3] curves,[4] surfaces,[5][6] dense vector[7] and tensor [8] imagery, and varifolds removing orientation.[9]
The endpoint condition which Beg solved for dense image matching with action and endpoint deviation measured via the squared-error metric. In the dense image seting, the Eulerian momentum has a density so that the Euler equation for geodesic flows of diffeomorphisms in Computational Anatomy has a classical solution.
Dense image matching
Control Problem : The dense image matching problem satisfies the Euler equation with boundary condition at time t=1:
The conservation equation implies that with the necessary fixed endpoing condition, the initial condition on the momentum is given by
.
Dense image matching illustrates one of the two extremes of , the momentum having a vector density pointwise function, so that for
a vector function. For dense images the action implies we will requires the variation of the inverse with respect to for the chain rule calculation . This requires the identity following from the identity . This is for such function spaces the generalization of the classic matrix perturbation of the inverse.
Landmark matching with correspondence
Landmark matching demonstrates the singularity of as a generalized function or delta-distribution, since for landmarks, all of boundary mass is conscentrated on singular subsets of the volume space. The optimizer of Control Problem 1 satisfies the weak Euler equation for delta-distributions:
Notice this gives in particular the initial condition .
Taking ; conservation ,
. .
LDDMM for image and landmark matching: perturbation in the vector fields
The original large deformation diffeomorphic metric mapping (LDDMM) algorithms took variations with respect to the vector field parameterization of the group, since are in a vector spaces. Variations satisfy the necessary optimality conditions..
Beg solved the Control Problem for dense image matching maximizing with respect to the velocity field; as did Joshi for Landmark matching.
necessary conditions become where .
Joshi solved the landmark matching problem taking variations with respect ot the vector field:
;
necessary conditions become .
The perturbation in the vector field requires the identity which implies Take the variation in the vector fields using the chain rule which gives the first variation
.
Joshi solved the landmark matching problem optimizing with respect to the velocity field:
^Cite error: The named reference Vaillant 1149–1159 was invoked but never defined (see the help page).
^Vaillant, Marc; Glaunès, Joan (2005-01-01). "Surface matching via currents". Proceedings of Information Processing in Medical Imaging (IPMI 2005), number 3565 in Lecture Notes in Computer Science: 381–392.