• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.226-230
• /
• 2002

This paper proposes a method of improvement of accuracy of projective transformation matrix for Image Mosaicing. Using shift theorem, we extracted global translation components between images and using translation components, we found matching points between images so we solve general matching point problem we extracted highly trusted matching point using RANSAC algorithm. we normalized matching point coordinates and improved accuracy of projective transformation matrix.

• Journal of Power System Engineering
• /
• v.20 no.3
• /
• pp.64-73
• /
• 2016

In this research work, an algorithm development on tracking end-point of aerial work platform with jib profile and bend-linked boom was carried out to find the X, Y and Z direction value using coordinate transformation matrix. This matrix consists of device status value(length and angle) based on camera position axis, which are sent from device controller PLUS+1 by CAN protocol. These values are used to measure the distance and angle from the camera to the end-point. Using these distance and angle value, monitoring system controls FAN/TILT/ZOOM status of camera to get an adequate scene of workplace. This program was written in Java, C# and C for mobile device. These results provide the information to the aerial work device for secure operation.

• Nuclear Engineering and Technology
• /
• v.53 no.2
• /
• pp.414-422
• /
• 2021

The aim of this work considers a second order point reactor kinetics model based on the P1 approximation of transport theory, called in this work as P1 point reactor model. The P1 point reactor model implicitly considers the time derivative of the neutron source which has not been thus considered previously. The inverse method to calculate the reactivity in nuclear reactors -chosen because its high accuracy- Matrix Formulation. The numerical results shown that the Matrix Formulation for the reactivity estimation constitutes a method with insignificant calculation errors.

• Korean Management Science Review
• /
• v.14 no.2
• /
• pp.69-79
• /
• 1997

The computational speed of interior point method of linear programming depends on the speed of Cholesky factorization. If the coefficient matrix A has dense columns then the matrix A.THETA. $A^{T}$ becomes a dense matrix. This causes Cholesky factorization to be slow. We study an efficient implementation method of the dense column splitting among dense column resolving technique and analyze the relation between dense column splitting and order methods to improve the sparsity of Cholesky factoror.

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

This paper deals with the study of dichotomy and conditioning for two-point boundary value problems associated with first order matrix Lyapunov systems, with the help of Kronecker product of matrices. Further, we obtain close relationship between the stability bounds of the problem on one hand, and the growth behaviour of the fundamental matrix solution on the other hand.

• The Pure and Applied Mathematics
• /
• v.23 no.3
• /
• pp.287-307
• /
• 2016

Using the fixed point method, we prove the Hyers-Ulam stability of an additive-quadratic-cubic-quartic functional equation in matrix fuzzy normed spaces.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2011.06a
• /
• pp.107-108
• /
• 2011

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.289-292
• /
• 1996

In Cholesky factorization of the interior point method, dense columns of A matrix make dense Cholesky factor L regardless of sparsity of A matrix. We introduce a method to transform a primal problem to a dual problem in order to preserve the sparsity.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.208-211
• /
• 2004

Landmark matching is one of an important algorithm for navigation of satellite images. This paper proposes a fast landmark matching algorithm using a MGLI (Moving Guide-Line Image). For searching the matched point between the landmark chip and a part of image, correlation matrix is used generally, but the full-sized correlation matrix has a drawback requiring plenty of time for matching point calculation. MGLI includes thick lines for fast calculation of correlation matrix. In the MGLI, width of the thick lines should be determined by satellite position changes and navigation error range. For the fast landmark matching, the MGLI provides guided line for a landmark chip we want to match, so that the proposed method should reduce candidate areas for correlation matrix calculation. This paper will show how much time is reduced in the proposed fast landmark matching algorithm compared to general ones.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.211-215
• /
• 1989

The structure of A matrix of one machine connected to the infinite bus is described for a full model. The A matrix can be partitioned to submatrices which depend on the initial operating point and do not depend on it. When the dynamic properties for several different operating points are desired, those submatrices can be obtained through simple column operations. Furthermore, the elements of A matrix car be directly calculated from the manufacturer's data. RMS quantities of the state variables for the initial operating point are used. This approach can save the labor for calculating the elements of A matrix for the dynamic stability analysis.