[Insight-users] Registration with a deformation field

[Jochen Cammin]

Hi Andreas,

You could try the Daemons algorithm. It should be much faster but a 
(potential) disadvantage is that the resulting deformation field is not 
necessary smooth - unless you switch on the deformation field smoothing.

There are examples DeformableRegistration2.cxx, 
DeformableRegistration3.cxx (and others) in the Examples/Registration/ 
directory.

Cheers,
Jochen

On 5/14/2010 10:26 AM, Merrem, Andreas wrote:
> Hello,
>
> I tried to implement a registration algorithm in the itk framework with
> a deformation field as a transform for a 256X256 2D image.
>
> This field should be displacement vector for each pixel using all image
> pixels as grid points (i.e. 2*number of pixels degrees of freedom) and a
> gradient descent optimizer. It worked with the B-spline transform class,
> but it was really slow (2 minutes per optimizer iteration). I'm not sure
> if that was because B-spline class somehow makes the program compute
> splines for interpolation although there are no points in between the
> grid points. Does anyone know a faster way of implementing a deformation
> field?
>
> Thank you for your help,
>
> Andreas
>