Difference between revisions of "2008 Winter Project Week GroupwiseReg"

From NAMIC Wiki
Jump to: navigation, search
Line 19: Line 19:
 
<h1>Objective</h1>
 
<h1>Objective</h1>
  
−
The goal of this project is to expand the NAMIC Software Kit with the addition of an image-based atlas
+
The goal of this project is to come up with an efficient registration code using B-Splines as a deformation model.
−
building algorithm that was developed by Polina Golland’s lab at MIT. The basic functionality of this software will
+
We explore the space of different optimization schemes e.g. caching, sparsity and memory-speed trade-off's.
−
be demonstrated to the NAMIC community at the January 2008 NAMIC all-hands meeting. A secondary
 
−
goal is to begin the process of gathering usability and interface requests from targeted clinical collaborators.
 
−
It is intended that users’ requests will be incorporated in to a future project aimed at tailoring this software
 
−
for widespread NAMIC use.
 
−
 
 
−
See our [[Projects:GroupwiseRegistration| Algorithm Project Page]] for more details.
 
  
 
</div>
 
</div>
Line 34: Line 28:
 
<h1>Approach, Plan </h1>
 
<h1>Approach, Plan </h1>
  
−
The registration algorithms are already available as C++ sourcecode. We plan to integrate them into the NAMIC community by:
+
We run benchmark experiments in the special case of itkMattesMutualInformation implementation.
 +
The current implementation in ITK uses caching of B-Spline coefficient in order to speed-up
 +
the registration. Also the sparsity of B-Spline coefficient updates are taken into account, yielding
 +
and efficient implementation.
  
−
*Adapt sourcecode to utilize the command-line parsing mechanism that was designed for Slicer3 external modules.  
+
The drawback of caching is the use of high amounts of memory.  
−
*Create a simple Slicer3 graphical user interface (external module) that allows a user to generate an atlas from their data.
+
We compare the performance of caching vs. not-caching(computing the coefficients on the fly)
−
*User Feedback. During the January 2008 NAMIC all-hands meeting we will solicit feedback on this project from potential collaborators.
+
by deactivating caching code in itkMattesMutualInformation .
  
 
</div>
 
</div>

Revision as of 15:03, 11 January 2008

Home < 2008 Winter Project Week GroupwiseReg
Return to 2008_Winter_Project_Week
Figure 1: On the left is shown a stack of images and a sample pixel stack around a cortical region. On the left is shown the Gaussian(blue) fittet to a real sample from the dataset we used along with the non-parametric density estimate(red). Note that the distribution is bi-modal because of white matter-gray matter transaction.


Key Investigators

  • MIT: Serdar Balci, Polina Golland
  • Kitware: Brad Davis
  • SCI: Casey Goodlett

Objective

The goal of this project is to come up with an efficient registration code using B-Splines as a deformation model. We explore the space of different optimization schemes e.g. caching, sparsity and memory-speed trade-off's.

Approach, Plan

We run benchmark experiments in the special case of itkMattesMutualInformation implementation. The current implementation in ITK uses caching of B-Spline coefficient in order to speed-up the registration. Also the sparsity of B-Spline coefficient updates are taken into account, yielding and efficient implementation.

The drawback of caching is the use of high amounts of memory. We compare the performance of caching vs. not-caching(computing the coefficients on the fly) by deactivating caching code in itkMattesMutualInformation .

Progress


Jan 2008 Project Week



References

  • S.K. Balci, P. Golland, M.E. Shenton, W.M. Wells III. Free-Form B-spline Deformation Model for Groupwise Registration. In Proceedings of MICCAI 2007 Statistical Registration Workshop: Pair-wise and Group-wise Alignment and Atlas Formation, 23-30, 2007.
Retrieved from "https://www.na-mic.org/w/index.php?title=2008_Winter_Project_Week_GroupwiseReg&oldid=21187"