Abstract

In 1996 Freeborough proposed a method for estimating target registration error (TRE) in the absence of ground truth. In his approach, a circuit of registrations is performed using the same registration method on multiple views of the same object: 1 to 2, 2 to 3, …, N<sub>c</sub> –1 to N<sub>c</sub> , and N<sub>c</sub> to 1 where N<sub>c</sub> is at least three and the last registration completes the circuit. Any difference between the original and final positions, which we call the “Circuit TRE” or TRE<sub>c</sub>, indicates that at least one step in the registration method suffers from TRE. To estimate the mean single-step error, Freeborough proposed the formula, True TRE = k &times; TRE<sub>c</sub>, and suggested that k = 1/square-root-of-N<sub>c</sub>. Multiple articles have employed Freeborough’s approach to estimate the accuracy of intensity-based registration methods with various values of k, but no theoretical analysis of the expected accuracy of such estimates has been attempted for any registration method. As a first step in this direction, the current work provides such an analysis for the method of rigid point registration, also known as fiducial registration. The analysis, which is validated via computer simulation, reveals that for point registration Freeborough’s formula greatly underestimates TRE. The simulations further reveal that, to an excellent approximation, True TRE = k &times;square-root-of-TRE<sub>c</sub>, where k depends not only on the number of points but also on their configuration. We investigate the usefulness of this formula as a means to estimate true TRE. We find that it is less reliable than a standard formula published in 1998.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.