• ETRI Journal
• /
• v.25 no.2
• /
• pp.101-108
• /
• 2003

This paper proposes an improved vascular pattern extraction algorithm for person verification applications. The proposed direction-based vascular pattern extraction (DBVPE) algorithm is based on the directional information of vascular patterns. It applies two different filters to the input images: row vascular pattern extraction filter (RVPEF) for effective extraction of the abscissa vascular patterns and column vascular pattern extraction filter (CVPEF) for effective extraction of the ordinate vascular patterns. We use the combined output of both filters to obtain the final hand vascular patterns. Unlike the conventional hand vascular pattern extraction algorithm, the directional extraction approach prevents loss of the vascular pattern connectivity. To validate the DBVPE algorithm, we used a prototype system with a DSP processor. The prototype system shows approximately a three-times better false acceptance rate (FAR) than the conventional single filter algorithm.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.1
• /
• pp.48-59
• /
• 1992

This paper presents the design of a layout processing system that performs circuit and symbolic extraction from hierarchical designs containing arbitrarily shaped layout. The system is flexible enough to deal with various technologies, MOS or bipolar, by providing extraction rules in the form of technology files. In this paper, new efficient algorithms for trapezoidal decomposition of polygon and symbolic path extraction using trapezoidal template are proposed for symbolic extraction. Circuit and symbolic extractor is developed as an integrated design environment of SOLID system.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.228-230
• /
• 2009

Lane extraction is basically required for a driving car to understand its external road environments via a camera. In this paper, a lane extraction method using "Sobel Intensity Profile" is described. The Sobel intensity profile is obtained using only vertical edge components of Sobel edge outputs, and used to yield fitted lines for lanes. The RANAC algorithm is applied to fit lines using only inliers. Experimental results have shown the reliability of the proposed lane extraction method.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.647-650
• /
• 1999

In this Paper, we propose an optimal feature extraction for multiclass problems through proper choice of initial feature vectors. Although numerous feature extraction algorithms have been proposed, those algorithms are not optimal for multiclass problems. Recently, an optimal feature extraction algorithm for multiclass problems has been proposed, which provides a better performance than the conventional feature extraction algorithms. In this paper, we improve the algorithm by choosing good initial feature vectors. As a result, the searching time is significantly reduced. The chance to be stuck in a local minimum is also reduced.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.61-64
• /
• 2002

In this paper, we propose the iris feature extraction by using statistical methods. There are many approaches for iris feature extraction, but most of them require a set of parameters that one should choose for the transformation to obtain a useful representation of the iris. It would be most useful to estimate the method of the iris feature extraction from iris itself. Therefore, we apply the unsupervised statistical methods for the iris feature extraction.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.132-135
• /
• 2004

Building information plays a key role in diverse applications such as urban planning, telecommunication and environment monitoring. Automatic building extraction has been a prime interest in the field of GIS and photogrammetry. In this paper, we presented an automatic approach for building extraction from lidar data. The proposed approach is divided into four processes: pre-processing, filtering, segmentation and building extraction. Experimental results showed that the proposed method detected most of buildings with less commission and omission errors.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.28-34
• /
• 1994

In this paper, a new time-domain parameter extraction method for speech recognition is proposed. The suggested emthod is based on the fact that the local peak-to-peak interval, i.e., the interval between maxima and minima of speech waveform is closely related to the frequency component of the speech signal. The parameterization is achieved by a sort of filter bank technique in the time domain. To test the proposed parameter extraction emthod, an isolated word recognizer based on Vector Quantization and Hidden Markov Model was constructed. As a test material, 22 words spoken by ten males were used and the recognition rate of 92.9% was obtained. This result leads to the conclusion that the new parameter extraction method can be used for speech recognition system. Since the proposed method is processed in the time domain, the real-time parameter extraction can be implemented in the class of personal computer equipped onlu with an A/D converter without any DSP board.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4533-4551
• /
• 2014

The effective extraction of key frames from a video stream is an essential task for summarizing and representing the content of a video. Accordingly, this paper proposes a new and fast method for extracting key frames from a compressed video. In the proposed approach, after the entire video sequence has been segmented into elementary content units, called shots, key frame extraction is performed by first assigning the number of key frames to each shot, and then distributing the key frames over the shot using a probabilistic approach to locate the optimal position of the key frames. Moreover, we implement our proposed framework in Android to confirm the validity, availability and usefulness. The main advantage of the proposed method is that no time-consuming computations are needed for distributing the key frames within the shots and the procedure for key frame extraction is completely automatic. Furthermore, the set of key frames is independent of any subjective thresholds or manually set parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.34-39
• /
• 1999

In this paper, boundary extraction algorithm is suggested by removing boundary noises efficiently and simplifying object shape in binary image. To remove boundary noises, $2{times}2$ mask boundary extraction algorithm is modified . Proposed method is designed to generate a symmetric path for the parasitic branch noise and to analysis traced features on end point of noise. It can extract more simplified object boundary but preserve original object shape by combining white background color extraction result with foreground extraction result. The usefulness of the proposed method was proved through experiments with various binary images.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.395-398
• /
• 2017

We propose a web crawler system with keyword extraction function in this paper. Researches on the keyword extraction in existing text mining are mostly based on databases which have already been grabbed by documents or corpora, but the purpose of this paper is to establish a real-time keyword extraction system which can extract the keywords of the corresponding text and store them into the database together while grasping the text of the web page. In this paper, we design and implement a crawler combining RAKE keyword extraction algorithm. It can extract keywords from the corresponding content while grasping the content of web page. As a result, the performance of the RAKE algorithm is improved by increasing the weight of the important features (such as the noun appearing in the title). The experimental results show that this method is superior to the existing method and it can extract keywords satisfactorily.