• 대한전기학회논문지:전력기술부문A
• /
• 제48권10호
• /
• pp.1264-1271
• /
• 1999

In this paper, an efficient method of analysis and design of fault detection filter is presented. Since the directional constraint is applied to the eigenstructure associated with the detection space, an eigenvector is determined by the eigenvalues associated with other eigenvectors. Further, the assignment of a pair of eigenvalue and eigenvector leads to the fixation of overall eigenstructure related with the detection space. Using the transmission zeros and the transmission zero vectors, these phenomenon are clearly proven, and an efficient algorithm for design of the fault detection filters is presented.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1173-1176
• /
• 1999

전력계통에서 발생하는 저주파 동요에 대해서 가장 효과적인 제동력 향상방안으로 알려진 PSS의 최적 설치지점을 결정하기 위하여 NSE(Normalizing Speed Eigenvectors), SPF(Speed Participation Factors), TFR(Transfer Function Residues) 및 주파수 응답법을 각각 비교분석 하였다. 분석결과 SPF는 제어/입력 행렬을 포함하지 않는 상태행렬만을 고려하기 때문에 PSS의 제어특성을 반영하지 못하는 단점이 있었으며 TFR은 여자기 이득에 민감하여 최적위치 선정에 있어서 문제점을 보였다. 본 연구에서는 SPF법을 이용하여 PSS 설치 후보지를 선정하고 이들 후보지에 대해서 TFR법과 주파수 응답법으로 최적의 발전기를 결정하도록 하였으며 PSS를 설치하여 그 효과를 검증하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.68.3-68
• /
• 2001

We describe the looper controller design for a hot strip mill. The looper is to control the strip tension which influences on the width of the strip. It is very important to control the looper control of the hot strip mill, but difficult to control the looper, because there exists mutual interaction among strip gauge, looper angle, and strip tension. In this paper, we present the modeling for the looper of a hot strip mill to control the tension of the strip and suggest a eigenstructure assignment method. The eigenstructure assignment is useful tool that allows the designer to satisfy damping, settling time, and mode decoupling specifications directly by choosing eigenvalue and eigenvectors. Desired eigenvalue and eigenvector are chosen to satisfy the desired responses.

• 제어로봇시스템학회논문지
• /
• 제6권10호
• /
• pp.854-870
• /
• 2000

This survey paper presents and overview on eigenstructure assignment (EA) control design methodologies. EA is an excellent control design method which may be used to assign the entire eigenstructure(eigenvalues, and right or left eigenvectors) of a closed-loop linear system via a full state or an output feedback control law. In general, EA is well-sutied for incorporating classical specifications on damping, settling time, and mode or disturbance decoupling into a modern multivariable control framework. The purpose of this paper is to provide an extensive survey on EA control design methods that might serve as an introduction to a study on EA. The fundamental concepts and formulations for understanding EA problems are extensively described. The recently reported results on EA are also presented.

• 전자공학회논문지C
• /
• 제34C권10호
• /
• pp.43-50
• /
• 1997

In this paper, we present a method that can recognize face images by use of a sparse population code that is a learning model about a receptive fields of the simple cells in the primary visual cortex. Twenty front-view facial images form twenty persons were used for the training process, and 200 varied facial images, 20 per person, were used for test. The correct recognition rate was 100% for only the front-view test facial images, which include the images either with spectacles or of various expressions, while it was 90% in average for the total input images that include rotated faces. We analyzed the effect of nonlinear functon that determine the sparseness, and compared recognition rate using the sparese population code with that using eigenvectors (eigenfaces), which is compact code that makes contrast with the sparse population code.

• ETRI Journal
• /
• 제39권1호
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.

• 제어로봇시스템학회논문지
• /
• 제1권2호
• /
• pp.105-111
• /
• 1995

This paper proposes a segmentation algorithm using gray-level discontinuity and surface reflectance ratio of input images obtained under different illumination conditions. Each image is divided by a certain number of subregions based on the thresholds. The thresholds are determined using the histogram of fusion image which is obtained by ANDing the multiple input images. The subregions of images are projected on the eigenspace where their bases are the major eigenvectors of image matrix. Points in the eigenspace are classified into two clusters. Images associated with the bigger cluster are fused by revised ANDing to form a combined edge image. Missing edges are detected using surface reflectance ration and chain code. The proposed algorithm obtains more accurate edge information and allows to more efficiently recognize the environment under various illumination conditions.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 춘계학술대회 논문집
• /
• pp.699-702
• /
• 2000

In order to use a parallel device fur machine tool feed mechanism, it is very important to analyze its stiffness over the workspace. Generally, the stiffness of a rod varies with its length. In this paper, the stiffness of the leg is modeled as a linear function. With the linear stiffness model, the methods that can determine stiffness bounds and max/min stiffness directions are presented utilizing eigenvalues and eigenvectors of the stiffness matrix. The stiffness variation along a tool-path and stiffness mapping over a workspace are presented with cubic-shaped parallel device which is originally designed for machine tool feed mechanism.

• 전기학회논문지
• /
• 제58권12호
• /
• pp.2511-2519
• /
• 2009

In this paper, we introduce the methodological system design via feature selection using Principal Component Analysis and Particle Swarm Optimization algorithms. The overall methodological system design comes from three kinds of modules such as preprocessing module, feature extraction module, and recognition module. First, Histogram equalization enhance the quality of image by exploiting contrast effect based on the normalized function generated from histogram distribution values of 2D face image. Secondly, PCA extracts feature vectors to be used for face recognition by using eigenvalues and eigenvectors obtained from covariance matrix. Finally the feature selection for face recognition among the entire feature vectors is considered by means of the Particle Swarm Optimization. The optimized Polynomial-based Radial Basis Function Neural Networks are used to evaluate the face recognition performance. This study shows that the proposed methodological system design is effective to the analysis of preferred face recognition.

• 대한수학회논문집
• /
• 제9권3호
• /
• pp.565-570
• /
• 1994

In this article we prove a version of the Perron-Frobenius Theorem in linear algebra using the Brouwer's Fixed Point Theorem in topology. We will mostly concentrate on he qualitative aspect of the Perron-Frobenius Theorem rather than quantitative formulas, which would be enough for theoretical investigations in ergodic theory. By the nature of the method of the proof, we do not expect to obtain a numerical estimate. But we may regard it worthwhile to see why a certain type of result should be true from a topological and geometrical viewpoint. However, a geometric argument alone would give us a sharp numerical bounds on the size of the eigenvalue as shown in Section 2. Eigenvectors of a matrix A will be fixed points of a certain mapping defined in terms of A. We shall modify an existing proof of Frobenius Theorem and that will do the trick for Perron-Frobenius Theorem.