• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.187-192
• /
• 2009

In this paper the extended algorithm of valley energy was proposed In order to detect the robust features of the face The proposed energy had the variable type without the constant size of valley mask for measuring the gray value among pixels By accumulating the results generated by the various masks the information of valley energy was so diversified. Then the robust energy which is independent of the environments was maded. The various experiments proved that The proposed method showed the detection rate of 98 percentage in the features of the face region.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.563-570
• /
• 2002

Robust extraction of 3D facial features and global motion information from 2D image sequence for the MPEG-4 SNHC face model encoding is described. The facial regions are detected from image sequence using multi-modal fusion technique that combines range, color and motion information. 23 facial features among the MPEG-4 FDP (Face Definition Parameters) are extracted automatically inside the facial region using color transform (GSCD, BWCD) and morphological processing. The extracted facial features are used to recover the 3D shape and global motion of the object using paraperspective camera model and SVD (Singular Value Decomposition) factorization method. A 3D synthetic object is designed and tested to show the performance of proposed algorithm. The recovered 3D motion information is transformed into global motion parameters of FAP (Face Animation Parameters) of the MPEG-4 to synchronize a generic face model with a real face.

• Journal of KIISE:Software and Applications
• /
• v.28 no.10
• /
• pp.764-772
• /
• 2001

This paper describes fingerprint matching algorithm using connected information between minutiae. We regard minutiae as ridge bifurcation and ridge ending. Features are composed of minutia's position, type(ridge bifurcation or ridge ending) ridge direction and connected ridge information. While the minutiae are extracted, we store connected in information between minutiae on the same ridge. They are used to find corresponding point pairs. Minutiae are aligned completely by two corresponding point pairs and point pattern matching is achieved by counting the number of overlapping pairs. It is invariable t translation and rotation. We have tested proposed method on the 445 fingerprints from 89 persons. These experimental results show that proposed algorithm improve 33% in speed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.75-79
• /
• 2009

In this paper the method was proposed which uses ${\lambda}$-fuzzy measure to detect the edge of the features of the face region. In the conventional method the features was founded using valley, brightness and edge. This method had its drawbacks that it is so sensitive to the external noises and environments. This paper proposed ${\lambda}$-fuzzy measure to cope with this drawbacks. By considering each weight of the pixels the integral evaluation was considered using the center of area method. Thus the continuity of the edge was kept by way of the neighborhood information and the reduction of time complexity wad resulted in.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.835-838
• /
• 2008

In this paper, we present automatic face detection and tracking which is robustness in rotation and translation. Detecting a face image, we used Haar-like feature, which is fast detect facial image. Also tracking, we applied Lucas-Kanade feature tracker and KLT algorithm, which has robustness for rotated facial image. In experiment result, we confirmed that face detection and tracking which is robustness in rotation and translation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2363-2371
• /
• 2015

In this paper, we propose a new feature matching algorithm which is robust to the viewpoint change by using the FAST(Features from Accelerated Segment Test) feature detector and the SIFT(Scale Invariant Feature Transform) feature descriptor. The original FAST algorithm unnecessarily results in many feature points along the edges in the image. To solve this problem, we apply the principal curvatures for refining it. We use the SIFT descriptor to describe the extracted feature points and calculate the homography matrix through the RANSAC(RANdom SAmple Consensus) with the matching pairs obtained from the two different viewpoint images. To make feature matching robust to the viewpoint change, we classify the matching pairs by calculating the Euclidean distance between the transformed coordinates by the homography transformation with feature points in the reference image and the coordinates of the feature points in the different viewpoint image. Through the experimental results, it is shown that the proposed algorithm has better performance than the conventional feature matching algorithms even though it has much less computational load.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.256-257
• /
• 2022

In this paper, we introduce a method of extracting three-dimensional feature points through the movement of a single mobile device. Using a monocular camera, a 2D image is acquired according to the camera movement and a baseline is estimated. Perform stereo matching based on feature points. A feature point and a descriptor are acquired, and the feature point is matched. Using the matched feature points, the disparity is calculated and a depth value is generated. The 3D feature point is updated according to the camera movement. Finally, the feature point is reset at the time of scene change by using scene change detection. Through the above process, an average of 73.5% of additional storage space can be secured in the key point database. By applying the algorithm proposed to the depth ground truth value of the TUM Dataset and the RGB image, it was confirmed that the\re was an average distance difference of 26.88mm compared with the 3D feature point result.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.99-107
• /
• 2011

The feature extraction of asterias amurensis by using patterns is difficult to extract all the concave and convex features of asterias amurensis nor classify concave and convex. Concave and convex as important structural features of asterias amurensis are the features which should be found and the classification of concave and convex is also necessary for the recognition of asterias amurensis later. Accordingly, this study suggests the technique to extract the features of concave and convex, the main features of asterias amurensis. This technique classifies the concave and convex features by using the multi-directional linear scanning and form the candidate groups of the concave and convex feature points and decide the feature points of the candidate groups and apply convex hull algorithm to the extracted feature points. The suggested technique efficiently extracts the concave and convex features, the main features of asterias amurensis by dividing them. Accordingly, it is expected to contribute to the studies on the recognition of asterias amurensis in the future.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.116-123
• /
• 2009

Feature point matching, which is finding the corresponding points from two images with different viewpoint, has been used in various vision-based applications and the demand for the real-time operation of the matching is increasing these days. This paper presents a real-time feature point matching method by using a local descriptor derived by Zernike moments. From an input image, we find a set of feature points by using an existing fast corner detection algorithm and compute a local descriptor derived by Zernike moments at each feature point. The local descriptor based on Zernike moments represents the properties of the image patch around the feature points efficiently and is robust to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions with fixed size in advance and store them in lookup tables. The initial matching results are acquired by an Approximate Nearest Neighbor (ANN) method and false matchings are eliminated by a RANSAC algorithm. In the experiments we confirmed that the proposed method matches the feature points in images with various transformations in real-time and outperforms existing methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.55-68
• /
• 2014

Some infrastructure these days is usually constructed under the ground for it to not interfere the foot-traffic of pedestrians, and thus, it is difficult to visually confirm the accurate location of the site where the establishments must be buried. These technical difficulties increase the magnitude of the problems that could arise from over-reliance on the experience of the worker or a mere blueprint. Such problems include exposure to flood and collapse. This paper proposes a constructor-oriented visualization system via mobile gadgets in general construction sites with occluded structures. This proposal is consisted with three stages. First, "Stage of detecting manhole and extracting features" detects and extracts the basis point of occluded structures which is unoccluded manhole. Next, "Stage of tracking features" tracks down the extracted features in the previous stage. Lastly, "Stage of visualizing occluded constructions" analyzes and synthesizes the GPS data and 3D objects obtained from mobile gadgets in the previous stages. This proposal implemented ideal method through parallel analysis of manhole detection, feature extraction, and tracking techniques in indoor environment, and confirmed the possibility through occluded water-pipe augmentation in real environment. Also, it offers a practical constructor-oriented environment derived from the augmented 3D results of occluded water-pipings.