• Journal of KIISE:Software and Applications
• /
• v.30 no.12
• /
• pp.1239-1246
• /
• 2003

Registration is the process aligning the range data sets from different views in a common coordinate system. In order to achieve a complete 3D model, we need to refine the data sets after coarse registration. One of the most popular refinery techniques is the iterative closest point (ICP) algorithm, which starts with pre-estimated overlapping regions. This paper presents an improved ICP algorithm that can automatically register multiple 3D data sets from unknown viewpoints. The sensor projection that represents the mapping of the 3D data into its associated range image is used to determine the overlapping region of two range data sets. By combining ICP algorithm with the sensor projection constraint, we can make an automatic registration of multiple 3D sets without pre-procedures that are prone to errors and any mechanical positioning device or manual assistance. The experimental results showed better performance of the proposed method on a couple of 3D data sets than previous methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1074-1079
• /
• 2004

So far, many sensors such as a structured grid pattern generator, a laser, and CCD camera to obtain 3D information have been used, but most of algorithms for a calibration are inefficient since a huge memory and experiment time are required. In this paper, the calibration algorithm of a structured grid pattern based on triangulation method is introduced to calculate 3D information in the real world. The beams generated from structured grid pattern generator established horizontally with the CCD camera are projected on the calibration plat. A CCD camera measures the intersection plane of a projected beam and an object plane. The 3D information is calculated using measured and calibration datum. This proposed method in this paper has advantages such as a memory saving and an efficient experimental time since the 3D information is obtained simply the triangulation method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.859-865
• /
• 1999

Many sensors such as a laser, and CCD camera to obtain 3D information have been used, but most of algorithms for laser calibration are inefficient since a huge memory and experiment data are required. This method saves a memory and an experimental data since the 3D information are obtained simply triangulation method. In this paper, the calibration algorithm of a slit km laser based on triangulation method is introduced to calculate 3D information in the real world. The laser beam orthogonally mounted on the XY table is projected on the floor. A CCD camera observes the intersection plane of a light and an object plane. The 3D information is calculated using observed and calibration data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.168-173
• /
• 1999

Many sensors such as a laser, CCD camera to obtain 3D information have been used, but most of calibration algorithms are inefficient since a huge memory and an experiment data for laser calibration are required. In this paper, the calibration algorithm of a slit beam laser based on triangulation method is introduced to calculate 3D information in the real world. The laser beam orthogonally mounted on the XY table is projected on the floor. A Cm camera observes the intersection plane of a light and an object plane. The 3D information is calculated using observed and calibration data. This method saves a memory and an experimental data since the 3D information are obtained simply triangulation method.