A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense 3-D maps obtained by using a correlation-based stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in many practical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually approximately known. From this initial estimate, our algorithm computes observer motion with very good precision, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3-D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points in one set to the closest points in the other. A statistical method based on the distance distribution is used to deal with outliers, occlusion, appearance and disappearance, which allows us to do subset-subset matching. A least-squares technique is used to estimate 3-D motion from the point correspondences, which reduces the average distance between points in the two sets. Both synthetic and real data have been used to test the algorithm, and the results show that it is efficient and robust, and yields an accurate motion estimate.

/pdf/iterative-point-matching-for-registration-of-free-form-5fl1ftde76.pdf

Iterative point matching for registration of free-form curves and surfaces

Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in many pratical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually either small or approximately known, but a more precise registration is required for environment modeling. The algorithm described in this report meets this need. Objects are represented by free-form curves, i.e., arbitrary spaces curves of the type found in practice. A curve is available in the form of a set of chained points. The proposed algorithm is based on iteratively matching points on one curve to the closest points on the other. A least-squares technique is used to estimate 3-D motion from the point correspondences, which reduces the average distance between curves in two sets. Both synthetic and real data have been used to test the algorithm, and the results show that it is efficient and robust, and yields an accurate motion estimate. The algorithm can be easily extended to solve similar problems such as 2-D curve matching and 3-D surface matching.

/pdf/iterative-point-matching-for-registration-of-free-form-b0pre910b7.pdf

Iterative point matching for registration of free-form curves

Simultaneous localization, mapping and moving object tracking (SLAMMOT) involves both simultaneous localization and mapping (SLAM) in dynamic environments and detecting and tracking these dynamic objects. In this paper, a mathematical framework is established to integrate SLAM and moving object tracking. Two solutions are described: SLAM with generalized objects, and SLAM with detection and tracking of moving objects (DATMO). SLAM with generalized objects calculates a joint posterior over all generalized objects and the robot. Such an approach is similar to existing SLAM algorithms, but with additional structure to allow for motion modeling of generalized objects. Unfortunately, it is computationally demanding and generally infeasible. SLAM with DATMO decomposes the estimation problem into two separate estimators. By maintaining separate posteriors for stationary objects and moving objects, the resulting estimation problems are much lower dimensional than SLAM with generalized objects. Both SLAM and moving object tracking from a moving vehicle in crowded urban areas are daunting tasks. Based on the SLAM with DATMO framework, practical algorithms are proposed which deal with issues of perception modeling, data association, and moving object detection. The implementation of SLAM with DATMO was demonstrated using data collected from the CMU Navlab11 vehicle at high speeds in crowded urban environments. Ample experimental results shows the feasibility of the proposed theory and algorithms.

/pdf/simultaneous-localization-mapping-and-moving-object-tracking-mokokubv8k.pdf

Simultaneous Localization, Mapping and Moving Object Tracking

Motivated by the problem of retinal image registration, this paper introduces and analyzes a new registration algorithm called Dual-Bootstrap Iterative Closest Point (Dual-Bootstrap ICP). The approach is to start from one or more initial, low-order estimates that are only accurate in small image regions, called bootstrap regions. In each bootstrap region, the algorithm iteratively: 1) refines the transformation estimate using constraints only from within the bootstrap region; 2) expands the bootstrap region; and 3) tests to see if a higher order transformation model can be used, stopping when the region expands to cover the overlap between images. Steps 1): and 3), the bootstrap steps, are governed by the covariance matrix of the estimated transformation. Estimation refinement [Step 2)] uses a novel robust version of the ICP algorithm. In registering retinal image pairs, Dual-Bootstrap ICP is initialized by automatically matching individual vascular landmarks, and it aligns images based on detected blood vessel centerlines. The resulting quadratic transformations are accurate to less than a pixel. On tests involving approximately 6000 image pairs, it successfully registered 99.5% of the pairs containing at least one common landmark, and 100% of the pairs containing at least one common landmark and at least 35% image overlap.

The dual-bootstrap iterative closest point algorithm with application to retinal image registration

In this paper, we propose a new framework to perform nonrigid surface registration. It is based on various extensions of an iterative algorithm recently presented by several researchers (Besl and McKay, 1992; Champleboux et al., 1992; Chen and Medioni, 1992; Menq and Lai, 1992; Zhang, 1994) to rigidly register surfaces represented by a set of 3D points, when a prior estimate of the displacement is available. Our framework consists of three stages: •First, we search for the best rigid displacement to superpose the two surfaces. We show how to efficiently use curvatures to superpose principal frames at possible corresponding points in order to find a prior rough estimate of the displacement and initialize the iterative algorithm. •Second, we search for the best affine transformation. We introduce differential information in points coordinates: this allows us to match locally similar points. Then, we show how principal frames and curvatures are transformed by an affine transformation. Finally, we introduce this differential information in a global criterion minimized by extended Kalman filtering in order to ensure the convergence of the algorithm. •Third, we locally deform the surface. Instead of computing a global affine transformation, we attach to each point a local affine transformation varying smoothly along the surface. We call this deformation a locally affine deformation. All these stages are illustrated with experiments on various real biomedical surfaces (teeth, faces, skulls, brains and hearts), which demonstrate the validity of the approach.

/pdf/rigid-affine-and-locally-affine-registration-of-free-form-1d9zpbehgq.pdf

Rigid, affine and locally affine registration of free-form surfaces

The authors present an optimal match scheme that aligns the measurement data with the design data in CAD-directed dimensional inspection. The principle of this scheme is to determine the actual measured points on the nominal surface by minimizing the sum of the squared distances of the measurement data from the surface with respect to the parameters of a rigid body transformation. Its computational efficiency and robustness against singularity are discussed. Two applications are examined. The first is determining the design coordinate system with respect to a machine coordinate system. The second is comparative analysis for precision measurement. For determining the design coordinate system, a sensitivity measure is proposed and confirmed experimentally. For error comparative analysis, a statistical model is developed to determine the minimum number of required measurement points so that the sampled points can closely represent the entire population. >

Automated precision measurement of surface profile in CAD-directed inspection

A hierarchical planning system is presented which uses heuristics for path planning in dimensional inspection using coordinate measuring machines (CMMs). The objective is to automate the planning of a collision-free inspection path. The system demonstrates that the inspection paths of geometrically complex real world parts with multiple features can automatically be generated with efficiency. This is made possible by appropriate CMM abstractions, genuine 3-D collision detection, and heuristic modifications of reasonably assumed default inspection paths. Automatic selection and modification of probe angle based on a local accessibility analysis of a given feature are also presented. The collision-free inspection path can then be simulated in a CAD environment before it is carried out by the real CMM. >

H.-T. Yau

Papers

Automated precision measurement of surface profile in CAD-directed inspection

Path planning for automated dimensional inspection using coordinate measuring machines