Accurate Sphere Marker-Based Registration System of 3D Point Cloud Data in Applications of Shipbuilding Blocks

Similar documents
Intensity Augmented ICP for Registration of Laser Scanner Point Clouds

FAST REGISTRATION OF TERRESTRIAL LIDAR POINT CLOUD AND SEQUENCE IMAGES

Algorithm research of 3D point cloud registration based on iterative closest point 1

Study on Improving Accuracy for Edge Measurement Using 3D Laser Scanner

Surface Registration. Gianpaolo Palma

If the robot moves from F l to F r, and observes the coordinates of the same physical point as. l p and. coordinates are related by [9]

Three-dimensional nondestructive evaluation of cylindrical objects (pipe) using an infrared camera coupled to a 3D scanner

Model-based segmentation and recognition from range data

Association-Matrix-Based Sample Consensus Approach for Automated Registration of Terrestrial Laser Scans Using Linear Features

Flexible Calibration of a Portable Structured Light System through Surface Plane

Correspondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov

Homographies and RANSAC

INFO0948 Fitting and Shape Matching

RANSAC APPROACH FOR AUTOMATED REGISTRATION OF TERRESTRIAL LASER SCANS USING LINEAR FEATURES

AUTOMATIC FEATURE-BASED POINT CLOUD REGISTRATION FOR A MOVING SENSOR PLATFORM

Structured light 3D reconstruction

Structured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov

Iterative Closest Point Algorithm in the Presence of Anisotropic Noise

SEMANTIC FEATURE BASED REGISTRATION OF TERRESTRIAL POINT CLOUDS

Reconstruction of complete 3D object model from multi-view range images.

POINT CLOUD REGISTRATION: CURRENT STATE OF THE SCIENCE. Matthew P. Tait

Normal Distribution Transform with Point Projection for 3D Point Cloud Registration

CLASSIFICATION FOR ROADSIDE OBJECTS BASED ON SIMULATED LASER SCANNING

3D Computer Vision. Structured Light II. Prof. Didier Stricker. Kaiserlautern University.

A NEW AUTOMATIC SYSTEM CALIBRATION OF MULTI-CAMERAS AND LIDAR SENSORS

Accurate Motion Estimation and High-Precision 3D Reconstruction by Sensor Fusion

Scanning Real World Objects without Worries 3D Reconstruction

Using Augmented Measurements to Improve the Convergence of ICP. Jacopo Serafin and Giorgio Grisetti

DETECTION OF GEOMETRIC KEYPOINTS AND ITS APPLICATION TO POINT CLOUD COARSE REGISTRATION

Calibration of a Multi-Camera Rig From Non-Overlapping Views

SKYLINE-BASED REGISTRATION OF 3D LASER SCANS

FOOTPRINTS EXTRACTION

3D Environment Reconstruction

Range Image Registration with Edge Detection in Spherical Coordinates

SIMPLE ROOM SHAPE MODELING WITH SPARSE 3D POINT INFORMATION USING PHOTOGRAMMETRY AND APPLICATION SOFTWARE

The Template Update Problem

AUTOMATIC IMAGE ORIENTATION BY USING GIS DATA

Chapters 1 4: Overview

Occluded Facial Expression Tracking

MONO-IMAGE INTERSECTION FOR ORTHOIMAGE REVISION

Stereo and Epipolar geometry

URBAN STRUCTURE ESTIMATION USING PARALLEL AND ORTHOGONAL LINES

Octree-Based Obstacle Representation and Registration for Real-Time

Estimation of Camera Pose with Respect to Terrestrial LiDAR Data

A 3D Point Cloud Registration Algorithm based on Feature Points

AUTOMATIC REGISTRATION OF TERRESTRIAL POINT CLOUD USING PANORAMIC REFLECTANCE IMAGES

Structured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov

Autonomous Sensor Center Position Calibration with Linear Laser-Vision Sensor

Visual Tracking (1) Tracking of Feature Points and Planar Rigid Objects

