[Insight-users] ICP complexity

[Felix Bollenbeck]

Hi Luis,

Yes, that sounds plausible, thanks for your remarks, I actually 
considered reducing
surface vertices with energy based remeshing.

But:

ICP as far as I understood ICP, a) and b) are iterated until 
convercence, right? Do you
have any notion how many iterations are to be expected here?

Best Regards,

Felix.

Luis Ibanez wrote:
>
> Hi Felix,
>
> The computation time should be in the order
>
> a) O(N*M) : For the section that search for nearest point
>
>                and
>
> b) O(N) for the section that computes the actual metric value
>
>
>
> Where
>
> N = number of points in the Fixed Point Set
> M = number of points in the Moving Point Set
>
>
> BTW: please not that ICP is not expected to be
>      a symmetrical problem. Therefore, although
>      selecting the set of points with the least
>      number of points as the Fixed Point Set
>      may give you faster computation, it may
>      not necessarily give you the best registration.
>
>
>    Regards,
>
>
>       Luis
>
>
> ----------------------
> Felix Bollenbeck wrote:
>> Dear ITK User,
>>
>> I am currently working o a problem, involving a 3D correspondence 
>> problem identical to the ICP setting.
>>
>> For further directions I have question regarding the complexity of 
>> the (ITK) ICP algorithm:
>>
>> How does the computation time relate to the number of points roughly?
>>
>> Regards,
>>
>> Felix Bollenbeck.
>>
>
>


-- 
Felix Bollenbeck     		Email: bollen at ipk-gatersleben.de
Plant Bioinformatics Group      Phone: +49 (0)39482 5344
Leibniz Institute of Plant 	Fax  : +49 (0)39482 5137
Genetics and Crop Plant Research
Correnstr.3 	                http://www.ipk-gatersleben.de
06466 Gatersleben,Germany