![]() |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
![]() ![]() ![]() Next: Transitivity Error Up: Results Previous: Results Inverse Consistency ErrorThe inverse consistency error measures the degree to which the algorithms produced a consistent pointwise correspondence mapping between a pair of images. The average and maximum inverse consistency errors are computed using Eqs. 1 and 2. These error measures compare the composition of the forward and reverse transformations to the identity mapping and are minimized when the composed transformation equals the identity mapping. Figure 6 shows typical 2D phantom registration results using the unidirectional and inverse consistent registration algorithms. The result of transforming image A to B (see Fig. 3) using both registration algorithms is shown in column (a) and the absolute intensity difference between the deformed image A and the target image B is shown in column (b). These transformed images and intensity differences were typical of all 12 registrations3. Notice that both registration algorithms did a good job in matching image A to B. Figure 7 shows typical registration results using both algorithms for CT data. This figure shows that both algorithms did a good job matching the large infant head (CT A) to the small infant head (CT B) (see Fig. 4). Figure 8 demonstrates typical registration results when matching MRI brain data. Again the unidirectional and inverse consistent registration algorithms performed about the same with respect to absolute intensity differences. The absolute intensity difference images in Figures 6, 7, and 8 illustrate that one component of the registration error (as measured by intensity difference) occurs at the object edges. These figures also demonstrate that there is very little difference between the two registration algorithms with respect to the intensity mismatch. Therefore, it is not sufficient to measure the absolute intensity difference alone to evaluate the performance of the unidirectional and inverse consistent registration algorithms. One reason for this registration error at the object edges is due to the fact that the linear-elastic model can only accommodate global nonrigid shape differences. The misregistration at the edges is also due to the balancing of the similarity and the regularization terms in the minimization problems defined by Eqs. 5 and 7. This occurs in both the unidirectional and consistent linear-elastic algorithms because the regularization term prevents the template image from fully deforming into the target data. The performance of the unidirectional and inverse consistent registration algorithms can be distinguished by comparing the inverse consistency error of each algorithm. Figures 6, 9, and 10 show the spatial location of the inverse consistency error for the phantom, CT, and MRI experiments. Each figure shows the result of concatenating the A-to-B transformation with the B-to-A transformation. The spatial inverse consistency error shown in these figures are typical of the spatial inverse consistency error images for all the other registrations. The color bar associated with each set of results shows the range of the inverse consistency constraint error in pixels/voxels over the whole 2D or 3D image.
These experiments demonstrate that there are two primary sources of inverse consistent correspondence error. The first source of error occurs at the image edges and is due to the inability of the registration algorithm to completely match the borders. The second source of error occurs away from the image edges and is due to the linear-elastic regularization. The regularization error is much larger than the edge matching error and is reduced significantly by the constraining the forward and reverse transformations to be inverses of each other. The average and maximum inverse consistency errors for the phantom, CT, and MRI experiments are tabulated in Tables 1 and 2. Twenty additional MRI data sets were used to compile the values in Table 2. The results are reported for the whole domain of the images for each experiment and for specific regions of interest (ROI). The ROI for the CT experiment corresponded to voxels in the head above the Frankfort Horizontal (FH) and the ROI for the MRI experiment corresponded to the brain voxels. The CT ROI is important for pre-operative planing and post-operative evaluation for corrective craniofacial surgery. The MRI ROI was chosen because it is not important what the error is outside of the brain. Table 1 shows that there was a 46 and 60 times improvement with respect to the average and maximum inverse consistency error, respectively, when comparing the inverse consistent algorithm to the unidirectional algorithm for the phantom experiments. Likewise, the average and maximum inverse consistency error improved 8.6 and 24 times, respectively, using the inverse consistent constraint for the CT data. Table 2 shows both the ICC error and the squared intensity error between the deformed and target images. This table shows that the squared intensity error was similar (on average 6% less) between the unidirectional (UD) and the inverse consistent (IC) algorithms with the UD algorithm having slightly lower values than the IC algorithm. However, the maximum inverse consistency error over the entire image domain was on average 205 times smaller for the inverse consistent algorithm. These result demonstrates that there is a trade-off between reducing the registration error measured by the absolute intensity difference and the registration error measured by the inverse consistency error. In the current case, we were able to reduce the maximum inverse consistency error on average by 205 times while only increasing the squared intensity error on average by 6%. These results clearly demonstrate that the inverse consistency algorithm improves the performance of the registration compared to the unidirectional algorithm with respect to reducing the inverse consistency error.
![]() ![]() ![]() Next: Transitivity Error Up: Results Previous: Results Gary E. Christensen 2002-07-04 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Copyright © 2002 The University of Iowa. All rights reserved.
Iowa City, Iowa 52242 |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||