CSE 252B: Computer Vision II

Factorization with Missing and Noisy Data

Color Segmentation Based Depth Adjustment for 3D Model Reconstruction from a Single Input Image

An Efficient Method for Solving the Direct Kinematics of Parallel Manipulators Following a Trajectory

Robot Localization based on Geo-referenced Images and G raphic Methods

Geometrical Feature Extraction Using 2D Range Scanner

AUTOMATED COARSE REGISTRATION OF POINT CLOUDS IN 3D URBAN SCENES USING VOXEL BASED PLANE CONSTRAINT

EXTENDED GAUSSIAN IMAGES FOR THE REGISTRATION OF TERRESTRIAL SCAN DATA

Use of Shape Deformation to Seamlessly Stitch Historical Document Images

Using Geometric Blur for Point Correspondence

Point Cloud Processing

Human pose estimation using Active Shape Models

Rigid ICP registration with Kinect

3D Point Cloud Processing

CRF Based Point Cloud Segmentation Jonathan Nation

Towards Optimal 3D Point Clouds

Algorithms for 3D Isometric Shape Correspondence

Object Detection by Point Feature Matching using Matlab

Personal Navigation and Indoor Mapping: Performance Characterization of Kinect Sensor-based Trajectory Recovery

COMPARATIVE STUDY OF DIFFERENT APPROACHES FOR EFFICIENT RECTIFICATION UNDER GENERAL MOTION

Accurate 3D Face and Body Modeling from a Single Fixed Kinect

COSC160: Detection and Classification. Jeremy Bolton, PhD Assistant Teaching Professor

Research Article Measurement Axis Searching Model for Terrestrial Laser Scans Registration

Robot Mapping. SLAM Front-Ends. Cyrill Stachniss. Partial image courtesy: Edwin Olson 1

BSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy

Multi-view Surface Inspection Using a Rotating Table

Gaussian elds: a new criterion for 3Drigid registration

RELATIVE SCALE ESTIMATION AND 3D REGISTRATION OF MULTI-MODAL GEOMETRY USING GROWING LEAST SQUARES

GABRIELE GUIDI, PHD POLITECNICO DI MILANO, ITALY VISITING SCHOLAR AT INDIANA UNIVERSITY NOV OCT D IMAGE FUSION

Feature Tracking and Optical Flow

An Adaptive Eigenshape Model

An Image Based 3D Reconstruction System for Large Indoor Scenes

Structure from Motion. Prof. Marco Marcon

Local Feature Detectors

Image Features: Local Descriptors. Sanja Fidler CSC420: Intro to Image Understanding 1/ 58

First scan matching algorithms. Alberto Quattrini Li University of South Carolina

Combining Two-view Constraints For Motion Estimation

Geometric Registration for Deformable Shapes 3.3 Advanced Global Matching

REFINEMENT OF COLORED MOBILE MAPPING DATA USING INTENSITY IMAGES

Segmentation and Tracking of Partial Planar Templates

Image Coding with Active Appearance Models

Adaptive Zoom Distance Measuring System of Camera Based on the Ranging of Binocular Vision

Finding a Best Fit Plane to Non-coplanar Point-cloud Data Using Non Linear and Linear Equations

Video annotation based on adaptive annular spatial partition scheme

Robust and Accurate Detection of Object Orientation and ID without Color Segmentation

TERRESTRIAL LASER SCANNING FOR DEFORMATION ANALYSIS

Scan Matching. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

SOME stereo image-matching methods require a user-selected

1-2 Feature-Based Image Mosaicing

The Novel Approach for 3D Face Recognition Using Simple Preprocessing Method

Structure from Motion. Introduction to Computer Vision CSE 152 Lecture 10

Transcription:

