What is it about?

The surface may have been digitized/sampled point by point using a laser scanner device, a photogrammetric method or other surface measurement techniques. Our proposed method estimates the transformation parameters of one or more 3D search surfaces with respect to a 3D template surface, using the Generalized Gauss–Markoff model, minimizing the sum of squares of the Euclidean distances between the surfaces. This formulation gives the opportunity of matching arbitrarily oriented 3D surface patches. It fully considers 3D geometry.

Featured Image

Why is it important?

The automatic co-registration of point clouds, representing 3D surfaces, is a relevant problem in 3D modeling. This multiple registration problem can be defined as a surface matching task. We treat it as least squares matching of overlapping surfaces. This surface matching technique is a generalization of the least squares image matching concept and offers high flexibility for any kind of 3D surface correspondence problem, as well as statistical tools for the analysis of the quality of final matching results.

Perspectives

The proposed 3D surface matching technique is a generalization of the least squares 2D image matching concept and offers high flexibility for any kind of 3D surface correspondence problem, as well as monitoring capabilities for the analysis of the quality of the final results by means of precision and reliability criterions. Another powerful aspect of the method is its ability to handle multi-resolution, multi-temporal, multi-scale, and multi-sensor data sets. The technique can be applied to a great variety of data co-registration problems. In addition, time dependent (temporal) variations of the object surface can be inspected, tracked, and localized using the statistical analysis tools of the method.

Dr Devrim AKCA
Isik University

Read the Original

This page is a summary of: Least squares 3D surface and curve matching, ISPRS Journal of Photogrammetry and Remote Sensing, May 2005, Elsevier,
DOI: 10.1016/j.isprsjprs.2005.02.006.
You can read the full text:

Read

Resources

Contributors

The following have contributed to this page