• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.641-644
• /
• 2005

This paper introduces an Interactive Feature Extraction (!FE) approach for the registration of satellite imagery by matching extracted point and line features. !FE method contains both point extraction by cross-correlation matching of singular points and line extraction by Hough transform. The purpose of this study is to minimize user's intervention in feature extraction and easily apply the extracted features for image registration. Experiments with these imagery dataset proved the feasibility and the efficiency of the suggested method.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.765-777
• /
• 2016

In this paper, we prove the existence of nontopological solutions to the self-dual equations arising from the Chern-Simons gauged O(3) sigma models. The property of solutions depends on a parameter ${\tau}{\in}[-1,1]$ appearing in the nonlinear term. The case ${\tau}=1$ lies on the borderline for the existence of solutions in the previous results [4, 5, 7]. We prove the existence of solutions in this case when there are only vortex points. Moreover, if $-1{\leq}{\tau}$<1, we establish solutions which are perturbed from the solutions of singular Liouville equations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.1005-1010
• /
• 2012

We propose a novel approach to classify fingerprints using the extracted adaptive core block for improving classification performance of incomplete fingerprints in this paper. We compute representative directions from fingerprint images by the block unit and learn horizontal and vertical Markov models by deciding the center position of a fingerprint image based on the expert knowledge. The center block of a test image is the block has the highest probability after comparing the Markov model with $11{\times}11$ blocks. The proposed approach can effectively classify incomplete fingerprints using the optimal center block.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.229-234
• /
• 1992

This paper presents a compensator design method for multivariable feedback control systems with saturating actuators based on the concept of the equilibrium point. Am explicit expression for the compensation matrix of the general anti-reset windup(ARW) scheme is derived by minimizing the distances between the equilibrium points. The resulting dynamics of the compensated controller exhibits the reduced model form of the unsaturated system which can be obtained by the singular perturbational method. The proposed method is applicable to any open-loop stable plants with saturating actuators whose controllers are determined by some design technique. An example is given to show the effectiveness of the proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.12
• /
• pp.1026-1032
• /
• 2003

A biped walking robot which is developed as a platform for researching walking algorithm is briefly introduced. The developed walking robot has 6 degrees of freedom per one leg. The origins of the last three axis do not intersect at a point, so the kinematic analysis is cubmersome with the conventional method. In the former version of the robot, Jacobian-based inverse kinematics method is used. However, the Jacobian-based inverse kinematics method has drawbacks for the application in which knee is fully extended such as stair-case walking. The reason far that is the Jacobian becomes ill-conditioned near the singular points and the method is not able to give adequate solutions. So, a method for giving a closed-form inverse kinematics solution is proposed. The proposed method is based on careful consideration of the kinematic structure of the biped walking robot.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2000-2003
• /
• 2003

This paper presents a three-dimensional (3D) head pose estimation algorithm for robust face recognition. Given a 3D input image, we automatically extract several important 3D facial feature points based on the facial geometry. To estimate 3D head pose accurately, we propose an Error Compensated-SVD (EC-SVD) algorithm. We estimate the initial 3D head pose of an input image using Singular Value Decomposition (SVD) method, and then perform a Pose refinement procedure in the normalized face space to compensate for the error for each axis. Experimental results show that the proposed method is capable of estimating pose accurately, therefore suitable for 3D face recognition.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1221-1241
• /
• 2008

Most of domains people have studied are convex bounded projective (or affine) domains. Edith $Soci{\acute{e}}$-$M{\acute{e}}thou$ [15] characterized ellipsoid in ${\mathbb{R}}^n$ by studying projective automorphism of convex body. In this paper, we showed convex and bounded projective domains can be identified from local data of their boundary points using scaling technique developed by several mathematicians. It can be found that how the scaling technique combined with properties of projective transformations is used to do that for a projective domain given local data around singular boundary point. Furthermore, we identify even unbounded or non-convex projective domains from its local data about a boundary point.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.4
• /
• pp.775-782
• /
• 2006

We generated blocks from the direction-extracted fingerprint during the pre-process of the fingerprint recognition algorithm and performed training by using the direction minutiae of each block as the input pattern of the neural network, so that we extracted the core points to use in the matching. Based on this, we designed the fingerprint recognition embedded system and tested it using the control board and the serial communication to utilize it for a variety of application systems. As a result, we can verify the reliance satisfactorily.

• Journal of the Korean Statistical Society
• /
• v.4 no.1
• /
• pp.67-78
• /
• 1975

Over twenty-five years ago, Professor Klein and Rubin presented the linear expenditure system. That system was first estimated by Stone. Subsequently many investigators have estimated that system. In this paper, many points of the error structure shown by Pollak and Wales are referred to. Barten presented an estimation theorem on a singular covariance matrix. In order to estimate parameters, we place an emphasis on the maximum likihood method which we believe to be most appropriate. As we have one linear restriction on parameters to be estimated, we maximized the associated likelihood function subject to that linear restriction through the well-known lagrange multiplier method. This paper is organized in the following fashion : (1) a brief description on classical consumer theory, (2) a linear expenditure system and its constraint, (3) dyanmic specification and stochastic specification, (4) estimation method, and (5) conclusion.