• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.1
• /
• pp.119-127
• /
• 2000

In this study the classified researches the artificial and natural flaws in welding parts are performed using the pattern recognition technology. For this purpose the signal pattern recognition package including the user defined function was developed and the total procedure including the digital signal processing feature extraction feature selection and classifi-er selection is teated by bulk,. Specially it is composed with and discussed using the statistical classifier such as the linear discriminant function the empirical Bayesian classifier. Also the pattern recognition technology is applied to classifica-tion problem of natural flaw(i.e multiple classification problem-crack lack of penetration lack of fusion porosity and slag inclusion the planar and volumetric flaw classification problem), According to this result it is possible to acquire the recognition rate of 83% above even through it is different a little according to domain extracting the feature and the classifier.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.50 no.3
• /
• pp.121-129
• /
• 2001

In this paper, a new efficient feature extraction method based on Daubechies discrete wavelet transform is presented. This paper especially deals with the assessment of process statistical parameter using the features extracted from the wavelet coefficients of measured acoustic emission signals. Since the parameter assessment using all wavelet coefficients will often turn out leads to inefficient or inaccurate results, we selected that level-3 stage of multi decomposition in discrete wavelet transform. We make use of the feature extraction parameter namely, maximum value of acoustic emission signal, average value, dispersion, skewness, kurtosis, etc. The effectiveness of this new method has been verified on ability a diagnosis transformer go through feature extraction in stage of aging(the early period, the middle period, the last period)

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.822-826
• /
• 2001

The statistical analysis of the feature extraction and the neural networks are proposed to recognize a human face. In the preprocessing step, the normalized skin color map with Gaussian functions is employed to extract the region of face candidate. The feature information in the region of the face candidate is used to detect the face region. In the recognition step, as a tested, the 120 images of 10 persons are trained by the backpropagation algorithm. The images of each person are obtained from the various direction, pose, and facial expression. Input variables of the neural networks are the geometrical feature information and the feature information that comes from the eigenface spaces. The simulation results of 10 persons show that the proposed method yields high recognition rates.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.137-146
• /
• 2005

In parametric approach to a signature verification, it generally uses so many redundant features unsuitable for each individual signature that it causes harm, instead. This paper proposes a method of determining personalized weights of a feature set in signature verification with parametric approach by identifying the characteristics of each feature. For an individual signature, we define a degree of how difficult it is for any other person to forge the one's (called 'DFD' as the Degree of Forgery Difficulty). According to the statistical characteristics and the intuitional characteristics of each feature, the standard features are classified into four types. Four types of DFD functions are defined and applied into the distance calculation as a personalized weight factor. Using this method, the error rate of signature verification is reduced and the variation of the performance is less sensitive to the changes of decision threshold.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.117-120
• /
• 1996

The objective of this study is to suggest modified Covariance Structure Analysis that combine with existing Multivariate Statistical Method which is used Casual Analysis Method in Management Information. For this purpose, we'll consider special feature and limitation about Correlation Analysis, Regression Analysis, Path Analysis and connect Covariance Structure Analysis with Statistical Factor Analysis so that theoretical casual model compare with variables structure in collecting data. A example is also presented to show the practical applicability of this approach.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.453-462
• /
• 2005

We derive the influence function on t statistic and find its feature; the influence function on t statistic has two forms depending on the value of ${\mu}_0$. Sample influence functions are used to verify the validity of the derived influence function. We use random samples from normal distribution to show the validity of the function. The simulation study proves that the obtained influence function is very accurate to in estimating changes in t statistic when an observation is added or deleted.

• The Korean Journal of Applied Statistics
• /
• v.26 no.1
• /
• pp.131-139
• /
• 2013

Support vector machines(SVM) may perform poorly in the presence of noise variables; in addition, it is difficult to identify the importance of each variable in the resulting classifier. A feature selection can improve the interpretability and the accuracy of SVM. Most existing studies concern feature selection in the linear SVM through penalty functions yielding sparse solutions. Note that one usually adopts nonlinear kernels for the accuracy of classification in practice. Hence feature selection is still desirable for nonlinear SVMs. In this paper, we compare the performances of nonlinear feature selection methods such as component selection and smoothing operator(COSSO) and kernel iterative feature extraction(KNIFE) on simulated and real data sets.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.1-14
• /
• 2011

While the circulation of images become active, various requirements to manage increasing database are raised. The content-based technology is one of methods to satisfy these requirements. The image is represented by feature vectors extracted by various methods in the content-based technology. The global feature method insures fast matching speed because the feature vector extracted by the global feature method is formed into a standard shape. The global feature extraction methods are classified into two categories, the spatial feature extraction and statistical feature extraction. And each group is divided by what kind of information is used, color feature or gray scale feature. In this paper, we introduce various global feature extraction technologies and compare their performance by accuracy, recall-precision graph, ANMRR, feature vector size and matching time. According to the experiments, the spatial features show good performance in non-geometrical modifications, and the extraction technologies that use color and histogram feature show the best performance.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.6
• /
• pp.104-110
• /
• 1994

We proposed a high speed feature extraction algorithm and developed a feature vector extraction chip for high speed character recognition. It is hard to implement a high speed OCR by software alone with statistical method . Thus, the whole recognition process is divided into functional steps, then pipeline processed so that high speed processing is possible with temporal parallelism of the steps. In this paper we discuss the feature extraction step of the functional steps. To extract feature vector, a character image is normalized to 40$\times$40 pixels. Then, it is divided into 5$\times$5 subregions and 4x4 subregions to construct 41 overlapped subregions(10x10 pixels). It requires to execute more than 500 commands to extract a feature vector of a subregion by software. The proposed algorithm, however, requires only 10 cycles since it can extract a feature vector of a columm of subregion in one cycle with array structure. Thus, it is possible to process 12.000 characters per second with the proposed algorithm. The chip is implemented using EPLD and the effectiveness is proved by developing an OCR using it.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.786-791
• /
• 2011

An optimal feature selection and extraction procedure is an important task that significantly affects the success of brain activity analysis in brain-computer interface (BCI) research area. In this paper, a novel method for extracting the optimal feature from electroencephalogram (EEG) signal is proposed. At first, a student's-t-statistic method is used to normalize and to minimize statistical error between EEG measurements. And, 2D time-frequency data set from the raw EEG signal was extracted using discrete wavelet transform (DWT) as a raw feature, standard deviations and mean of 2D time-frequency matrix were extracted as a optimal EEG feature vector along with other basis feature of sub-band signals. In the experiment, data set 1 of BCI competition IV are used and classification using SVM to prove strength of our new method.