• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.444-448
• /
• 2003

In this paper, the Lagrange dynamics is studied. A state space representation of Lagrange dynamics and control algorithm based on the state feedback pole placement are presented. The state space model presented is descriptor type linear parameter dependent system. It is shown that the control algorithms based on the linear system theory can be applicable to the state space representation of Lagrange dynamics. To show that the linear system theory can be applicable to the state space representation of Lagrange dynamics, the LMI based regional pole-placement design algorithm is developed and present two examples.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.95-105
• /
• 2006

This paper proposes a novel approach to represent the image by using shape descriptor having an information of area. The proposed descriptor is a set of vectors, consists of radius, area and direction parameters in the concentrated center point. Due to the area parameter, we know our descriptor can obtain the information of area. Also, we give an extended shape descriptor to get more detailed representation. To do this, we move the center point of our vision to that point for region of interest. By doing so about all of region of interest, we can get our descriptor for detailed information of the image. From more detailed descriptor, it's natural that it's more efficient fur representation, retrievals and so on. We make it the normalized pattern and expand to improve its quality. The proposed method is invariant to scale, position and rotation. The results show that it can be used efficiently for image representation as we can see in retrievals of silhouette images.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.2
• /
• pp.182-188
• /
• 2004

This paper presents a design method of delay-dependent control for T-S fuzzy systems with time delays. Based on parallel distributed compensation (PDC) and a descriptor model transformation of the system, a delay-dependent control is utilized. An appropriate Lyapunov-Krasovskii functional is chosen for delay-dependent stability analysis. A sufficient condition for delay-dependent control is represented in terms of linear matrix inequalities (LMIs).

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.758-768
• /
• 2017

In this paper, we present a novel method to extract face representation based on multi-resolution spatial pyramid. In our method, a face is subdivided into increasingly finer sub-regions (local regions) and represented at multiple levels of histogram representations. To cope with misaligned problem, patch-based local descriptor extraction has been also developed in a novel way. To preserve multiple levels of detail in local characteristics and also encode holistic spatial configuration, histograms from all levels of spatial pyramid are integrated by using dimensionality reduction and feature combination, leading to our spatial-pyramid face feature representation. We incorporate our proposed face features into general face recognition pipeline and achieve state-of-the-art results on challenging face recognition problems.

• ETRI Journal
• /
• v.40 no.4
• /
• pp.499-510
• /
• 2018

A vector space based augmented structural kinematic (VSASK) feature descriptor is proposed for human activity recognition. An action descriptor is built by integrating the structural and kinematic properties of the actor using vector space based augmented matrix representation. Using the local or global information separately may not provide sufficient action characteristics. The proposed action descriptor combines both the local (pose) and global (position and velocity) features using augmented matrix schema and thereby increases the robustness of the descriptor. A multiclass support vector machine (SVM) is used to learn each action descriptor for the corresponding activity classification and understanding. The performance of the proposed descriptor is experimentally analyzed using the Weizmann and KTH datasets. The average recognition rate for the Weizmann and KTH datasets is 100% and 99.89%, respectively. The computational time for the proposed descriptor learning is 0.003 seconds, which is an improvement of approximately 1.4% over the existing methods.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1013-1020
• /
• 2005

This paper presents an effective and robust leaf image retrieval system based on shape feature. Specifically, we propose an improved MPP algorithm for more effective representation of leaf images and show a new dynamic matching algorithm that basically revises the Nearest Neighbor search to reduce the matching time. In particular, both leaf shape and leaf arrangement can be sketched in the query for better accuracy and efficiency. In the experiment, we compare our proposed method with other methods including Centroid Contour Distance(CCD), Fourier Descriptor, Curvature Scale Space Descriptor(CSSD), Moment Invariants, and MPP. Experimental results on one thousand leaf images show that our approach achieves a better performance than other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.305-323
• /
• 2010

This paper proposes an efficient and yet powerful local descriptor called phase-space partition based descriptor (PPD). This descriptor is designed for the mobile image matching and retrieval. PPD, which is inspired from SIFT, also encodes the salient aspects of the image gradient in the neighborhood around an interest point. However, without employing SIFT's smoothed gradient orientation histogram, we apply the region based gradient statistics in phase space to the construction of a feature representation, which allows to reduce much computation requirements. The feature matching experiments demonstrate that PPD achieves favorable performance close to that of SIFT and faster building and matching. We also present results showing that the use of PPD descriptors in a mobile image retrieval application results in a comparable performance to SIFT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4513-4532
• /
• 2014

Motivated by the Weber's Law, this paper proposes an efficient and robust shape descriptor based on the perceptual stimulus model, called Weber's Law Shape Descriptor (WLSD). It is based on the theory that human perception of a pattern depends not only on the change of stimulus intensity, but also on the original stimulus intensity. Invariant to scale and rotation is the intrinsic properties of WLSD. As a global shape descriptor, WLSD has far lower computation complexity while is as discriminative as state-of-art shape descriptors. Experimental results demonstrate the strong capability of the proposed method in handling shape retrieval.

• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.124-131
• /
• 2013

Extraction and representation of postures and/or gestures from human activities in videos have been a focus of research in this area of action recognition. With various applications cropping up from different fields, this paper seeks to improve the performance of these action recognition machines by proposing a shape-based silhouette-edge descriptor for the human body. Information entropy, a method to measure the randomness of a sequence of symbols, is used to aid the selection of vital key postures from video frames. Morphological operations are applied to extract and stack edges to uniquely represent different actions shape-wise. To classify an action from a new input video, a Hausdorff distance measure is applied between the gallery representations and the query images formed from the proposed procedure. The method is tested on known public databases for its validation. An effective method of human action annotation and description has been effectively achieved.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.2
• /
• pp.29-37
• /
• 2010

In this paper, we present a novel deformation method for alleviating the asymmetry of a scanned 3D face considering facial features. To handle detailed areas of the face, we developed a new local 3D shape descriptor based on facial features and surface curvatures. Our shape descriptor can improve the accuracy when deforming a 3D face toward a symmetric configuration, because it provides accurate point pairing with respect to the plane of symmetry. In addition, we use point-based representation over all stages of symmetrization, which makes it much easier to support discrete processes. Finally, we performed a statistical analysis to assess subjects' preference for the symmetrized faces by our approach.