Difference between revisions of "2013 Winter Project Week:Hybrid registration"
From NAMIC Wiki
Line 3: | Line 3: | ||
Image:PW-SLC2013.png|[[2013_Winter_Project_Week#Projects|Projects List]] | Image:PW-SLC2013.png|[[2013_Winter_Project_Week#Projects|Projects List]] | ||
</gallery> | </gallery> | ||
− | + | [[File:fixed-namic.png|thumb|center|Image Here]] | |
+ | [[File:moving-namic.png|thumb|center|Image Here]] | ||
==Key Investigators== | ==Key Investigators== | ||
* Nadya Shusharina, Greg Sharp, MGH | * Nadya Shusharina, Greg Sharp, MGH | ||
* Steve Pieper, Isomics | * Steve Pieper, Isomics | ||
− | + | ||
We propose to augment B-spline deformable registration with landmark information. Matching of landmarks is performed by the optimization procedure applied to the cost function containing an intensity-based data term and two constraints, smoothing and an explicit landmark matching. | We propose to augment B-spline deformable registration with landmark information. Matching of landmarks is performed by the optimization procedure applied to the cost function containing an intensity-based data term and two constraints, smoothing and an explicit landmark matching. |
Revision as of 02:24, 6 January 2013
Home < 2013 Winter Project Week:Hybrid registrationKey Investigators
- Nadya Shusharina, Greg Sharp, MGH
- Steve Pieper, Isomics
We propose to augment B-spline deformable registration with landmark information. Matching of landmarks is performed by the optimization procedure applied to the cost function containing an intensity-based data term and two constraints, smoothing and an explicit landmark matching.
Objective
- To develop the method to extend automatic algorithm of deformable image registration based on B-spline approximation
- The method includes landmark matching in the form of explicit landmark constraint
- The method is relevant for fast registrations that require matching of certain image features
Approach, Plan
- To introduce a command line module in Slicer 4 as a part of Plastimatch Registration model
- Try the algorithm on various data sets
Progress
- Progress here