• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.642-645
• /
• 2009

Brain Computer Interface (BCI) is a communication pathway between devices (computers) and human brain. It treats brain signals in real-time basis and discriminates some information of what human brain is doing. In this work, we develop a EEG BCI system using a feature extraction such as common spatial pattern (CSP) and a classifier using Fisher linear discriminant analysis (FLDA). Two-class EEG motor imagery movement datasets with both cued and uncued are tested to verify its feasibility.

• Journal of the Korean Data and Information Science Society
• /
• v.7 no.2
• /
• pp.235-245
• /
• 1996

In this paper, we studied about several methods of testing hypothesis of correlation, specially Approximate method, Empirical method and Bootstrap method. The Approximate method is based on the Fisher's Z-transformation and the Empirical and Bootstrap methods approximate the distribution of the sample correlation coefficient by Monte Carlo simulation and Bootstrap technique, respectively. In order to compare how good these tests are, we computed powers under various alternatives. Consequently, we see that the Approximate test performs very well even if in small sample and all tests have almost the same power in large sample.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.97-102
• /
• 1998

In this paper, 1 proposed methods of fractal image compression to get better orginal images in a high compression raitos with encoding image effectively. For given signal-to-noise raitos tolerances, show the proposed compression method are higher than Fisher's method for compression raitos at all thresholds. This is due to improve compression time in the local IFS structure that reduce PIFS information storage requirements from 48bits range blocks to the 40bits.

• International Journal of Computer Science & Network Security
• /
• v.21 no.11
• /
• pp.89-96
• /
• 2021

This work is an extension of my work presented a robust and economically efficient method for the Discrimination of four Mung-Beans [1] varieties based on quantitative parameters. Due to the advancement of technology, users try to find the solutions to their daily life problems using smartphones but still for computing power and memory. Hence, there is a need to find the best classifier to classify the Mung-Beans using already suggested features in previous work with minimum memory requirements and computational power. To achieve this study's goal, we take the experiments on various supervised classifiers with simple architecture and calculations and give the robust performance on the most relevant 10 suggested features selected by Fisher Co-efficient, Probability of Error, Mutual Information, and wavelet features. After the analysis, we replace the Artificial Neural Network and Deep learning with a classifier that gives approximately the same classification results as the above classifier but is efficient in terms of resources and time complexity. This classifier is easily implemented in the smartphone environment.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.177-183
• /
• 1997

The cumulative function of the noncentral t distribution calculate power in testing equality of means of two normal populations and confidence intervals for the ratio of population mean to standard deviation. In this paper, the evaluation of the cumulative function of noncentral t distribution is applied to the neural network consists of the multi-layer perception structure and learning process has the algorithm of the backpropagation. Numerical comparisons are made between the Fisher's values and the results obtained by neural network theory.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.245-248
• /
• 2003

In this paper, we propose a learning method of the performance improvement of the LVQ network using the radios of the hypersphere with the n-dimensional input vectors. The proposed method determines the reference vectors using the radius of the hypersphere include n+1 set of input vectors in the same class. In order to verify the effectiveness of the proposed method, we performed experiments on the Fisher's IRIS data. The experimental results showed that the proposed method improves considerably on the performance of the conventional LVQ network.

• Journal of Applied Reliability
• /
• v.9 no.1
• /
• pp.13-28
• /
• 2009

In this paper we propose a method for designing optimum degradation test based on nonlinear random-coefficients models. We use the approximated expression of the Fisher information matrix for nonlinear random-coefficients models. We apply the simplex algorithm to the inverse of the determinant of Fisher information matrix to satisfy the D-optimal criterion. By comparison of the results from PDP degradation data, we suggest a general guideline to obtain optimum experimental design for determining inspection intervals and number of samples in degradation testing.

• Communications for Statistical Applications and Methods
• /
• v.23 no.4
• /
• pp.321-334
• /
• 2016

In this paper, we propose power t distribution based on t distribution. We also study the properties of and inferences for power t model in order to solve the problem of real data showing both skewness and heavy tails. The comparison of skew t and power t distributions is based on density plots, skewness and kurtosis. Note that, at the given degree of freedom, the kurtosis's range of the power t model surpasses that of the skew t model at all times. We draw inferences for two parameters of the power t distribution and four parameters of the location-scale extension of power t distribution via maximum likelihood. The Fisher information matrix derived is nonsingular on the whole parametric space; in addition we obtain the profile log-likelihood functions on two parameters. The response plots for different sample sizes provide strong evidence for the estimators' existence and unicity. An application of the power t distribution suggests that the model can be very useful for real data.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.717-718
• /
• 2008

Fisher Linear Discriminant(FLD) is a sample and intuitive linear feature extraction method in pattern recognition. But in some special cases, such as un-separable case, one class data dispersed into several clustering case, FLD doesn't work well. In this paper, a new discriminant named K-means Fisher Linear Discriminant, which combines FLD with K-means clustering is proposed. It could deal with this case efficiently, not only possess FLD's global-view merit, but also K-means' local-view property. Finally, the simulation results also demonstrate its advantage against K-means and FLD individually.

• Communications for Statistical Applications and Methods
• /
• v.25 no.4
• /
• pp.411-430
• /
• 2018

The Bayesian approach is a suitable alternative in constructing appropriate models for observed record values because the number of these values is small. This paper provides an objective Bayesian analysis method for upper record values arising from the Rayleigh distribution. For the objective Bayesian analysis, the Fisher information matrix for unknown parameters is derived in terms of the second derivative of the log-likelihood function by using Leibniz's rule; subsequently, objective priors are provided, resulting in proper posterior distributions. We examine if these priors are the PMPs. In a simulation study, inference results under the provided priors are compared through Monte Carlo simulations. Through real data analysis, we reveal a limitation of the appropriate confidence interval based on the maximum likelihood estimator for the scale parameter and evaluate the models under the provided priors.