[Insight-users] ICP variants

[Ferdinando Rodriguez y Baena]

Dear Sam,

I have spent some considerable time trying to modify and adapt the simple 
ICP mechanism provided by ITK to my purposes (3D pointset to surface 
registration), but  without success. The Levenberg-Marquardt optimiser 
provided is not the most suitable for this purpose, and there is no easy way 
to modify it without getting into complex programming.
What you are trying to do is fairly straightforward if you implement your 
own version of the method, using ITK's basic structures for convenience 
(itkPointSet, itkMesh, etc.). I can give you a few pointers on how this can 
be done if you wish.

Good luck.

Ferdinando

Let me know
----- Original Message ----- 
From: "Sam Theisens" <Theisens.Sam at gmx.de>
To: <insight-users at itk.org>
Sent: Tuesday, November 02, 2004 9:08 PM
Subject: [Insight-users] ICP variants


> Hi everyone,
>
> Since the standard ICP implementation is not suitable for registering
> partially overlapping surfaces, I want to make some adjustments according 
> to
> Turk, G. and Levoy, M. In particular, I want to leave out point pairings
> from the cost function, for which the distances are bigger than a certain
> threshold, or where one of the points lies on the boundary of the surface.
>
> This means that the number of point distances that make up the metric will
> vary with each iteration. The optimizer needs a multiple
> valued cost function as input.
>
> The problem I am facing is that I cannot change the size of the cost
> function's array at each iteration. Does anybody have an idea on how to
> solve this? Or has anybody got any experience with making ICP variants in
> ITK?
> Thanks in advance!
>
> Sam Theisens
>
>
>
> _______________________________________________
> Insight-users mailing list
> Insight-users at itk.org
> http://www.itk.org/mailman/listinfo/insight-users