• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.673-683
• /
• 2009

We point out: to make Hermtian matrices A and B satisfy Styan matrix inequality, the condition "positive definite property" demanded in the present literatures is not necessary. Furthermore, on the premise of abandoning positive definite property, we derive Styan matrix inequality of Hadamard product for inverse Hermitian matrices and the sufficient and necessary conditions that the equation holds in our paper.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.365-380
• /
• 2012

Non-negative matrix factorization (NMF) is a very efficient method to explain the relationship between functions for finding basis information of multivariate nonnegative data. The multiplicative update (MU) algorithm is a popular approach to solve the NMF problem, but it fails to approach a stationary point and has inner iteration and zero divisor. So the elementwisely alternating projected gradient (eAPG) algorithm was proposed to overcome the defects. In this paper, we use the fact that the equilibrium point is stable to prove the convergence of the eAPG algorithm. By using a classic model, the equilibrium point is obtained and the invariant sets are constructed to guarantee the integrity of the stability. Finally, the convergence conditions of the eAPG algorithm are obtained, which can accelerate the convergence. In addition, the conditions, which satisfy that the non-zero equilibrium point exists and is stable, can cause that the algorithm converges to different values. Both of them are confirmed in the experiments. And we give the mathematical proof that the eAPG algorithm can reach the appointed precision at the least iterations compared to the MU algorithm. Thus, we theoretically illustrate the advantages of the eAPG algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.12
• /
• pp.723-731
• /
• 2005

The $4{\times}4$ homogeneous transformation matrix is a compact representation of orientation and position of an object in robotics and computer graphics. A coordinate transformation is accomplished through the successive multiplications of homogeneous matrices, each of which represents the orientation and position of each corresponding link. Thus, for real time control applications in robotics or animation in computer graphics, the fast multiplication of homogeneous matrices is quite demanding. In this paper, a parallel-architecture vector processor is designed for this purpose. The processor has several key features. For the accuracy of computation for real application, the operands of the processors are floating point numbers based on the IEEE Standard 754. For the parallelism and reduction of hardware redundancy, the processor takes column vectors of homogeneous matrices as multiplication unit. To further improve the throughput, the processor structure and its control is based on a pipe-lined structure. Since the designed processor can be used as a special purpose coprocessor in robotics and computer graphics, additionally to special matrix/matrix or matrix/vector multiplication, several other useful instructions for various transformation algorithms are included for wide application of the new design. The suggested instruction set will serve as standard in future processor design for Robotics and Computer Graphics. The design is verified using FPGA implementation. Also a comparative performance improvement of the proposed design is studied compared to a uni-processor approach for possibilities of its real time application.

• Journal of Forest and Environmental Science
• /
• v.33 no.4
• /
• pp.295-304
• /
• 2017

This study compared and analyzed the construction of a land use change matrix for the Intergovernmental Panel on Climate Change's (IPCC) land use, land use change, and forestry area (LULUCF). We used National Forest Inventory (NFI) permanent sample plots (with a sample intensity of 4 km) and permanent sample plots with 500 m sampling intensity. The land use change matrix was formed using the point sampling method, Level-2 Land Cover Maps, and forest aerial photographs (3rd and 4th series). The land use change matrix using the land cover map indicated that the annual change in area was the highest for forests and cropland; the cropland area decreased over time. We evaluated the uncertainty of the land use change matrix. Our results indicated that the forest land use, which had the most sampling, had the lowest uncertainty, while the grassland and wetlands had the highest uncertainty and the least sampling. The uncertainty was higher for the 4 km sampling intensity than for the 500 m sampling intensity, which indicates the importance of selecting the appropriate sample size when constructing a national land use change matrix.

• Korean Institute of Interior Design Journal
• /
• no.38
• /
• pp.75-82
• /
• 2003

