37
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Automated three-dimensional registration of magnetic resonance and positron emission tomography brain images by multiresolution optimization of voxel similarity measures.

      Medical physics
      Algorithms, Automation, Brain, pathology, radionuclide imaging, Brain Diseases, Entropy, Humans, Magnetic Resonance Imaging, Observer Variation, Probability, Reproducibility of Results, Tomography, Emission-Computed

      Read this article at

      ScienceOpenPubMed
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Approaches using measures of voxel intensity similarity are showing promise in fully automating magnetic resonance (MR) and positron emission tomography (PET) image registration in the head, without requiring extraction and identification of corresponding structures. In this paper a method of multiresolution optimization of these measures is described and five alternative measures are compared: cross correlation, minimization of corresponding PET intensity variation, moments of the distribution of values in the intensity feature space, entropy of the intensity feature space and mutual information. Their ability to recover registration is examined for ten clinically acquired image pairs with respect to the size of initial misregistration, the precision of the final result, and the accuracy assessed by visual inspection. The mutual information measure proved the most robust to initial starting estimate, successfully registering 98.8% of 900 trial misregistrations. Success is defined as providing a visually acceptable solution to a trained observer. A high resolution search (1/16 mm step size) of 30 trial misregistrations showed that optimization using the mutual information measure provided solutions with 0.13 mm, 0.11 mm and 0.17 mm standard deviations in the three Cartesian axes of the translation vector and 0.2 degree, 0.3 degree and 0.2 degree standard deviations for rotations about the three axes. The algorithm takes between 4 and 8 minutes to run on a typical workstation, including visual inspection of the result.

          Related collections

          Author and article information

          Comments

          Comment on this article