• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2448-2450
• /
• 1998

For the exact classification of the arm motion this paper proposes EMG pattern recognition method with neural network. For this autoregressive coefficient, linear cepstrum coefficient, and adaptive cepstrum coefficient are selected for the feature parameter of EMG signal, and they are extracted from time series EMG signal. For the function recognition of the feature parameter a radial basis function network, a field of neural network is designed. For the improvement of recognition rate, a number of radial basis function network are combined in parallel, comparing with a backpropagation neural network an existing method.

• Journal of the Semiconductor & Display Technology
• /
• v.12 no.3
• /
• pp.59-64
• /
• 2013

Accurate and robust image registration is important task in many applications such as image retrieval and computer vision. To perform the image registration, essential required steps are needed in the process: feature detection, extraction, matching, and reconstruction of image. In the process of these function, feature extraction not only plays a key role, but also have a big effect on its performance. There are two representative algorithms for extracting image features, which are scale invariant feature transform (SIFT) and speeded up robust feature (SURF). In this paper, we present and evaluate two methods, focusing on comparative analysis of the performance. Experiments for accurate and robust feature detection are shown on various environments such like scale changes, rotation and affine transformation. Experimental trials revealed that SURF algorithm exhibited a significant result in both extracting feature points and matching time, compared to SIFT method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.180-188
• /
• 1995

A modified Kohonen's self-organizing feature map (SOFM) algorithm which has binary reinforcement function and a constant learning rate is proposed. In contrast to the time-varing adaptaion gain of the original Kohonen's SOFM algorithm, the proposed algorithm uses a constant adaptation gain, and adds a binary reinforcement function in order to compensate for the lowered learning ability of SOFM due to the constant learning rate. Since the proposed algorithm does not have the complicated multiplication, it's digital hardware implementation is much easier than that of the original SOFM.

• MALSORI
• /
• v.55
• /
• pp.131-142
• /
• 2005

A mismatch between the training and the test conditions often causes a drastic decrease in the performance of the speech recognition systems. In this paper, non-linear transformation techniques based on histogram equalization in the acoustic feature space are studied for reducing the mismatched condition. The purpose of histogram equalization(HEQ) is to convert the probability distribution of test speech into the probability distribution of training speech. While conventional histogram equalization methods consider only the probability distribution of a test speech, for noise-corrupted test speech, its probability distribution is also distorted. The transformation function obtained by this distorted probability distribution maybe bring about miss-transformation of feature vectors, and this causes the performance of histogram equalization to decrease. Therefore, this paper proposes a new method of calculating noise-removed probability distribution by using assumption that the CDF of noisy speech feature vectors consists of component of speech feature vectors and component of noise feature vectors, and this compensated probability distribution is used in HEQ process. In the AURORA-2 framework, the proposed method reduced the error rate by over $44\%$ in clean training condition compared to the baseline system. For multi training condition, the proposed methods are also better than the baseline system.

• Korean Journal of Remote Sensing
• /
• v.17 no.4
• /
• pp.319-334
• /
• 2001

Extracting primitives from imagery plays an important task in visual information processing since the primitives provide useful information about characteristics of the objects and patterns. The human visual system utilizes features without difficulty for image interpretation, scene analysis and object recognition. However, to extract and to analyze feature are difficult processing. The ultimate goal of digital image processing is to extract information and reconstruct objects automatically. The objective of this study is to develop robust method to achieve the goal of the image processing. In this study, an adaptive strategy was developed by implementing Gabor filters in order to extract feature information and to segment images. The Gabor filters are conceived as hypothetical structures of the retinal receptive fields in human vision system. Therefore, to develop a method which resembles the performance of human visual perception is possible using the Gabor filters. A method to compute appropriate parameters of the Gabor filters without human visual inspection is proposed. The entire framework is based on the theory of human visual perception. Digital images were used to evaluate the performance of the proposed strategy. The results show that the proposed adaptive approach improves performance of the Gabor filters for feature extraction and segmentation.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.295-311
• /
• 1999

An increasing attention is paid to STEP-NC, the next generation CNC controller interfacing STEP-compatible data. In this paper, we first propose an Architecture for the STEP-NC (called FBCC: Feature Baled CNC Controller) accepting feature code compatible with STEP-data, and executing NC motion feature by feature while monitoring the execution status. The main thrust of the paper has been to develop an automatic on-line tool path generation and modification scheme for milling operation. The tool path it generated iota each feature by decomposing into a finite number of primitive features. The key function in the new scheme is haw to accommodate unexpected execution results. In our scheme, the too1 path plinker is designed to have a tracing capability iota the tool path execution so that a new path can be generated from the point where the operation is stopped. An illustrative example is included to show the capability of the developed algorithm.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.526-529
• /
• 2007

Due to its inherent feature of high-resolution satellite, there is strong need in some specific area to minimize the processing time required to get a standard image on hand from downlink signal acquisition. However, in general image processing system, it takes considerable time to get image data up to certain level from raw data acquisition because the huge amount of data is dealt sequentially as input data. This paper introduces the high-speed image processing system which generates the image data only for the area selected by user. To achieve the high speed performance, this system includes Quick Look Image display function with sampling, ROI selection function, Image Line Index function, and Distributed processing function. The developed RPS was applied to KOMPSAT-2 320Mbps downlink channel and its effectiveness was successfully demonstrated. This feature to provide the image product very quickly is expected to promote the application of high resolution satellite image.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.102-110
• /
• 1996

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature subset is selected which optimizes fitness function in genetic algorithm. The fitness function is inversely proportional to classification error, balance between cluster, number of feature used. The binary strings in genetic algorithm determine the feature subset and classification results - error, balance - form fuzzy partition matrix affect reproduction of next genratin. The proposed design scheme is applied to the tire tread patterns and handwriteen alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.840-855
• /
• 2011

In the context of additive noise steganography model, we propose a method to detect least significant bit (LSB) matching steganography in grayscale images. Images are decomposed into detail sub-bands with local linear transform (LLT) masks which are sensitive to embedding. Novel normalized characteristic function features weighted by a bank of band-pass filters are extracted from the detail sub-bands. A suboptimal feature set is searched by using a threshold selection algorithm. Extensive experiments are performed on four diverse uncompressed image databases. In comparison with other well-known feature sets, the proposed feature set performs the best under most circumstances.

• Speech Sciences
• /
• v.14 no.2
• /
• pp.127-135
• /
• 2007

Feature vectors of speech are generally extracted from whole frequency domain. The inherent character of a speaker is located in the low band or high band frequency. However, if the speech is corrupted by narrowband noise with concentrated energy, speaker verification performance is reduced as the individual characteristic is removed. In this paper, we propose a PCA Covariance Model based on the multiband to extract the robust feature vectors against the narrowband noise. First, we divide the overall frequency band into several subbands. Second, the correlation of feature vectors extracted independently from each subband is removed by PCA. The distance obtained from each subband has different distribution. To normalize against the different distribution, we moved the value into the normalized distribution through the mapping function. Finally, the represented value applying the weighting function is used for speaker verification. In the experiments, the proposed method shows better performance of the speaker verification and reduces the computation.