Abstract

The purpose of this study was to estimate the accuracy of a method in which three-dimensional (3D) magnetic resonance (MR) volume registration is used for monitoring hip joint disease. Data were analyzed using a normalized cross-correlation (NCC) algorithm involving a user-selected 3D box including the proximal femur. Most of the femoral head was not included in the 3D box because it can become deformed during the course of disease. The accuracy of registration around the femoral head was evaluated using five phantoms and clinical MR data of 17 patients with hip joint disease. In the phantom experiment, registration accuracy was evaluated using four fiducial markers attached to the femoral head. In the experiment using clinical data, registration accuracy was evaluated using a landmark in the femoral head. The registration accuracy in the phantom and clinical experiment was 0.43+/-0.18 mm (S.D.) and 1.12+/-0.46 mm (S.D.), respectively. The former is a value less than half the minimum dimension of a voxel (1.25 x 1.25 x 1.0 mm). Although the latter is slightly larger than the minimum dimension of a voxel, actual errors would be smaller because of the uncertainty in landmark localization. In conclusion, the present method based on an NCC algorithm can be used to accurately register serial MR images of the femoral heads with an error on the order of a voxel. We believe that this method is sufficiently accurate for monitoring hip joint diseases.

Full Text
Paper version not known

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.