• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권2호
• /
• pp.95-100
• /
• 2010

This paper proposes a new spatial regularization of Fisher linear discriminant analysis (LDA) to reduce the overfitting due to small size sample (SSS) problem in face recognition. Many regularized LDAs have been proposed to alleviate the overfitting by regularizing an estimate of the within-class scatter matrix. Spatial regularization methods have been suggested that make the discriminant vectors spatially smooth, leading to mitigation of the overfitting. As a generalized version of the spatially regularized LDA, the proposed regularized LDA utilizes the non-uniformity of spatial correlation structures in face images in adding a spatial smoothness constraint into an LDA framework. The region-dependent spatial regularization is advantageous for capturing the non-flat spatial correlation structure within face image as well as obtaining a spatially smooth projection of LDA. Experimental results on public face databases such as ORL and CMU PIE show that the proposed regularized LDA performs well especially when the number of training images per individual is quite small, compared with other regularized LDAs.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제13권3호
• /
• pp.200-207
• /
• 2013

Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods-the matrix equation and the reachability tree. However, both methods are localized, i.e., it is difficult to find a general algorithm that can determine reachability for an arbitrary Petri Net, especially an unbounded Petri Net. This paper proposes and proves three propositions in order to present a subclass of a Petri Net, the live single-branch Petri Net, whose reachability is equivalent to the satisfiability of the state equation.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 1998년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.274-279
• /
• 1998

For the accurate generation of DEMs, the determination of match quality in adaptive least square matching algorithm is significantly important. Traditionally, only the degree of convergence of a solution matrix in least squares estimation has been considered for the determination of match quality. It is, however, not enough to determine the true match quality. This paper reports two approaches of match quality determination based on adaptive least square correlation : the conventional if-then logic approaches with scene geometry and correlation as additional quality measures; and, the fuzzy logic approaches. Through these, accurate decision of match quality will minimize the number of blunder and maximize the number of exact match. The proposed methods have been tested on JERS and SPOT images and the results show good performance.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.290-293
• /
• 1996

This paper proposes a scheme of initial cluster center selection in FCM algorithm using the genetic algorithms. The FCM algorithm often fails in the search for global optimum because it is local search techniques that search for the optimum by using hill-climbing procedures. To solve this problem, we search for a hypersphere encircling each clusters whose parameters are estimated by the genetic algorithms. Then instead of a randomized initialization for fuzzy partition matrix in FCM algorithm, we initialize each cluster center by the center of a searched hypersphere. Our experimental results show that the proposed initializing scheme has higher probabilities of finding the global or near global optimal solutions than the traditional FCM algorithm.

• 전자공학회논문지S
• /
• 제36S권5호
• /
• pp.30-41
• /
• 1999

본 논문에서는 연속시간과 이산시간에서 파라미터 불확실성과 시간지연을 가지는 비선형시스템에 대한 퍼지 견실 H∞ 제어기 설계방법을 제시한다. 비선형시스템은 변형한 T-S(Takagi- Sugeno) 퍼지모델을 사용하여 나타내고, 퍼지제어는 PDC(parallel distributed compensation) 개념을 이용한다. 또한 Lyapunov 접근방법을 이용하여 불확실성, 외란과 시간지연을 가지는 변형한 T-S 퍼지모델의 H∞ 노옴 한계를 가지는 자승적 안정성을 언급하고, LMI(linear matrix inequality) 기법을 이용하여 퍼지 견실 H∞ 제어기의 존재 조건과 제어기 설계방법을 제시한다. 그러므로 제시한 기법은 구하여진 충분조건을 만족하는 해를 찾음과 동시에 제어기를 한번에 설계할 수 있다. 마지막으로 예제를 통하여 제시한 방법의 타당성을 확인한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제4권3호
• /
• pp.337-340
• /
• 2004

The clustering problem can be formulated as the problem to find the number of clusters and a partition matrix from a given data set using the iterative or non-iterative algorithms. The author proposes a nearest neighbor and validity-based clustering algorithm where each data point in the data set is linked with the nearest neighbor data point to form initial clusters and then a cluster in the initial clusters is linked with the nearest neighbor cluster to form a new cluster. The linking between clusters is continued until no more linking is possible. An optimal set of clusters is identified by using the conventional cluster validity index. Experimental results on well-known data sets are provided to show the effectiveness of the proposed clustering algorithm.

• 전기학회논문지
• /
• 제60권11호
• /
• pp.2119-2130
• /
• 2011

This paper proposes new delay-dependent robust stability criteria for neural networks with time-varying delays. By construction of a suitable Lyapunov-Krasovskii's (L-K) functional and use of Finsler's lemma, new stability criteria for the networks are established in terms of linear matrix inequalities (LMIs) which can be easily solved by various effective optimization algorithms. Two numerical examples are given to illustrate the effectiveness of the proposed methods.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.1205-1207
• /
• 1996

The computed-torque method (CTM) shows good trajectory tracking performance in controlling robot manipulator if there is no disturbance or modelling errors. But with the increase of a payload or the disturbance of a manipulator, the tracking errors become large. So there have been many researchs to reduce the tracking error. In this paper, we propose a new control algorithm based on the CTM that decreases a tracking error by generating new reference trajectory to the controller. In this algorithm we used a fuzzy system based on the rule bases. For the numerical simulation, we used a 2-link robot manipulator. To simulate the disturbance due to a modelling uncertainty, we added errors to each elements of the inertia matrix and the nonlinear terms and assumed a payload to the end-effector. In the simulations of several cases, our method showed better trajectory tracking performance compared with the CTM.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2008년도 추계학술대회 논문집
• /
• pp.224-226
• /
• 2008

본 논문에서는 매트릭스 컨버터로 구동되는 유도전동기의 속도제어 성능을 향상시키기 위한 적응제어 기법을 제안한다. 유도 전동기는 비선형적 마찰력 등으로 인한 비선형적 특성을 가진다. 이러한 비선형적 특성으로 인해 야기되는 왜곡을 보상하고 속도제어 성능을 개선하기 위해 슬라이딩 모드 제어 기법을 적용한다. 슬라이딩 모드에서 발생하는 채터링 현상과 모델링되지 않은 유도 전동기의 불확실성에 의한 제어 성능 저하를 개선하기 위해, 불확실성 추정을 위한 퍼지 기반 불확실성 추정기를 적용한다. 시뮬레이션을 통해 제안한 제어기법의 타당성을 검증한다.

• Annals of Fuzzy Mathematics and Informatics
• /
• 제16권3호
• /
• pp.337-361
• /
• 2018

We introduce and study some basic properties of rough $I_{\lambda}$-statistical convergent of weight g (A), where $g:{\mathbb{N}}^3{\rightarrow}[0,\;{\infty})$ is a function statisying $g(m,\;n,\;k){\rightarrow}{\infty}$ and $g(m,\;n,\;k){\not{\rightarrow}}0$ as $m,\;n,\;k{\rightarrow}{\infty}$ and A represent the RH-regular matrix and also prove the Korovkin approximation theorem by using the notion of weighted A-statistical convergence of weight g (A) limits of a triple sequence of Bernstein-Stancu polynomials.