• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1192-1197
• /
• 1991

This paper describes a method of extracting the 3-D coordinates of feature points of an object from two images taken by one camera. The first image is from a CCD camera before approaching the object and the second image is from same camera after approaching the object along the optical axis. In the two images, the feature points appear at different position on the screen due to image enlargement. From the change of positions of feature points their world coordinates are calculated. In this paper, the correspondence problem is solved by image shrinking and correlation.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.639-642
• /
• 1999

There exist geometrically invariant relations in single-view images under a specific geometrical structure. This invariance may be utilized for 3D object recognition. Two types of invariants are compared in terms of the robustness to the variation of the feature points. Deviation of the invariant relations are measured by adding random noise to the feature point location. Zhu’s invariant requires six points on adjacent planes having two sets of four coplanar points, whereas the Kaist method requires four coplanar points and two non-coplanar points. Experimental results show that the latter method has the advantage in choosing feature points while suffering from weak robustness to the noise.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.1
• /
• pp.7-16
• /
• 2010

Face recognition of face images is an active subject in the area of computer pattern recognition, which has a wide range of potential. Automatic extraction of face image of the feature points is an important step during automatic face recognition. Whether correctly extract the facial feature has a direct influence to the face recognition. In this paper, a new method of facial feature extraction based on Discrete Wavelet Transform is proposed. Firstly, get the face image by using PC Camera. Secondly, decompose the face image using discrete wavelet transform. Finally, we use the horizontal direction, vertical direction projection method to extract the features of human face. According to the results of the features of human face, we can achieve face recognition. The result show that this method could extract feature points of human face quickly and accurately. This system not only can detect the face feature points with great accuracy, but also more robust than the tradition method to locate facial feature image.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.322-324
• /
• 2007

In this paper, an eye-in-hand visual servoing strategy for keeping feature points within the FOV(field-of-view) is proposed. We first specify the FOV constraint which must be satisfied to keep the feature points within the FOV. It is expressed as the inequality relationship between (i) the LOS(jine-of-sight) angles of the center of the feature points from the optical axis of the camera and (ii) the distance between the object and the camera. We then design a nonlinear feedback controller which decouples linearly the translational and rotational control loops. Finally, we show that appropriate choice of the controller gains assures to satisfy the FOV constraint. The main advantage of our approach over the previous ones is that the trajectory of the camera is smooth and circular-like. Furthermore, ours can be applied to the large camera displacement problem.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.2
• /
• pp.75-81
• /
• 2006

The purpose of this paper is to recognize the feature points of ECG and human pulse -which signal shows the electric and physical characteristics of heart respectively- using wavelet transform. Wavelet transform is proper method to analyze a signal in time-frequency domain. In the process of wavelet decomposition and reconstruction of ECG and human pulse signal, we removed the noises of signal and recognized the feature points of signal using some of decomposed component of signal. We obtained the result of recognition rate that is estimated about 95.45$\%$ in case of QRS complex, 98.08$\%$ in case of S point and P point and 92.81$\%$ in case of C point. And we computed diagnosis parameters such as RRI, U-time and E-time.

• Proceedings of the KOSOMBE Conference
• /
• v.1998 no.11
• /
• pp.263-264
• /
• 1998

In this paper, we present the result of feature points recognition and classification of radial pulse by the shape of pulse wave. And we analyze radial pulse in frequency domain. The recognition algorithm use the method which runs in parallel with both the data of ECG and differential pulse simultaneously to recognize the feature points. Also fie specified 3-time elements of pulse wave as main parameters for diagnosis and measured them by execution of algorithm, then we classify the shape of radial pulse by existence and position of feature points. lastly we execute frequency analysis on the feature points and get the power spectrum of radial pulse.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.680-681
• /
• 2015

This study develops an algorithm that automatically performs reverse engineering on three-dimensional (3D) sweeping shapes using a user's pre-defined feature templates and 3D point cloud data (PCD) of sweeping shapes. Existing methods extract 3D sweeping shapes by extracting points on a PCD cross section together with the center point in order to perform curve fitting and connect the center points. However, a drawback of existing methods is the difficulty of creating a 3D sweeping shape in which the user's preferred feature center points and parameters are applied. This study extracts shape features from cross-sectional points extracted automatically from the PCD and compared with pre-defined feature templates for similarities, thereby acquiring the most similar template cross-section. Fitting the most similar template cross-section to sweeping shape modeling makes the reverse engineering process automatic.

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.429-436
• /
• 2010

This paper presents a method to extract 3D outlines of objects in an image obtained from a monocular vision. After detecting the general outlines of the object by MOPS(Multi-Scale Oriented Patches) -algorithm and we obtain their spatial coordinates. Simultaneously, it obtains the space-coordinates with feature points to be immanent within the outlines of objects through SIFT(Scale Invariant Feature Transform)-algorithm. It grasps a form of objects to join the space-coordinates of outlines and SIFT feature points. The method which is proposed in this paper, it forms general outlines of objects, so that it enables a rapid calculation, and also it has the advantage capable of collecting a detailed data because it supplies the internal-data of outlines through SIFT feature points.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.25-37
• /
• 2000

The trajectories of feature points can be defined by the correspondences between points in consecutive frames. The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. The trajectories of feature points are determined by calculating the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights are automatically updated in order to properly reflect the motion characteristics. We solve the correspondence problem as an optimal graph search problem, considering that the existence of false feature points may have serious effect on the correspondence search. The proposed algorithm finds a local optimal correspondence so that the effect of false feature point can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O($m^2n$) in the worst case, where m and n arc the number of feature points in two consecutive frames. By considering false feature points and by properly reflecting motion characteristics, the proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.2 s.302
• /
• pp.11-18
• /
• 2005

To detect vehicles in image, first the image is transformed with the steerable pyramid which has independent directions and levels. Feature vectors are the collection of filter responses at different scales of a steerable image pyramid. For the detection of vehicles in image, feature vectors in feature points of the vehicle image is used. First the feature points are selected with the grid points in vehicle image that are evenly spaced, and second, the feature points are comer points which m selected by human, and last the feature points are corner Points which are selected in grid points. Next the feature vectors of the model vehicle image we compared the patch of the test images, and if the distance of the model and the patch of the test images is lower than the predefined threshold, the input patch is decided to a vehicle. In experiment, the total 11,191 vehicle images are captured at day(10,576) and night(624) in the two local roads. And the $92.0\%$ at day and $87.3\%$ at night detection rate is achieved.