• Korean Journal of Mathematics
• /
• v.18 no.1
• /
• pp.87-96
• /
• 2010

We consider the semilinear biharmonic equation with Dirichlet boundary condition. We give a theorem that there exist at least three nontrivial solutions for the semilinear biharmonic boundary value problem. We show this result by using the critical point theory, the finite dimensional reduction method and the shape of the graph of the corresponding functional on the finite reduction subspace.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.963-982
• /
• 2013

The Galerkin method has been developed mainly for 2nd order differential equations. To get numerical solutions, there are some choices of Riesz bases for the approximation subspace $V_j{\subset}L^2$. In this paper we shall propose a uniform approach to find suitable Riesz bases for higher order differential equations. Especially for the beam equation (4-th order equation), we also report numerical results.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2480-2484
• /
• 2005

Electrical resistance tomograpy (ERT) maps resistivity values of the soil subsurface and characterizes buried objects. The characterization includes location, size, and resistivity of buried objects. In this paper, truncated least squares (TLS) is presented for the solution of the ERT image reconstruction. Results of numerical experiments in ERT solved by the TLS approach is presented and compared to that obtained by the Gauss-Newton method.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.707-720
• /
• 2014

We get a theorem which shows the existence of at least three solutions for some elliptic system with Dirichlet boundary condition. We obtain this result by using the finite dimensional reduction method which reduces the infinite dimensional problem to the finite dimensional one. We also use the critical point theory on the reduced finite dimensioal subspace.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.177-187
• /
• 2014

This paper proposes a fast subspace tracking methods, which is called GVFF FAPI, based on FAPI (Fast Approximated Power Iteration) method and GVFF RLS (Gradient-based Variable Forgetting Factor Recursive Lease Squares). Since the conventional FAPI uses a constant forgetting factor for estimating covariance matrix of source signals, it has difficulty in applying to non-stationary environments such as continuously changing DOAs of source signals. To overcome the drawback of conventioanl FAPI method, the GVFF FAPI uses the gradient-based variable forgetting factor derived from an improved means square error (MSE) analysis of RLS. In order to achieve the decreased subspace error in non-stationary environments, the GVFF-FAPI algorithm used an improved forgetting factor updating equation that can produce a fast decreasing forgetting factor when the gradient is positive and a slowly increasing forgetting factor when the gradient is negative. Our numerical simulations show that GVFF-FAPI algorithm offers lower subspace error and RMSE (Root Mean Square Error) of tracked DOAs of source signals than conventional FAPI based MUSIC (MUltiple SIgnal Classification).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.35-43
• /
• 2010

1D PCA utilized in the face appearance-based face recognition methods such as eigenface-based face recognition method may lead to less face representative power and more computational cost due to the resulting 1D face appearance data vector of high dimensionality. To resolve such problems of 1D PCA, 2D PCA-based face recognition methods had been developed. However, the face representation model obtained by direct application of 2D PCA to a face image set includes both face common features and face distinctive identity features. Face common features not only prevent face recognizability but also cause more computational cost. In this paper, we first develope a model of a face distinctive identity feature subspace separated from the effects of face common features in the face feature space obtained by application of 2D PCA analysis. Then, a novel robust face recognition based on the face distinctive identity feature subspace model is proposed. The proposed face recognition method based on the face distinctive identity feature subspace shows better performance than the conventional PCA-based methods (1D PCA-based one and 2D PCA-based one) with respect to recognition rate and processing time since it depends only on the face distinctive identity features. This is verified through various experiments using Yale A and IMM face database consisting of face images with various face poses under various illumination conditions.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.67-76
• /
• 2008

Reliable face recognition under various illumination environments is essential for successful commercialization. Feature-based face recognition relies on a good choice of feature vectors. Gabor feature vectors are known to be more robust to variations of pose and illumination than any other feature vectors so that they are popularly adopted for face recognition. However, they are not completely independent of illuminations. In this paper, we propose an illumination-robust face recognition method based on the Gabor feature vector illumination PCA model. We first construct the Gabor feature vector illumination PCA model where Gator feature vector space is rendered to be decomposed into two orthogonal illumination subspace and face identity subspace. Since the Gabor feature vectors obtained by projection into the face identity subspace are separated from illumination, the face recognition utilizing them becomes more robust to illumination. Through experiments, it is shown that the proposed face recognition based on Gabor feature vector illumination PCA model performs more reliably under various illumination and Pose environments.

• The Journal of the Acoustical Society of Korea
• /
• v.10 no.4
• /
• pp.27-37
• /
• 1991

This paper proposes the ESFVQ(energy subspace fuzzy vector quantization) that employs energy subspaces to reduce the quantizing distortion which is less than that of a fuzzy vector quatization. The ESFVQ is applied to a speaker adaptation method by which Korean words spoken by unknown speakers are recognized. By generating mapped codebooks with fuzzy histogram according to each energy subspace in the training procedure and by decoding a spoken word through the ESFVQ in the recognition proecedure, we attempt to improve the recognition rate. The performance of the ESFVQ is evaluated by measuring the quantizing distortion and the speaker adaptive recognition rate for DDD telephone area names uttered by 2 males and 1 female. The quatizing distortion of the ESFVQ is reduced by 22% than that of a vector quantization and by 5% than that of a fuzzy vector quantization, and the speaker adaptive recognition rate of the ESFVQ is increased by 26% than that without a speaker adaptation and by 11% than that of a vector quantization.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.3
• /
• pp.372-375
• /
• 2014

A monopulse based on maximum likelihood(ML) in jamming scenario can suppress jamming signal using an inverse matrix of a covariance matrix. In order to achieve adequate suppression of jamming signal, the sufficient number of snapshots is required. However, this is not possible in high PRF scenario, which hinders a real-time tracking. Moreover, even with the large number of snapshots, the estimation accuracy of the target direction is decreased in low JNR(Jammer to Noise Ratio) due to insufficient jammer suppression. In this paper, we propose a monopulse algorithm that doesn't degrade performance significantly with a small number of snapshots and in low JNR. We show its derivation that exploits noise-jammer subspace of a covariance matrix, along with its performance through simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.6
• /
• pp.500-505
• /
• 2000

This paper deals with wafer temperature uniformity control essential in rapid thermal processing (RTP). One of the important control objectives of RTP is to keep the temperature over the wafer surface as uniformly as possible. For this, a discrete time state equation around the operating point is first identified by using the subspace fitting method, and a multivariable LQG(Linear Quadratic Gaussian) controller is designed based on the identified model. Simulation and experimental results show improvement in temperature uniformity over the conventional PID method.