The symmetry is general geometric design principal in contemporary architecture shape. But, Symmetry sometimes easily causes unreasonable design. In some reason, two of symmetric units in the apartment, one side of unit have very reasonable plan and arrangement but opposite side unit nay not. For example, if the kitchen on right unit had right-handed arrangement, the symmetrical other would have left-handed kitchen arrangement. In addition to this, if each house unit has the same plan but different direction, each unit has different usage or affects the residents' life pattern. Nevertheless, Architects use only one unit plan to design public housing development by using symmetric operator (mirror, proper rotation, inversion center) at their option. This study suggests that using group theory and mathematical matrix rather than designer's discretion can solve this symmetry problem clearly. And, this study analysis the merits and demerits between each symmetrical pair of unit plan shapes by using mathematical point group theory and matrix.

• Journal of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1529-1540
• /
• 2018

The matrix equation $X^p+A^*XA=Q$ has been studied to find the positive definite solution in several researches. In this paper, we consider fixed-point iteration and Newton's method for finding the matrix p-th root. From these two considerations, we will use the Newton-Schulz algorithm (N.S.A). We will show the residual relation and the local convergence of the fixed-point iteration. The local convergence guarantees the convergence of N.S.A. We also show numerical experiments and easily check that the N.S. algorithm reduce the CPU-time significantly.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.133-136
• /
• 2004

We are going to procedure various view from two frontal image using trifocal tensor. We found that warping is effective to produce synthesized poses of a face with the small number of mesh point of a given image in previous research[1]. For this research, fundamental matrix is important to calculate trifocal tensor. So, in this paper, we investigate two existing algorithms: Hartley's[2] and Kanatani's[3]. As an experimental result, Kenichi Kantani's algorithm has better performance of fundamental matrix than Harley's algorithm. Then we use the fundamental matrix of Kenichi Kantani's algorithm to calculate trifocal tensor. From trifocal tensor we calculate new trifocal tensor with rotation input and translation input and we use warping to produce new virtual views.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.844-848
• /
• 2005

A method to predict the strain responses from the measurements of displacement responses is considered. The method uses a transformation matrix which is composed of a displacement modal matrix and a strain modal matrix. The method can predict strains at points where displacements are not measured as well as at displacement measuring points. One of the drawbacks of the strain prediction method is that the displacement responses must be measured at many points on a structure simultaneously. This difficulty can be overcome by measuring the FRFs between displacements at a reference point and other point in sequence with a two channel measuring equipment This procedure is based on the assumption that the characteristics of excitation applied to the structure do not vary with time.

• Restorative Dentistry and Endodontics
• /
• v.16 no.2
• /
• pp.197-212
• /
• 1991

The purpose of this study was to roughness on the polished surface of visible light composite resins and was to observe the polished surfaces under Scanning Electrom Microscope(ISI DS 130 AKASHI Co. JAPAN). The surface roughness tester(Surfcom 700A Seimtsu profilometer Tokyo, Japan) was used to measure roughness of polished surfaces. In this study, 5 brands of visible of composite resins were examined, Pyrofile light bond Anterior Lite fil anterior Photo clearfil anterior & posterior Palfique light Anterior and posterior Silux Anterior. White point, Silicure point, Super snap Sof-Lex medium disk as cutting instrument, and celluloid matrix were used. The results obtained were as follows. 1. The Celluloid matrix produced the smoothest surfaces. 2. The surfaces made by Soflex medium disk was smoother than the surfaces made by any other polishing instruments. 3. The values of surface roughness made by White point, Silicon point and Super snap were similer. 4. Palfique light (AP) visible light composite resin showed the smoothest surface after polishing with Silicone point, Super snap disk and Soflex mediuem disk in all tested materials.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1236-1248
• /
• 1991

A new fast algorithm for computing the discrete cosine transform(DCT) Is developed decomposing N-point DCT into an N /2-point DCT and two N /4 point transforms(transpose of an N /4-point DCT. TN/t'and)It has an important characteristic that in this method, the roundoff noise power for a fixed point arithmetic can be reduced significantly with respect to the wellknown fast algorithms of Lee and Chen. since most coefficients for multiplication are distributed at the nodes close to the output and far from the input in the signal flow graph In addition, it also shows three other versions of factorization of DCT matrix with the same number of operations but with the different distributions of multiplication coefficients.