Robust Registration of Measured Point Set for Computer-Aided Inspection
Abstract
This thesis addresses the problem of registering one point set with respect to
another. This problem arises in the context of the use of CMM/Scanners to inspect
objects especially with freeform surfaces. The tolerance verification process now
requires the comparison of measured points with the nominal geometry. This entails placement of the measured point set in the same reference frame as the nominal model. This problem is referred to as the registration or localization problem. In the most general form the tolerance verification task involves registering multiple point sets corresponding to multi-step scan of an object with respect to the nominal CAD model. This problem is addressed in three phases.
This thesis presents a novel approach to automated inspection by matching
point sets based on the Iterative Closest Point (ICP) algorithm. The Modified ICP
(MICP) algorithm presented in the thesis improves upon the existing methods through the use of a localized region based triangulation technique to obtain correspondences for all the inspection points and achieves dramatic reduction in computational effort. The use of point sets to represent the nominal surface and shapes enables handling different systems and formats. Next, the thesis addresses the important problem of establishing registration between point sets in different reference frames when the initial relative pose between them is significantly large. A novel initial pose invariant methodology has been developed. Finally, the above approach is extended to registration of multiview inspection data sets based on acquisition of transformation information of each inspection view using the virtual gauging concept. This thesis describes implementation to address each of these problems in the area of automated registration and verification leading towards automatic inspection.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Motion Space Analysis of Smooth Objects in Point Contacts
Rama Krishna, K (2018-07-19)The present work studies instantaneous motion of smooth planar and spatial objects in unilateral point contacts. The traditional first-order instantaneous kinematic analysis is found insufficient to explain many common ... -
On the Tradeoff Of Average Delay, Average Service Cost, and Average Utility for Single Server Queues with Monotone Policies
Sukumaran, Vineeth Bala (2018-04-23)In this thesis, we study the tradeoff of average delay with average service cost and average utility for both continuous time and discrete time single server queueing models without and with admission control. The continuous ... -
Generalization of Hitting, Covering and Packing Problems on Intervals
Datta Krupa, R (2018-05-29)Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting ...