• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.8
• /
• pp.902-913
• /
• 1992

There have been several control schemes for the single input systems with unmeasurable state variables using variable structure control(VSC) theory. In the previous VSC, the systems must be represented in phase canonical form and the complete measurements for each state variable must be assumed. In order to eliminate these restrictions several VSC methods were proposed. And especially for the systems in phase canonical form with unmeasurable state variables, the reduced order switching function algorithm was proposed. But this method has many drawbacks and can not be used in the case of general form (not phase canonical form) dynamic system. Therefore this paper propose new construction method of switching fuction for the systems in phase canonical form, which reduce the restriction of reduced order switching function algorithm. And this algorithm can be realized for any state representation and adopted in the systems where not all states are available for switching function synthesis or control.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1648-1649
• /
• 2007

This paper proposes a very novel method which makes it possible that state feedback controller can be designed for unknown dynamic system with measurable states. The RLS algorithm is used for the identification of input-output relationship. A virtual state space representation is derived from the relationship and the SVM(Support Vector Machines) makes the relationship between actual states and virtual states. A state feedback controller can be designed based on the virtual system and the SVM makes the controller be with actual states. The results of this paper can give many opportunities that the state feedback control can be applied for unknown dynamic systems

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.303-310
• /
• 1996

The Gottlieb group of a compact connected ANR X, G(X), consists of all $\alpha \in \prod_{1}(X)$ such that there is an associated map $A : S^1 \times X \to X$ and a homotopy commutative diagram $$ S^1 \times X \longrightarrow^A X $$ $$incl \uparrow \nearrow \alpha \vee id $$ $$ S^1 \vee X $$.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.368-376
• /
• 2007

How to represent the search space is as important as which search algorithm to use for finding natural-looking paths for moving NPC (non-player character) in computer games. Recently, various state space representation methods which have been developed for computer games are being used while A* algorithm dominates as the preferred search algorithm. These representation methods show some drawbacks such as the size of state space is too large, there is no guarantee for optimality, the path found is not natural-looking, and the generation of nodes and links is not automatic by depending on a level designer. In this paper the requirements for natural-looking paths are introduced and to find paths satisfying these requirements, the use of the generalized visibility graphs which is the extended version of the visibility graph in Robotics is proposed.

• Journal of Power Electronics
• /
• v.4 no.3
• /
• pp.188-196
• /
• 2004

The dielectric barrier discharge is recognized as one of the efficient methods of ultraviolet light generation and ozone production. As well, it is widely utilized for gaseous wastes neutralization and other technological processes in industry. This electrochemical reaction is electrically equivalent to a nonlinear capacitive load that represents some difficulties for designing the power supply. Therefore, a conventional power supply is designed for a drastically simplified model of the load and generally is not optimal. This paper presents a fast simulation approach for the nonlinear capacitive model representation of the dielectric barrier discharge load lamp. The main idea of the proposed method is to use analytical solutions of the differential state equations for the load and find the unknown initial conditions for the steady state by an optimization method. The derived expressions for the analytical solutions are rather complicated, however they greatly reduce the calculation time, which make sense when a deeper analysis is performed. This paper introduces the proposed simulation method and gives some examples of its application such as estimation of the load equivalent parameters and load matching conditions.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.155-160
• /
• 2004

In this paper, we describe the results of a study on the edge enhancement of X-ray images by using their fuzzy system representation. A set of gray scale X-ray images was generated using the EGS4 computer code. An aluminum plate or a lead plate with three parallel strips taken out has been used as the object with the thickness and the width of the plate, and the gap between the two strips varied. We started with a comparative study on a set of the fuzzy sets for their applicability as the input fuzzy sets for the fuzzy system representation of the gray scale images. Then we describe how the fuzzy system is used to sharpen the edges. Our algorithm is based on adding the magnitude of the gradient not to the pixel value of concern but rather to the nearest neighboring pixel in the direction of the gradient. We show that this algorithm is better in maintaining the spatial resolution of the original image after the edge enhancement.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.11b
• /
• pp.134-139
• /
• 2002

This paper presents a servo design method for high track-density hard disk drives, in which the plant time delay, mainly due to the processor computation time, is taken into account. The key idea behind the proposed design method is to incorporate the delay model into the output equation of the state-space representation for the plant model; thereby, the delay is accounted for by a standard state observer in a natural manner, with simplified state equations as compared to those for conventional methods. The results from practical application confirm that the proposed method is quite effective in realizing a high-bandwidth servo system in hard disk drives.

• Korean Journal of Optics and Photonics
• /
• v.5 no.1
• /
• pp.25-30
• /
• 1994

We derive a set of formuale which show one-to-one correspondence between the the unitary Jones matrices of transparent anisotropic media and the rotational transformations on the Poincare sphere. By using the formuale one can determine the vectorial representation of the rotational transformation on the Poincare sphere which specifies the direction of the axis and the angle of the rotation in terms of the three parameters specific to the corresponding unitary Jones matrix, and conversely the the three parameters of the uniatry Jones matrix in terms of the vectorial representation of the corresponding rotational transformation on the Poincare sphere. To understand the polarization transmission characteristics of an optical system consisting of transparent linear anisotropic media, start with the Jones calculus to get the unitary Jones matrix for the whole system and then convert it to a rotational transformation on the Poincare sphere, from which we can intuitively understand the effect of the optical system on the polarization state of the light passing through the system.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.343-359
• /
• 2020

In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2607-2627
• /
• 2017

Nonnegative matrix factorization (NMF) has received considerable attention due to its effectiveness of reducing high dimensional data and importance of producing a parts-based image representation. Most of existing NMF variants attempt to address the assertion that the observed data distribute on a nonlinear low-dimensional manifold. However, recent research results showed that not only the observed data but also the features lie on the low-dimensional manifolds. In addition, a few hard priori label information is available and thus helps to uncover the intrinsic geometrical and discriminative structures of the data space. Motivated by the two aspects above mentioned, we propose a novel algorithm to enhance the effectiveness of image representation, called Dual graph-regularized Constrained Nonnegative Matrix Factorization (DCNMF). The underlying philosophy of the proposed method is that it not only considers the geometric structures of the data manifold and the feature manifold simultaneously, but also mines valuable information from a few known labeled examples. These schemes will improve the performance of image representation and thus enhance the effectiveness of image classification. Extensive experiments on common benchmarks demonstrated that DCNMF has its superiority in image classification compared with state-of-the-art methods.