• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.608-612
• /
• 2002

An automatic face and facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features md the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in the image spare by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the fare identification system.

• 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.

• Korean Architects
• /
• s.515
• /
• pp.84-87
• /
• 2012

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1439-1446
• /
• 2011

This paper describes the algorithm that lowers the dimension, maintains the object recognition and significantly reduces the eigenspace configuration time by combining the higher correlation feature information and Principle Component Analysis. Since the suggested method doesn't require a lot of computation than the method using existing geometric information or stereo image, the fact that it is very suitable for building the real-time system has been proved through the experiment. In addition, since the existing point to point method which is a simple distance calculation has many errors, in this paper to improve recognition rate the recognition error could be reduced by using several successive input images as a unit of recognition with K-Nearest Neighbor which is the improved Class to Class method.

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.120-128
• /
• 2012

The loop closure problem is one of the most challenging issues in the vision-based simultaneous localization and mapping community. It requires the robot to recognize a previously visited place from current camera measurements. While the loop closure often relies on visual bag-of-words based on point features in the previous works, however, in this paper we propose a line-based method to solve the loop closure in the corridor environments. We used both the floor line and the anchored vanishing point as the loop closing feature, and a two-step loop closure algorithm was devised to detect a known place and perform the global pose correction. We propose an anchored vanishing point as a novel loop closure feature, as it includes position information and represents the vanishing points in bi-direction. In our system, the accumulated heading error is reduced using an observation of a previously registered anchored vanishing points firstly, and the observation of known floor lines allows for further pose correction. Experimental results show that our method is very efficient in a structured indoor environment as a suitable loop closure solution.

• Journal of Biomedical Engineering Research
• /
• v.40 no.3
• /
• pp.97-104
• /
• 2019

To examine different types of influenza diagnostic test kits automatically, automated rapid influenza diagnostic test method based on image recognition is proposed in this paper. First, the proposed methods classify a variety of the rapid influenza diagnostic test kit based on support vector machine that analyzes the kits' feature point. Then, to improve the accuracy of test, the proposed methods match the histogram of both the target image of influenza kit and the input image of influenza kit for minimizing the effect of environment factors, such as lighting and exposure variations. And, to minimize the effect from composition of the hand-helds devices, the proposed methods extract the feature point and match point-by-point between target image of influenza kit and input image of influenza kit. Experimental results of 124 experimental group show that the proposed methods significantly have effectiveness, which shows 90% accuracy in moderate antigen, for the preliminary examination of influenza, and provides the opportunity for taking action against influenza.

• ETRI Journal
• /
• v.44 no.6
• /
• pp.1034-1046
• /
• 2022

The learning-based multiview stereo (MVS) methods for three-dimensional (3D) reconstruction generally use 3D volumes for depth inference. The quality of the reconstructed depth maps and the corresponding point clouds is directly influenced by the spatial resolution of the 3D volume. Consequently, these methods produce point clouds with sparse local regions because of the lack of the memory required to encode a high volume of information. Here, we apply the atrous spatial pyramid pooling (ASPP) module in MVS methods to obtain dense feature maps with multiscale, long-range, contextual information using high receptive fields. For a given 3D volume with the same spatial resolution as that in the MVS methods, the dense feature maps from the ASPP module encoded with superior information can produce dense point clouds without a high memory footprint. Furthermore, we propose a 3D loss for training the MVS networks, which improves the predicted depth values by 24.44%. The ASPP module provides state-of-the-art qualitative results by constructing relatively dense point clouds, which improves the DTU MVS dataset benchmarks by 2.25% compared with those achieved in the previous MVS methods.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2023.05a
• /
• pp.345-346
• /
• 2023

As the shape and size of detectable objects diversifying recognition and segmentation algorithms have been developed to acquire accurate shape information. Although a high density of data captured by the repetition of scanning improves the accuracy of algorithms the high dense data decreases the efficiency due to its large size. This paper proposes standardization algorithms using the feature of structural members on indoor point cloud data to improve the process. First of all we determine the reduction rate of the density based on the features of the target objects then the data reduction algorithm compresses the data based on the reduction rate. Second the data arrangement algorithm rotates the data until the normal vector of data is aligned along the coordinate axis to allow the following algorithms to operate properly. Final the data arrangement algorithm separates the rotated data into their leaning axis. This allows reverse engineering of indoor point clouds to obtain the efficiency and accuracy of refinement processes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.990-995
• /
• 2010

Harris corner detector is commonly used to detect feature points for recognizing 2-D or 3-D objects. However, the feature points calculated from both of query and target objects need to be same positions to guarantee accurate recognitions. In order to check the positions of calculated feature points, we generate a Huffman tree which is based on adjacent feature values as inputs. However, the structures of two Huffman trees will be same as long as both of a query and targets have same feature values no matter how different their positions are. In this paper, we sort feature values and calculate the Euclidean distances of coordinates between two adjacent feature values. The Huffman Tree is generated with these Euclidean distances. As a result, the information of point locations can be included in the generated Huffman tree. This is the main strategy for accurate recognitions. We call this system as the HRM(Hybrid Retrieval Machine). This system works very well even when artificial random noises are added to original data. HRM can be used to recognize biological data such as proteins, and it will curtail the costs which are required to biological experiments.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.68-78
• /
• 1999

A new algorithm for tracking feature points in an image sequence is presented. Most existing feature tracking algorithms often produce false trajectories, because the matching measures do not precisely reflect motion characteristics. In this paper, three attributes including spatial coordinate, motion direction and motion magnitude are used to calculate the feature point correspondence. The trajectories of feature points are determined by calculation the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights of the attributes are updated reflecting the motion characteristics, so that the robust tracking of feature points is achieved. The proposed algorithm can find the trajectories correctly which has been shown by experimental results.