Grid Refinement in Adaptive Non-rigid Registration
Non-rigid mutual information (MI) registration algorithms with many degrees of freedom (DOF) are quite useful, but they come at high computational cost and have convergence issues. As a remedy adaptive non-rigid registration algorithms, where DOF is increased adaptively (i.e. the grid is refined adaptively), have been proposed. There are at least two ways to refine a grid adaptively: one based on changes in the global measure, the other based on a local measure. We compare these two and show that a local measure method can have better sensitivity to deformations than the global measure. The local measure employed is a novel method using local entropies and local MI.
Unable to display preview. Download preview PDF.
- 1.Hill, D.L.G., Batchelor, P.G., Holden, M., Hawkes, D.J.: Medical image registration. Physics in medicine and biology, vol. 46, pp. r1–r45 (2001)Google Scholar
- 3.Rhode, G.K., Aldroubi, A., Dawant, B.M.: Adaptive free form deformation for interpatient medical image registration. In: IPMI 2001, Proceedings of SPIE, vol. 4322, pp. 1578–1787 (2001)Google Scholar
- 4.Rhode, G.K., Aldroubi, A., Dawant, B.M.: The adaptive bases algorithm for nonrigid image registration. In: IPMI 2002, Proceeding of SPIE, vol. 4684, pp. 933–944 (2002)Google Scholar
- 9.Skolnik, M.I.: Introduction to radar systems, 3rd edn. McGraw-Hill, New York (2000)Google Scholar
- 10.Cocosco, C.A., Kollokian, V., Kwan, R.K.-S., Evans, A.C.: BrainWeb: Online Interface to a 3D MRI Simulated Brain Database. NeuroImage 5(4), part 2/4, S425 (1997)Google Scholar