Journal of Industrial and Intelligent Information Vol. 3, No. 4, December 2015 Accurate Sphere Marker-Based Registration System of 3D Point Cloud Data in Applications of Shipbuilding Blocks Mengmi Zhang Department of Electrical and Computer Engineering, National University of Singapore, Singapore Email: a0091624@nus.edu.sg Although many registration computational methods exist, most of them are variants of solutions on solving Euclidean distance minimization problems between nearby points. State-of-art algorithms can be divided into two categories, i.e. fine and coarse registrations. The most well-known algorithm for fine registration is the Iterative Closest Point (ICP) by Besl and McKay [1]. The algorithm alternates from finding correspondences based on closest points to computing resulting transformation errors until it converges to local minimum. Good initial estimates are essential for successful matching results. These starting estimates can be produced by exploiting correspondences based on features. Scale Invariant Feature Transform (SIFT) proposed by Böhm and Becker achieves automatic registration [2]. Wang and Brenner extended their works by using additional geometry features to reduce number of outliers [3]. Weinmann et al. present a feature extraction method based on range and reflectance information of 3D PCD [4], [5]. All these feature extractions are based on both conventional 2D feature descriptors and 3D PCD. By using 3D planar patches and normal distribution transformation (NDT) on 2D slices, Brenner et al. proposed a purely 3D PCD based coarse registration method [6], [7]. Whereas markerless registration saves time, artificial marker-based registration can afford high accuracy and robustness [8]. In shipbuilding process, marker-based registration process is only necessary for the first time as long as the poses of laser scanners remain for the rest of the shipbuilding process. Craftsmen have the flexibility of positioning the artificial markers in the workspace. After completion of marker based registration process at the first time, transformation matrix among pairs of laser scanners are stored and artificial markers can be removed from the workspace. Craftsmen can proceed on normal registration process given the transformation matrix calculated at the first time. This paper proposes an artificial marker based registration system. Detailed implementation is illustrated in Section II. Either region growing method described by Sun [9] or manual extraction of sphere surface is implemented. We can then use sphere fitting algorithms to extract sphere centers. Iterative outlier removals are required to refine the estimated positions of sphere centers until the estimated radius lies within the acceptable range. Principal components are computed for Abstract This paper presents a sphere marker-based registration system of 3D point cloud data (PCD) considering the demanding requirements of high accuracy in shipbuilding industry. In our system, we formulate the problem of aligning pairs of point clouds as Euclidean distance squared minimization energy function. Sphere centers of artificial markers are extracted and used for computing rigid transformations among pairs of point clouds. Sphere fitting and outlier removal algorithms are presented. Principal Component Analysis (PCA) can robustly transform coordinates without the need of multiple iterations by the Iterative Closest Point (ICP). Our proposed unsymmetrical triangular configuration of three sphere markers largely improves our time efficiency. In the end, we proposed an innovative quantative marker-based evaluation method and applied it in real applications of shipbuilding blocks to demonstrate the high performance of our registration system by comparing with commercial PCD processing software. Index Terms 3D point cloud data, registration, laser scanner, shipbuilding block I. INTRODUCTION 3D laser scanning is widely used in various applications including manufacturing, modeling, archeology and artifact designing. Due to line-of-sight constraints from mono static view of 3D laser scanner, multiple scans are needed to fully cover the large object of interest. Hence, registration becomes one of the fundamental steps to convert individual scans to one common coordinate system. Given pairs of point clouds in metric scale and correspondences in their overlapping areas, affine transformation matrix can then be computed. In shipbuilding industry, one shipbuilding block may contain multiple pieces of metal plates varying from a few meters to tens of meters in length. Accuracy of registration results determine subsequent manufacturing processes like block data analysis, assembling plan making and block welding processes. Therefore, high accuracy of registration results has to be guaranteed. With increasing scan resolutions and data sizes in order to achieve more accurate results, there is also a need for reducing computation costs. Hence, computationally expensive registration methods are intractable. Manuscript received September 10, 2014; revised March 5, 2015. doi: 10.12720/jiii.3.4.318-323 318

