The registration of 3D preoperative medical data to patients is a key task in developing computer assisted surgery systems. In computer assisted surgery, the patient in the operation theatre must be aligned with the coordinate system in which the preoperative data has been acquired, so that the planned surgery based on the preoperative data can be carried out under the guidance of the computer assisted surgery system. The aim of this research is to investigate registration algorithms for developing computer assisted bone surgery systems. We start with reference mark registration. New interpretations are given to the development of well knowm algorithms based on singular value decomposition, polar decomposition techniques and the unit quaternion representation of the rotation matrix. In addition, a new algorithm is developed based on the estimate of the rotation axis. For non-land mark registration, we first develop iterative closest line segment and iterative closest triangle patch registrations, similar to the well known iterative closest point registration, when the preoperative data are dense enough. We then move to the situation where the preoperative data are not dense enough. Implicit fitting is considered to interpolate the gaps between the data . A new ellipsoid fitting algorithm and a new constructive implicit fitting strategy are developed. Finally, a region to region matching procedure is proposed based on our novel constructive implicit fitting technique. Experiments demonstrate that the new algorithm is very stable and very efficient.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:272472 |
| Date | January 2002 |
| Creators | Li, Qingde |
| Contributors | Griffiths, John G. |
| Publisher | University of Hull |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://hydra.hull.ac.uk/resources/hull:13615 |
Page generated in 0.0118 seconds