• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1233-1245
• /
• 2008

In this paper, an iterative method is proposed to solve the least-squares problem of matrix equation AXB+CYD=E over unknown matrix pair [X, Y]. By this iterative method, for any initial matrix pair [$X_1,\;Y_1$], a solution pair or the least-norm least-squares solution pair of which can be obtained within finite iterative steps in the absence of roundoff errors. In addition, we also consider the optimal approximation problem for the given matrix pair [$X_0,\;Y_0$] in Frobenius norm. Given numerical examples show that the algorithm is efficient.

• Journal of Advanced Marine Engineering and Technology
• /
• v.35 no.2
• /
• pp.271-277
• /
• 2011

An identification method of the structural damping matrix for a steel bar by the genetic algorithm is proposed. Supposing the damping matrix were in proportion to the stiffness matrix, the proportional factors can be identified from the curve fitting of the experimental frequency response function(FRF) by the genetic algorithm. Applying the identified damping matrix to FEM of a beam model, the values of the objective function could be reduced to about 1/60 in comparison with conventional FEM model without damping. The damping matrices of some sub-structures which have large damping partly could be identified by the algorithm, and they could be used as some parts of the FEM model for a whole structure.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.149-155
• /
• 2018

In this paper we propose an algorithm for generating role-performer bipartite matrix for analyzing BPM-based human resource affiliations. Firstly, the proposed algorithm conducts the extraction of role-performer affiliation relationships from ICN(Infromation Contorl Net) based business process models. Then, the role-performer bipartite matrix is constructed in the final step of the algorithm. Conclusively, the bipartite matrix generated through the proposed algorithm ought to be used as the fundamental data structure for discovering the role-performer affiliation networking knowledge, and by using a variety of social network analysis techniques it enables us to acquire valuable analysis results about BPM-based human resource affiliations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.40-48
• /
• 2002

Three-Dimensional scene reconstruction from images acquired with different viewpoints is possible as estimating Fundamental matrix(F-matrix) that indicates the epipolar geometry of two images. Correspondence points required to calculate F-matrix of two images include noise such as miss matches, so generally it is hard to calculate F-matrix accurately. In this paper, we classify noise into two types; outlier and minute noise. we propose SSOR algorithm that estimate F-matrix effectively. SSOR algorithm is rejecting outlier step by step in a noise environment. To evaluate the performance of proposed algorithm we simulated with synthetic images and real images. As a result of simulation we show that proposed algorithm is better than conventional algorithms.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.12
• /
• pp.184-197
• /
• 1995

In this paper, high speed IC package-to-package interconnections are modeled as lossless multiconductor transmission lines operating in the TEM mode. And, three mathematical algorithms for computing electrical parameters of the lossless multiconductor transmission lines are described. A semi-analytic Green's function method is used in computing per unit length capacitance and inductance matrices, a matrix square root algorithm based on the QR algorithm is used in computing a characteristic impedance matrix, and a matrix algorithm based on the theory of M-matrix is used in computing a diagonally matched load impedance matrix. These algorithms are implemented in a computer program DIME (DIagonally Matched Load Impedance Extractor) which computes electrical parameters of the lossless multiconductor transmission lines. Also, to illustrate the concept of design database for high speed IC package-to-package interconnection, a database for the multi conductor strip transmission lines system is constructed. This database is constructed with a sufficiently small number of nodes using the multi-dimensional cubic spline interpolation algorithm. The maximum interpolation error for diagonally matched load impedance matrix extraction from the database is 1.3 %.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.35-44
• /
• 2004

We Propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization (CMF). Circulant matrix factorization is also very powerful tool used for spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. Schur algorithm is the method for a fast Cholesky factorization of Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR filter and for the case of the In filter are included, and performance of our method check by comparing of our method and another methods (polynomial root finding and cepstral deconvolution).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5073-5086
• /
• 2015

The rock fracture detection by image analysis is significant for fracture measurement and assessment engineering. The paper proposes a novel image segmentation algorithm for the centerline tracing of a rock fracture based on Hessian Matrix at Multi-scales and Steger algorithm. A traditional fracture detection method, which does edge detection first, then makes image binarization, and finally performs noise removal and fracture gap linking, is difficult for images of rough rock surfaces. To overcome the problem, the new algorithm extracts the centerlines directly from a gray level image. It includes three steps: (1) Hessian Matrix and Frangi filter are adopted to enhance the curvilinear structures, then after image binarization, the spurious-fractures and noise are removed by synthesizing the area, circularity and rectangularity; (2) On the binary image, Steger algorithm is used to detect fracture centerline points, then the centerline points or segments are linked according to the gap distance and the angle differences; and (3) Based on the above centerline detection roughly, the centerline points are searched in the original image in a local window along the direction perpendicular to the normal of the centerline, then these points are linked. A number of rock fracture images have been tested, and the testing results show that compared to other traditional algorithms, the proposed algorithm can extract rock fracture centerlines accurately.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.252-254
• /
• 2007

In this paper, we will introduce an encoding algorithm of LDPC Codes in Direct-Sequence UWB systems. We evaluate the performance of the coded systems in an AWGN channel. This new algorithm is based on the Jacket matrics. Mathematically let A = ($a_{kl}$) be a matnx, if $A^{-1}$ = $(a^{-1}_{kl})^r$,then the matrix A is a Jacket matrix. If the Jacket matrices if Low density, the inverse matrices is also Low density which is very important to the introduced encoding algorithm.

• Kyungpook Mathematical Journal
• /
• v.53 no.3
• /
• pp.479-495
• /
• 2013

Taking the weighted geometric mean [11] on the cone of positive definite matrix, we propose an iterative mean algorithm involving weighted arithmetic and geometric means of $n$-positive definite matrices which is a weighted version of Carlson mean presented by Lee and Lim [13]. We show that each sequence of the weigthed Carlson iterative mean algorithm has a common limit and the common limit of satisfies weighted multidimensional versions of all properties like permutation symmetry, concavity, monotonicity, homogeneity, congruence invariancy, duality, mean inequalities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.187-195
• /
• 1996

The purpose of this paper is to provide an algorithm in which the procedure of constructing a superstate transition matrix for trellis codes is reduced and, as a result, make it easier to evaluate the performance of a TCM scheme when the generalized transfer function method is used. In this paper, an algorithm for constructing a superstate transition matrix and an algorithm for reducing the matrix easily are addressed and applied to an MTCM scheme as an example. It is shown that the algorithm is very useflul for trellis codes with a large number of states and/or parallel transitions.