Computer assisted surgery uses a collection of different techniques including but not limited to: CT-guided, fluoroscopy-guided, and ultrasound-guided imaging which allows medical staff to view bony anatomy of a patient in relation to surgical tools on a computer screen. By providing this visual data to surgeons less invasive surgeries can be performed on a patient's fractured scaphoid. The data required for a surgeon to perform a minimally invasive surgery while looking only at a computer screen, and not directly at a patient's anatomy, will be provided by CT and ultrasound data. We will discuss how ultrasound and CT data can be used together to allow a minimally invasive surgery of the scaphoid to be performed. In this thesis we will explore two techniques of registering segmented ultrasound images to CT data; an Iterative Closest Point (ICP) approach, and an Unscented Kalman Filter-based Registration (UKF). We use two different ultrasound segmentation methods; a semi-automatic segmentation, and a Bayesian segmentation technique. The segmented ultrasound data is then registered to a CT volume. The success or failure of the registrations is measured by the error calculated in mapping the corresponding land- marks to one another and calculating the target registration error. The results show that the Unscented Kalman Filter-based registration using the Bayesian segmentation of ultrasound images has the least registration error, and has the most robustness to error in initial alignment of the two data sets. / Thesis (Master, Computing) -- Queen's University, 2010-05-28 11:17:31.934

Shipping companies have a lot of difficulties to control and screen packages such as mail or different types of cargo that may contain dangerous or illegal goods. This project has the goal to enhance the supply chain security by elaborating a way to automatically detect manipulated packages. Based on image comparison, an algorithm can say whether a package shows significant doubts to be put aside for more inspection. After being coded, this algorithm is explained in this thesis. It uses an image registration method as well as a differentiation technique to detect tampered patterns from one image of package at one point of the supply chain to another image of the same package at a later stage. Results show that re-sealed packages, ripped packages or blacked labels can be detected and minor manipulations such as modifications on the barcode can be detected with a close-up of the local region. The principal goal of this project is to give recommendations on what is possible to detect and how to implement this algorithm. This work is a first step toward the use of image processing in future work for package screening.

No description available.

The primary goal of this dissertation is to develop point-based rigid and non-rigid image registration methods that have better accuracy than existing methods. We first present point-based PoIRe, which provides the framework for point-based global rigid registrations. It allows a choice of different search strategies including (a) branch-and-bound, (b) probabilistic hill-climbing, and (c) a novel hybrid method that takes advantage of the best characteristics of the other two methods. We use a robust similarity measure that is insensitive to noise, which is often introduced during feature extraction. We show the robustness of PoIRe using it to register images obtained with an electronic portal imaging device (EPID), which have large amounts of scatter and low contrast. To evaluate PoIRe we used (a) simulated images and (b) images with fiducial markers; PoIRe was extensively tested with 2D EPID images and images generated by 3D Computer Tomography (CT) and Magnetic Resonance (MR) images. PoIRe was also evaluated using benchmark data sets from the blind retrospective evaluation project (RIRE). We show that PoIRe is better than existing methods such as Iterative Closest Point (ICP) and methods based on mutual information. We also present a novel point-based local non-rigid shape registration algorithm. We extend the robust similarity measure used in PoIRe to non-rigid registrations adapting it to a free form deformation (FFD) model and making it robust to local minima, which is a drawback common to existing non-rigid point-based methods. For non-rigid registrations we show that it performs better than existing methods and that is less sensitive to starting conditions. We test our non-rigid registration method using available benchmark data sets for shape registration. Finally, we also explore the extraction of features invariant to changes in perspective and illumination, and explore how they can help improve the accuracy of multi-modal registration. For multimodal registration of EPID-DRR images we present a method based on a local descriptor defined by a vector of complex responses to a circular Gabor filter.

<p>Static terrestrial laser scanners have been increasingly used in three-dimensional data acquisition since it can rapidly provide accurate measurements with high resolution. Several scans from multiple viewpoints are necessary to achieve complete coverage of the surveyed objects due to occlusion and large object size. Therefore, in order to reconstruct three-dimensional models of the objects, the task of registration is required to transform several individual scans into a common reference frame. This thesis introduces three alternative approaches for the coarse registration of two adjacent scans, namely, feature-based approach, pseudo-conjugate point-based method, and closed-form solution. In the feature-based approach, linear and planar features in the overlapping area of adjacent scans are selected as registration primitives. The pseudo-conjugate point-based method utilizes non-corresponding points along common linear and planar features to estimate transformation parameters. The pseudo-conjugate point-based method is simpler than the feature-based approach since the partial derivatives are easier to compute. In the closed-form solution, a rotation matrix is first estimated by using a unit quaternion, which is a concise description of the rotation. Afterward, the translation parameters are estimated with non-corresponding points along the linear or planar features by using the pseudo-conjugate point-based method. Alternative approaches for fitting a line or plane to data with errors in three-dimensional space are investigated.</p><p><br></p><p>Experiments are conducted using simulated and real datasets to verify the effectiveness of the introduced registration procedures and feature fitting approaches. The proposed two approaches of line fitting are tested with simulated datasets. The results suggest that these two approaches can produce identical line parameters and variance-covariance matrix. The three registration approaches are tested with both simulated and real datasets. In the simulated datasets, all three registration approaches produced equivalent transformation parameters using linear or planar features. The comparison between the simulated linear and planar features shows that both features can produce equivalent registration results. In the real datasets, the three registration approaches using the linear or planar features also produced equivalent results. In addition, the results using real data indicates that the registration approaches using planar features produced better results than the approaches using linear features. The experiments show that the pseudo-conjugate point-based approach is easier to implement than the feature-based approach. The pseudo-conjugate point-based method and feature-based approach are nonlinear, so an initial guess of transformation parameters is required in these two approaches. Compared to the nonlinear approaches, the closed-form solution is linear and hence it can achieve the registration of two adjacent scans without the requirement of any initial guess for transformation parameters. Therefore, the pseudo-conjugate point-based method and closed-form solution are the preferred approaches for coarse registration using linear or planar features. In real practice, the planar features would have a better preference when compared to linear features since the linear features are derived indirectly by the intersection of neighboring planar features. To get enough lines with different orientations, planes that are far apart from each other have to be extrapolated to derive lines.</p><div><br></div>