• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.3
• /
• pp.217-226
• /
• 2003

A novel fingerprint ridge feature extraction using sequential labeling of thinned fingerprint image is proposed, which is invariant to position translation, scaling, and rotation. the proposed algorithm labels ridges of thinned fingerprint image sequentially using vertical line that goes through fingerprint core point. Then, we extract a feature from each labeled ridge and the extraction process is based on the type fo the ridge and a minutiae ridge angle in the ridge. The feature extracted through this process enables us to find out the kind of various minutiae and minutiae angle. As a result of the experiment using two thinned fingerprint images, we finally confirm that proposed algorithm is not related to position translation, scaling, and rotation.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.9
• /
• pp.345-350
• /
• 2018

This study is an algorithm for detecting vein pattern features important for finger vein recognition. The feature detection algorithm is important because it greatly affects recognition results in pattern recognition. The recognition rate is degraded because the reference is changed according to the finger position change. In addition, the image obtained by irradiating the finger with infrared light is difficult to separate the image background and the blood vessel pattern, and the detection time is increased because the image preprocessing process is performed. For this purpose, the presented algorithm can be performed without image preprocessing, and the detection time can be reduced. SWDA (Down Slope Trace Waveform) algorithm is applied to the finger vein images to detect the fingertip position and vein pattern. Because of the low infrared transmittance, relatively dark vein images can be detected with minimal detection error. In addition, the fingertip position can be used as a reference in the classification stage to compensate the decrease in the recognition rate. If we apply algorithms proposed to various recognition fields such as palm and wrist, it is expected that it will contribute to improvement of biometric feature detection accuracy and reduction of recognition performance time.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.1
• /
• pp.43-51
• /
• 1999

Producing the relevant information (features) from the CAD models of CAM, called feature recognition or extraction, is the essential stage for the integration of CAD and CAM. Most feature recognition methods, however, have problems in the recognition of intersecting features because they do not handle the intersection geometry properly. In this paper, we propose a machining feature recognition algorithm, which has a solid model consisting of orthogonal primitives as input. The algorithm calculates candidate features and constitutes the Intersection Geometry Matrix which is necessary to represent the spatial relation of candidate features. Finally, it recognizes machining features from the proposed candidate features dividing and growing systems using half space and Boolean operation. The algorithm has the following characteristics: Though the geometry of part is complex due to the intersections of design primitives, it can recognize the necessary machining features. In addition, it creates the Maximal Feature Volumes independent of the machining sequences at the feature recognition stage so that it can easily accommodate the change of decision criteria of machining orders.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.4
• /
• pp.245-254
• /
• 2007

This research proposed feature extraction algorithms as an input of STEP Ap214 data, and feature parameterization process to simplify further design change and maintenance. The procedure starts with suppression of blend faces of an input solid model to generate its simplified model, where both constant and variable-radius blends are considered. Most existing cell decomposition algorithms utilize concave edges, and they usually require complex procedures and computing time in recomposing the cells. The proposed algorithm using reference features, however, was found to be more efficient through testing with a few sample cases. In addition, the algorithm is able to recognize depression features, which is another strong point compared to the existing cell decomposition approaches. The proposed algorithm was implemented on a commercial CAD system and tested with selected industrial product models, along with parameterization of recognized features for further design change.

• Journal of the Semiconductor & Display Technology
• /
• v.16 no.2
• /
• pp.61-65
• /
• 2017

Recently, the interest and research on 360 camera and 360 image production are expanding. In this paper, we describe the feature extraction algorithm, alignment and image blending that make up the feature-based stitching system. And it deals with the theory of representative algorithm at each stage. In addition, the feature-based stitching system was implemented using OPENCV library. As a result of the implementation, the brightness of the two images is different, and it feels a sense of heterogeneity in the resulting image. We will study the proper preprocessing to adjust the brightness value to improve the accuracy and seamlessness of the feature-based stitching system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.2
• /
• pp.36-44
• /
• 2009

In this paper, we suggest a system of detecting a vehicle with lane violation, which can detect the vehicle with lane violation, by using the feature point tracking. The whole algorithm in the suggested system of detecting a vehicle with lane violation is composed of three stages such as feature extraction, register and tracking in feature for the tracking-targeted vehicle, and detecting a vehicle with lane violation. In the stage of feature extraction, the feature is extracted from the inputted image by sing the feature-extraction algorithm available for the real-time processing. The extracted features are again selected the racking-targeted feature. The registered feature is tracked by using NCC(normalized cross correlation). Finally, whether or not lane violation is finally detected by using information on the tracked features. As a result of experimenting the suggested system by using the acquired image in the section with a ban on intervention, the excellent performance was shown with 99.09% for positive recognition ratio and 0.9% for error ratio. The fast processing speed could be obtained in 34.48 frames per second available for real-time processing.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.447-448
• /
• 2006

In this paper, we propose tracking algorithm using multi resolution in wavelet transform domain. This algorithm consists of two steps. The first step is feature extraction that is select feature-points using 1-level wavelet transform in ROI (Region of Interest). The other step is feature tracking. Based on multi resolution of wavelet transform, we estimate a displacement between current frame and next frame on the basis of selected feature-points. Experimental results show that the proposed algorithm confirmed a better performance than a centroid tracking and correlation tracking.

• Journal of Biomedical Engineering Research
• /
• v.17 no.4
• /
• pp.545-552
• /
• 1996

Researches on chromosome are very significant in cytogenetics since a gene of the chromosome controls revelation of the inheritance plasma The human chromosome analysis is widely used to diagnose genetic disease and various congenital anomalies. Many researches on automated chromosome karyotype analysis has been carried out, some of which produced commercial systems. However, there still remains much room for improving the accuracy of chromosome classification. In this paper, we propose an algorithm for reconstruction of the chromosDme image to improve the chromosome classification accuracy. Morphological feature parameters are extracted from the reconstructed chromosome images. The reconstruction method from chromosome image is the 32 direction line algorithm. We extract three morphological feature parameters, centromeric index(C.I.), relative length ratio(R.L.), and relative area ratio(R.A.), by preprocessing ten human chromosDme images. The experimental results show that proposed algorithm is better than that of other researchers'comparing by feature parameter errors.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.11
• /
• pp.1156-1161
• /
• 2006

This paper describes a fast image labeling algorithm for the feature extraction of connected components. Labeling the connected regions of a digitized image is a fundamental computation in image analysis and machine vision, with a large number of application that can be found in various literature. This algorithm is designed for the surface defect inspection of Cold Mill Strip. The labeling algorithm permits to separate all of the connected components appearing on the Cold Mill Strip.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.6
• /
• pp.929-936
• /
• 1990

This paper describes the method of the Korean character recognition by means of feature points extraction. Also, the preprocessing neural chip for noise elimination, smoothing, thinning and feature point extraction has been designs. The subpatterns were separated by means of advanced index algorithm using mask, and recognized by means of feature points classification. The separation of the Korean character subpatterns was abtained about 97%, and the recognition of the Korean characters was abtained about 95%. The preprocessing neural chip was simulated on SPICE and layouted by double CMOS 2\ulcorner design rule.