• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.16-22
• /
• 2019

Off-line programming and robot calibration through simulation are essential when setting up a robot in a robot automation production line. In this study, we developed a new robot calibration method to match the CAD data of the production line with the measurement data on the site using 3D scanner. The proposed method calibrates the robot using 3D point cloud data through Iterative Closest Point algorithm. Registration is performed in three steps. First, vertices connected by three planes are extracted from CAD data as feature points for registration. Three planes are reconstructed from the scan point data located around the extracted feature points to generate corresponding feature points. Finally, the transformation matrix is calculated by minimizing the distance between the feature points extracted through the ICP algorithm. As a result of applying the software to the automobile welding robot installation, the proposed method can calibrate the required accuracy to within 1.5mm and effectively shorten the set-up time, which took 5 hours per robot unit, to within 40 minutes. By using the developed system, it is possible to shorten the OLP working time of the car body assembly line, shorten the precision teaching time of the robot, improve the quality of the produced product and minimize the defect rate.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.2
• /
• pp.61-66
• /
• 2019

Augmented reality is a technology that makes a virtual object appear as if it exists in reality by composing a virtual object in real time with the image captured by the camera. In order to augment the virtual object on the object existing in reality, the homography of images utilized to estimate the position and orientation of the object. The homography can be estimated by applying the RANSAC algorithm to the feature points of the images. But the homography estimation method using the RANSAC algorithm has a problem that accurate homography can not be estimated when there are many feature points in the background. In this paper, we propose a method to filter feature points of a background when the object is near and the background is relatively far away. First, we classified the depth image into relatively near region and a distant region using the Otsu's method and improve homography estimation performance by filtering feature points on the relatively distant area. As a result of experiment, processing time is shortened 71.7% compared to a conventional homography estimation method, and the number of iterations of the RANSAC algorithm was reduced 69.4%, and Inlier rate was increased 16.9%.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.9
• /
• pp.738-744
• /
• 2016

In this paper, a robust visual odometry system has been proposed and implemented in an environment with dynamic illumination. Visual odometry is based on stereo images to estimate the distance to an object. It is very difficult to realize a highly accurate and stable estimation because image quality is highly dependent on the illumination, which is a major disadvantage of visual odometry. Therefore, in order to solve the problem of low performance during the feature detection phase that is caused by illumination variations, it is suggested to determine an optimal threshold value in the image binarization and to use an adaptive threshold value for feature detection. A feature point direction and a magnitude of the motion vector that is not uniform are utilized as the features. The performance of feature detection has been improved by the RANSAC algorithm. As a result, the position of a mobile robot has been estimated using the feature points. The experimental results demonstrated that the proposed approach has superior performance against illumination variations.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.463-467
• /
• 2006

Several segmentation algorithms have been proposed for DTM generation or building modeling from airborne LiDAR data. Three components are important for accurate segmentation: (i) the adjacent relationship of n-nearest points or mesh, etc. (ii) the effective decision parameters of height, slope, curvature, and plane condition, (iii) grouping methods. In this paper, we created the topology of point cloud data using the contour tree and implemented the region-growing Terrain and non-terrain points were classified correctly in the segmented data, which can be used also for feature classification.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1991.04a
• /
• pp.309-315
• /
• 1991

This paper presents a method for automatic part feature recognition from the database of AutoCAD system for automatic process planning input. The parts considered in this study are primastic parts composed of faces perpendicular to the X, Y, Z axes and the types of features considered are through steps, blind steps, through slots, blind slots, and pockets. Features are recognized by using the concept of convex points and concave points. The software program is coded by using Turbo Pascal on the IBM PC/AT.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.551-558
• /
• 1994

This paper proposes the algorithm of the feature extraction, making polyline- shape according to extracted points and similarity test on the object represented by contour. The control points which can make approximate curve are extracted as features of the object. Experiments show that this algorithm is a effective method for identification between different shapes.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.7
• /
• pp.125-131
• /
• 1999

In this paper, the algorithms which can track the two dimensional moving circular object using simple vision system are described. In order to track the moving object, the process of finding the object feature points - such as centroid of the object, corner points, area - is indispensable. With the assumption of two-dimensional circular moving object, the centroid of the circular object is computed from three points on the object circumference. Different kinds of algorithms for computing three edge points - simple x directional detection method, stick method. T-shape method are suggested. Through the computer simulation and experiments, three algorithms are compared from the viewpoint of detection accuracy and computational time efficiency.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1013-1014
• /
• 2008

In this paper, we propose a new method of generating 3D face by using single frontal face image and 3D generic face model. By using active appearance model (AAM), the control points among facial feature points were localized in the 2D input face image. Then, the transform parameters of 3D generic face model were found to minimize the error between the 2D control points and the corresponding 2D points projected from 3D facial model. Finally, by using the obtained model parameters, 3D face was generated. We applied this 3D face to 3D game framework and found that the proposed method could make a realistic 3D face of game user.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1523-1533
• /
• 1997

Image registration is concerned with the establishment of correspondence between images of the same scene with translational, rotational, and scaling differences. The estimated transformation parameters between images are very important information in the field of many applications. In this paper, we propose a shape matching scheme for finding correspondence points for images with various differences, Tranditional solutions to this area are unreliable for the rotational and schaling changes between images, and the feature extraction of partially occluded scene. To solve those problems, dominant points on digital curves are detected by scale-space filtering, and initial matching is performed by similarity measure of cumulative curvatures for dominant points. For initial matching segments pairs, optimal matching points are calculated using dynamic programming.Finally, transformation parameters are estimated.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.4 no.1
• /
• pp.13-20
• /
• 1998

Since the digital chart consists of a large number of points, the effective method for the coastline data compression(CDC), storing the data compactly and reproducting the coastline feature accurately, is important. In the CDC, the key technique is to determine the optimal positions as node points in given coastlines. In this paper, a new CDC method, selecting node points with conspicuous coast positions in the view point on navigation and adopting spline interpolation to the nodes partly, is proposed. Using the northern part of KEOJE-DO coastline in Korean chart No.204, CDC experiments are carrie out with various compression ratio. The results fro the influence of coastline shape according to various CDC methods are discussed and presented.