• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.2
• /
• pp.34-42
• /
• 1997

This paper deals with the recognition of closed planar shape using a three dimensional spectral feature vector which is derived from the FFT(Fast Fourier Transform) spectrum of contour sequence and fuzzy ARTMAP neural network classifier. Contour sequences obtained from 2-D planar images represent the Euclidean distance between the centroid and all boundary pixels of the shape, and are related to the overall shape of the images. The Fourier transform of contour sequence and spectrum analyzer are used as a means of feature selection and data reduction. The three dimensional spectral feature vectors are extracted by spectrum analyzer from the FFT spectrum. These spectral feature vectors are invariant to shape translation, rotation and scale transformation. The fuzzy ARTMAP neural network which is combined with two fuzzy ART modules is trained and tested with these feature vectors. The experiments including 4 aircrafts and 4 industrial parts recognition process are presented to illustrate the high performance of this proposed method in the recognition problems of noisy shapes.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.20 no.11
• /
• pp.1009-1017
• /
• 2010

As rotating machines play an important role in industrial applications such as aeronautical, naval and automotive industries, many researchers have developed various condition monitoring system and fault diagnosis system by applying various techniques such as signal processing and pattern recognition. Recently, fault diagnosis systems using artificial neural network have been proposed. For effective fault diagnosis, this paper used MLP(multi-layer perceptron) network which is widely used in pattern classification. Since using obtained signals without preprocessing as inputs of neural network can decrease performance of fault classification, it is very important to extract significant features of captured signals and to apply suitable features into diagnosis system according to the kinds of obtained signals. Therefore, this paper proposes the decision method of the proper feature vectors about each fault signal for neural-network-based fault diagnosis system. We applied LPC coefficients, maximum magnitudes of each spectral section in FFT and RMS(root mean square) and variance of wavelet coefficients as feature vectors and selected appropriate feature vectors as comparing error ratios of fault diagnosis for sound, vibration and current fault signals. From experiment results, LPC coefficients and maximum magnitudes of each spectral section showed 100 % diagnosis ratios for each fault and the method using wavelet coefficients had noise-robust characteristic.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.30 no.6
• /
• pp.487-497
• /
• 2019

It is very difficult to detect ballistic missiles because of small cross-sections of the radar and the high maneuverability of the missiles. In addition, it is very difficult to recognize and intercept warheads because of the existence of debris and decoy with similar motion parameters in each flight phase. Therefore, feature vectors based on the maneuver, the micro-motion according to flight phase are needed, and the two types of features must be fused for the efficient recognition of ballistic warhead regardless of the flight phase. In this paper, we introduce feature vectors appropriate for each flight phase and an effective method to fuse them at the feature vector-level and classifier-level. According to the classification simulations using the radar signals predicted by the CAD models, the closer the warhead was to the final destination, the more improved was the classification performance. This was achieved by the classifier-level fusion, regardless of the flight phase in a noisy environment.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.16 no.1 s.106
• /
• pp.27-33
• /
• 2006

Fault diagnosis and condition monitoring for rotating machines are important for efficiency and accident prevention. The process of fault diagnosis is to extract the feature of signals and to classify each state. Conventionally, fault diagnosis has been developed by combining signal processing techniques for spectral analysis and pattern recognition, however these methods are not able to diagnose correctly for certain rotating machines and some faulty phenomena. In this paper, we add a minimum detection error algorithm to the previous method to reduce detection error rate. Vibration signals of the induction motor are measured and divided into subband signals. Each subband signal is processed to obtain the RMS, standard deviation and the statistic data for constructing the feature extraction vectors. We make a study of the fault diagnosis system that the feature extraction vectors are applied to K-means clustering algorithm and minimum detection error algorithm.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.807-823
• /
• 2018

Speaker verification system performance depends on the utterance of each speaker. To verify the speaker, important information has to be captured from the utterance. Nowadays under the constraints of limited data, speaker verification has become a challenging task. The testing and training data are in terms of few seconds in limited data. The feature vectors extracted from single frame size and rate (SFSR) analysis is not sufficient for training and testing speakers in speaker verification. This leads to poor speaker modeling during training and may not provide good decision during testing. The problem is to be resolved by increasing feature vectors of training and testing data to the same duration. For that we are using multiple frame size (MFS), multiple frame rate (MFR), and multiple frame size and rate (MFSR) analysis techniques for speaker verification under limited data condition. These analysis techniques relatively extract more feature vector during training and testing and develop improved modeling and testing for limited data. To demonstrate this we have used mel-frequency cepstral coefficients (MFCC) and linear prediction cepstral coefficients (LPCC) as feature. Gaussian mixture model (GMM) and GMM-universal background model (GMM-UBM) are used for modeling the speaker. The database used is NIST-2003. The experimental results indicate that, improved performance of MFS, MFR, and MFSR analysis radically better compared with SFSR analysis. The experimental results show that LPCC based MFSR analysis perform better compared to other analysis techniques and feature extraction techniques.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.86-89
• /
• 1987

In this paper, feature vectors composed of 6 features of Fourier spectrum of 2-D image at each projection angle and 7 features of invariant moments are defined. The feature are extracted by optical Fourier transformer and Radon transformer. After extracting the feature, the input pattern is recognized using the squared Mahalanobis distance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.27-36
• /
• 2007

Changeable biometrics identify a person using transformed biometric data instead of original biometric data in order to enhance privacy and security in biometrics when biometric data is compromised. In this paper, a novel scheme which generates changeable face templates for statistical appearance-based face recognition is proposed. Two different original face feature vectors are extracted from two different appearance-based approaches, respectively, each original feature vector is normalized, and its elements are re-ordered. Finally a changeable face template is generated by weighted addition between two normalized and scrambled feature vectors. Since the two feature vectors are combined into one by a two to one mapping, the original two feature vectors are not easily recovered from the changeable face template even if the combining rule is known. Also, when we need to make new changeable face template for a person, we change the re-ordering rule for the person and make a new feature vector for the person. Therefore, the security and privacy in biometric system can be enhanced by using the proposed changeable face templates. In our experiments, we analyze the proposed method with respect to performance and security using an AR-face database.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.3 no.1
• /
• pp.43-50
• /
• 1985

This paper describes an algorithm recognizing multi-font printed numeric characters. In order to extract feature selection of printed numeric characters. this paper describes an algorithm using stoke density function. Printed numeric characters are recognized by using the set of stroke-density feature vectors.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.39-49
• /
• 2000

In this paper, we propose an optimizing feature extraction method for multiclass problems assuming normal distributions. Initially, We start with an arbitrary feature vector Assuming that the feature vector is used for classification, we compute the classification error Then we move the feature vector slightly in the direction so that classification error decreases most rapidly This can be done by taking gradient We propose two search methods, sequential search and global search In the sequential search, an additional feature vector is selected so that it provides the best accuracy along with the already chosen feature vectors In the global search, we are not constrained to use the chosen feature vectors Experimental results show that the proposed algorithm provides a favorable performance.