Novel Methods for the Visualization and Analysis of Functional Maps in Cortex

Results 179 for all cases. However, the algorithm does not try to find displacement values for all control points (control points at the edges are sometimes not used). Table 3 shows the total time needed to perform ten iterations on different resolutions. This is the total time from the begin- ning to the end of the matching process, i.e., it includes initial calculations. The total time per checked control point is also given. Total time for 10 iterations in s (incl. initial calc.) Very low 33² = 1089 432 236 0.55 Low 65² = 4225 392 434 1.10 High 129² = 16641 411 1402 3.41 Table 3: Time of computation for different resolutions Again, the exemplary results presented in this section were for the algorithm that does a line search in one direction. To match ring images, the registration algorithm that does a line search in two directions should be used. That algorithm needs longer. Although the algorithm can achieve a reasonable result in less than three minutes – an example of such a result is presented in Figure 58 – the time of the matching procedure can still be shortened. Please refer to section 8.4.