Journal of Industrial and Intelligent Information Vol. 3, No. 4, December 2015 each laser scanner coordinate system. Finally, matrix operations are conducted to register one PCD to the other coordinate system. In the last part of Section II, we introduce an innovative and quantative sphere-based evaluation method. In the end, experimental results and discussions are provided in Section III with conclusions in Section IV. II. and m refers to the total number of points collected from sphere surface. By using a closed form of the solution proposed by Alan Jennings [10], this energy function can be solved as follows (4) METHODOLOGY (5) Hence, matrix A can be calculated as below A. Sphere Surface Point Cloud Extraction Highly reflective white sphere targets with 72.5mm in radius, as artificial markers, are designed. They are distributed within the overlapping field view of two laser scanners. These artificial sphere markers can be visually distinguished in PCD. The advantages of sphere markers are their symmetrical views from any laser scanner standpoints. By manually selecting one point on the sphere surface, region growing method developed by Sun [9] can be employed to extract surface point clouds with some adjustments of design parameters. Craftsmen are also able to manually select surface point cloud using PCD software and export the data into CSV format (6 columns (x, y, z, R, G, B) shown in Fig. 1. (6) (7) From equation 3, let us define the squared distance ri as follows (8) Then (9) The solution for estimated sphere center is (10) Estimated radius r can then be computed as (11) The underlying uncertainty or errors introduced from laser scanner measurements have to be taken into account probabilistically. Given the designed dimension of sphere markers, the radius is 72.5mm in our case. We assume the Euclidean distances between the surface PCD and the estimated sphere center follow Gaussian distribution and those data points lying outside [r 3σ, r + 3σ] are treated as outliers where σ is the standard deviation. Multiple iterations of sphere fitting and outlier removals are carried out until estimated radius converges within the acceptable range. Figure1. Laser scanning view of testing field and the partial enlarged view of the extracted surface point cloud of Sphere No 2. Seven markers are labeled from 1 to 7. Labels correspond with the ones in Table II, III, IV in Section III The boundary of the surface PCD is more error-prone than the central region of the surface PCD due to multipath effects. Hence, PCD on the surface boundary can be eliminated for achieving more accurate sphere center estimation results. B. Sphere Fitting and Outlier Removal Assume the given surface coordinates of a sphere are (xi, yi, zi) and the unknown parameters are sphere center coordinates (xc, yc, zc) and radius r, the relation between the observations and the unknowns can then be formulated as C. Rigid Transformation Sphere centers in coordinate systems of laser scanner A and laser scanner B are obtained as the subsection above explains. The notations for both are as follows (1) where each PAi or PBi denotes the sphere center coordinates in the coordinate frame of laser scanner A or B Considering not all the observations are coplanar, the objective function is to minimize the error residual (2) These target points can be used for standard Principal Components Analysis (PCA) after subtracting the average offset from the origin. PCA is a statistical procedure using orthogonal transformation to convert where (3) 319

Journal of Industrial and Intelligent Information Vol. 3, No. 4, December 2015 possibly correlated variables into a set of uncorrelated principal components. Since the configurations of sphere centers remain for both coordinate systems, the scaling factor is the same in both cases. We define the set of normalized eigenvectors corresponding from the largest eigenvalue to the smallest as VA(va 1, va 2, va 3 ) for 3D coordinate system of laser scanner A and VB(vb 1, vb 2, vb 3 ) for 3D coordinate system of laser scanner B respectively. Due to the bi-directionality of eigenvectors, correspondence between VA and VB as well as right hand rule (RHR) of coordinate systems are ensured by using multiple times of cross product checking rules. (72.5mm in our case) and hence, we can obtain an error percentage. This standard evaluation approach has been tested by virtualizing two sphere surface PCDs and separating them with various distances. These two surface PCDs are centro-symmetric and acquired from the same sphere point cloud data. By varying the distance between these two surface PCDs along the direction of the average points of these two surface PCDs, it simulates the various performances of registration results. Detailed illustration of our evaluation algorithm is provided in Fig. 2. where va i or vb i refer to the eigenvectors and n refers to the total number of extracted sphere centers. The rotation matrix from A to B can be computed as (12) where Adjust deals with situations when the setup of coordinate systems A and B are opposite to each other Figure 2. Illustration of our proposed evaluation method The translation matrix t can then be calculated. (13) (14) (15) For any point cloud data pa in A, we can transform it to the coordinate frame of laser scanner B (16) The rigid transformation parameters PA, R and t can be stored and used in future registration procedures. D. Quantative Evaluation Method Using Sphere Markers State of the art registration technologies seldom provide a quantative evaluation of results. One of the possible problems is that registration results are in point form. Hence, it is hard to find corresponding point matches between two registered point clusters and compute mismatch distances between them. On the other hand, registration performances are difficult to compare between two algorithms proposed by different papers due to various kinds of factors such as scanning resolutions, hardware specifications, and specific environmental setup. Here we are able to introduce a sphere marker-based evaluation method to resolve point-to-point problem by reconstructing a sphere marker based method on the registered point clusters. The estimated radius of the reconstructed sphere can then be compared with the real dimension of the sphere markers known beforehand Figure 3. Case (a): Testing result of our proposed evaluation method in Matlab Fig. 3, Fig. 4, Fig. 5 show the evaluation results for cases where these two surface PCDs are 217.5mm, 43.5mm and 145mm apart from each other respectively. This evaluation method set up a benchmark for us to compare registration performances as discussed in Section III in our paper. Figure 4. Case (b): Testing result of our proposed evaluation method in Matlab 320

Journal of Industrial and Intelligent Information Vol. 3, No. 4, December 2015 generated by using sphere fitting algorithm introduced before. Experimental results show that our estimated sphere center lies in the center of all possible sphere centers as shown in Fig. 7. Seven spheres are processed for computing rigid transformation. The transformation result of sphere center coordinates from the frame of laser scanner A to the frame of laser scanner B is shown in Fig. 8. Figure 5. Case (c): Testing result of our proposed evaluation method in Matlab III. RESULT AND DISCUSSION A. Registration System Applied in Testing Field The experimental setup in the testing field is shown in Fig. 1. Seven sphere markers were positioned randomly. After manually extracting surface PCD, sphere fitting and iterative outlier removals are processed for each surface PCD. Given the sphere marker radius 72.5mm, error percentage of the final estimated sphere radius is computed. One of the sphere fitting result is shown in Fig. 6. Figure 8. Final transformation result of sphere center coordinates from the frame of laser scanner A to the frame of laser scanner B Final registration result of seven sphere markers is shown in Fig. 9, Fig. 10, Fig. 11 with different views. Figure 9. Right side view of final registration result Figure 6. Sphere fitting result for the extracted surface PCD of sphere No 6 Figure 10. Left side view of final registration result Figure 7. Distributions of all possible sphere centers for sphere No 6 Five random points are iteratively selected from surface PCD and their estimated sphere centers are Figure 11. Top view of final registration result 321

Journal of Industrial and Intelligent Information Vol. 3, No. 4, December 2015 B. Impacts of Number of Markers and Their Configurations on Registration Performance Impacts of numbers of sphere markers and their various configurations on registration performances are explored. The experimental setup is the same as explained in Subsection III-A. Scanning resolutions and other environmental parameters are maintained the same throughout the experiments. In our case, four rounds of scans have been conducted in four different positions pos368, pos370, pos372 and pos375 as indicated in Table I with same scanning resolutions 12.272mm and corresponding amplifying coefficient 8 times. By using the evaluation method introduced in Subsection II-D, we treat the scanning frame in pos372 as the common reference frame and all other scanning frames in respective positions, i.e. pos368, pos370, and pos375 are registered to this common reference frame. Registration results of individual balls have been recorded in error percentage (%) values shown in Table II, Table III, and Table IV. In the end, we integrate all four scanning PCDs together and obtain the total registration results in Table V. TABLE I. NUMBER OF MARKERS AND THEIR CORRESPONDING LABELS INDICATED IN FIGURE I FOR TABLE II, III, IV, V performance. Errors from the estimation of sphere centers propagate to rigid transformation processes which may lead to larger offsets with increasing numbers of markers. In order to simplify the registration process and avoid confusions in computing principal components, three sphere markers are recommended and they have to be placed in an unsymmetrical manner meaning the formed triangle cannot be isosceles. This unsymmetrical triangular configuration enables our registration process to operate with fast speed, easy operability and high robustness. C. Application in Shipbuilding Block We have tested our registration system in real applications of shipbuilding blocks. Figure 12 shows a shipbuilding block sample with 4 plates in stack from two laser scanners' view. Figure 12. Subfigure on the left shows the ship plates viewed from laser scanner A. Subfigure on the right shows the ship plates viewed from laser scanner B. Experiment Number of spheres Sphere Labels Round 1 3 1,2,3 Round 2 4 1,2,3,7 Round 3 5 1,2,3,6,7 Round 4 6 1,2,3,5,6,7 Round 5 7 1,2,3,4,5,6,7 TABLE II. ERROR PERCENTAGES OF REGISTRATION RESULT OF CONVERTING PCD FROM POSITION 368 TO POSITION372 368 to 372 ball1 (%) ball2 (%) ball3 (%) 3 0.5028 0.25688 0.013209 4 4.4622 0.096365 0.004014 5 6.0901 0.21615 0.43687 6 3.3992 1.2227 0.72253 7 2.7703 1.2412 1.0378 TABLE III. ERROR PERCENTAGES OF REGISTRATION RESULT OF CONVERTING PCD FROM POSITION 370 TO POSITION 372 370 to 372 ball1 (%) ball2 (%) ball3 (%) 3 1.2335 0.27501 0.69017 4 4.2234 2.8118 1.2924 5 4.1454 1.0329 1.2451 6 2.9402 2.2483 1.2902 7 1.711 1.1314 1.1387 TABLE IV. ERROR PERCENTAGES OF REGISTRATION RESULT OF CONVERTING PCD FROM POSITION 375 TO POSITION 372 375 to 372 ball1 (%) ball2 (%) ball3 (%) 3 2.4497 0.34347 1.3827 4 5.4995 0.58006 1.4945 5 2.4871 0.88655 1.5968 6 5.6158 1.4047 1.5638 7 2.1236 0.71219 1.5528 From Table II, Table III, Table IV, it turns out the number of sphere markers used for computing rigid transformation is not directly related to the registration Figure 13. Final registration result of shipbuilding block. PCD is transformed from Frame A to Frame B. Subfigure above shows the top view of the registration result. Subfigure below shows the side view of the registration result. TABLE V. REGISTRATION RESULT OF CONVERTING PCD FROM POSITION 368,370,375 TO POSITION 372 TotalTo372 ball1 (%) ball2 (%) ball3 (%) 3 2.0321 0.44428 7.9405 4 1.5281 1.9311 1.2081 5 3.4523 0.69476 1.1609 6 1.8768 0.98209 1.038 7 3.4659 0.98558 1.0811 The final result using our registration system is shown in Fig. 13. By using the evaluation method introduced in Subsection II-D, we are able to compare our result with the one using Faro Scene where the two balls used for evaluations refer to the ones on the shipbuilding blocks. The quantative results are shown in table VI. Enlarged views along the edges of shipbuilding blocks from the registration results are also provided in Fig. 14. It 322

Journal of Industrial and Intelligent Information Vol. 3, No. 4, December 2015 demonstrates our registration result is as accurate as the one using the commercial software FARO Scene with the slight variations in numerical values. Hiekata, phd student Jingyu Sun and master student Hiroya Matsubara from Graduate School of Frontier Sciences, University of Tokyo for providing academic guidance and making all the experimental equipments available in this research project. This work was supported by Graduate School of Frontier Sciences, University of Tokyo. REFERENCES Figure 14. Subfigure on the left shows the enlarged view along the edges of the ship plates from our registration result. Subfigure on the right shows the enlarged view of the same edge from the registration result produced by the commercial software (FARO Scene). TABLE VI. RESULT COMPARISON BETWEEN OUR SYSTEM AND THE COMMERCIALS OF SOFTWARE FARO SCENE System Error percentage (ball1) Error percentage (ball2) (%) Our system (%) 0.86492 0.042811 Faro Scene 0.48552 0.11492 IV. CONCLUSION In this paper, we present an accurate sphere markerbased registration system in applications of shipbuilding blocks. In our system, the problem of aligning pairs of point clouds is formulated as Euclidean distance squared minimization energy function. Sphere fitting algorithm is employed to extract sphere centers for rigid transformations in later steps. Gaussian probabilistic model deals with detection and removal of outliers to improve accuracy. Unsymmetrical triangular configuration of three sphere markers is proposed to improve processing speed. PCA together with some algebraic operations can robustly transform coordinates. At last, we introduced an innovative sphere marker-based quantative evaluation method and demonstrated a few successful examples using our registration system to align different sets of PCD from laser scanners. The experimental result shows the advantages of our system in high accuracy compared with conventional featurebased registration methods in shipbuilding industry. To our best knowledge, this is the state-of-art simplest and most accurate registration system of 3D point cloud data in applications of shipbuilding blocks. ACKNOWLEDGMENT The author would like to thank Professor Kazuo [1] P. M. N. Besl, A method for registering of 3-d shapes, PAMI, vol. 14, no. 239-256, pp. 743 761, 1992. [2] B. Bohm, Automatic marker-free registration of terrestrial laser scans using reflectance features, in Proc. Optical 3D Measurement Techniques, vol. 8, 2007, pp. 338 344 [3] D. G. B. X. Wang, C. Toth, and H. Sun, Integration of Terrestrial laser scanner for ground navigation in gps -challengd environments, in Proc. XXIst ISPRS Congress: Commission V. [4] S. H. M. Weinmann, M. Weinmann, and B. Jutzi, Fast and automatic image-based registration of tls data, ISPRS Journal of Photogrammetry and Remote Sensing, vol. 66, no. 6, pp. 62 70, 2011. [5] E. Ha Midreza Houshiar, D. Borrmann, and A. Nuchter, Panorama based point cloud reduction, IEEE Robotics and Automation Society. [6] D. C. Brenner and N. Ripperda, Coarse orientation of terrestrial laser scans in urban environments, ISPRS Journal of Photogrammetry and Remote Sensing, vol. 63, no. 1, pp. 4 18, 2008. [7] D. B. Andreas Nuchter, S. Gutev, and J. Elseberg, Sky Line-Based Registration of 3d Laser Scans, 3DCMA, 2011. [8] V. der, Towards an automatic registration for terrestrial laser scanner data, in Dissertation, 2008, pp. 1 128. [9] H. Y. N. N. A. S. Jingyu Sun and K. zuo Hie kata, Efficient point cloud data processing in shipbuilding reformative component extraction method and registration method, Journal of Computational Design and Engineering. [10] A. Jenning, Closed solution for sphere fitting, Matlab File Exchange, 2014. Mengmi Zhang was born in China in 1991. She is currently pursuing Bachelor Degree in electrical engineering in National University of Singapore (NUS). She participated in Education Abroad Program (UCEAP) in University of California, Santa Barbara for winter quarter, 2014. She joined Undergraduate Research Opportunities Program (UROP) in NUS in 2012 and published Vision-based Detection and Pose Estimation for Formation of Micro Aerial Vehicle in the 13th International Conference on Control, Automation, Robotics and Vision. She worked as an undergraduate research assistant in Temasek Laboratory in NUS during summers in 2013 and 2014. She was a scholar from Ministry of Education, Singapore. She was awarded University of Tokyo Summer Internship Program Scholarship in 2014. Her main areas of research interest are artificial intelligence, navigation system in robotics, industrial automation and computer vision. She is an IEEE student member. She was Dean's Lister in NUS from 2011 to 2013 and was also on Dean's Honor during UCEAP in UCSB in 2014. 323