Where can I find the computational complexity of the algorithms?

edit savecancel

Since the .h are used for the documentation, I guess if it was tehre it would be in also in the documentation, right? I have look at the paper, but it does not imply that I can have the complexy frrom that. This only depends on the implementation itself.

As I can see from brief view to the linked article the main complexity comes from matrix inversion and this matrix size is ~number of reference points. So one can assume that complexity is O(n^3). Sure there some other calculations but large matrix inversion is the most intensive. You can easily check this assumption plotting 'calculation time vs number of points' chart and fitting it by polynomial curve (or plotting it in semi-log scale and fitting by line). Anyway big-O notation is asymptotic estimation only, so for small N it can significantly deviates from 'ideal' polynomial form.

here there is a short list of implementations based on papers and publication... http://answers.opencv.org/question/73...