2010 Summer Project Week Best Regularization Term for Demons Registration Algorithm

From NAMIC Wiki
Jump to: navigation, search
Home < 2010 Summer Project Week Best Regularization Term for Demons Registration Algorithm

Key Investigators

  • MGH: Rui Li, Greg Sharp

Objective

  • Show comparison of the demons algorithm performance with different regularization terms.

Approach, Plan

Our plan is to find a way to convert the current research code into an itk module that can be loaded into slicer.

Progress

The research code is a mixture of MATLAB and C code. Thanks to the discussion with Luis, we have successfully implemented itkCurvatureDemonsFilter.* and itkCurvatureDemonsFunction.* for a variant of the Demons algorithm with the curvature regularization term.

Our next steps after this project week are: (1). implement locally adaptive curvature based Demons algorithm. (2). implement Demons algorithm that uses L1-regularization term, this step will take more time and effort. itkPDEDeformableRegistrationFilter.* and itkPDEDeformableRegistrationFunction.* need to be rewritten.


Delivery Mechanism

All the implementations will be included into plastimatch.

References