• Journal of Korean Ophthalmic Optics Society
• /
• v.4 no.2
• /
• pp.51-55
• /
• 1999

The eye movement of the eyeball's center of a rotation can represent with the rotation matrix $R_x$, $R_y$, $R_z$ due to a coordinate axis rotation transformation of Cartesian coordinate, and describes of an abduction, an adduction, an elevation, a depression, an intorsion, an extorsion in principle rotation six forms of the eye. The eye movement from primary eye position to tertiary eye position could be composed with the rotation matrix combination, and by the primary rotation of six and the secondary rotation of eight, could be represented with the extrocular muscle of six. The position of the cornea vertex point or pupil point due to the eye movement can describe to transform the rotation matrix of the cartesian coordinate to spherical coordinate$(r,{\theta},{\phi})$.

• Journal of electromagnetic engineering and science
• /
• v.4 no.3
• /
• pp.102-106
• /
• 2004

A novel Genetic Algorithm(GA)-based method is suggested to transform a coupling matrix to another, without the procedure of Matrix Rotation. This can remove tedious work like pivoting and deciding rotation angles needed for each of the iterations. The error function for the GA is simply formed and used as part of error minimization for obtaining the solution. An 8th order dual-mode elliptic integral function response filter is taken as an example to validate the present method.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.409-417
• /
• 2003

There are two rotation matrix parameters in a model, pro-posed by Prentice in 1989, for pairs of rotations in 3 dimensional space. For the least squares estimates of the two parameters, an algorithm was also presented, but it turned out that the algorithm could fail to get the least squares estimates. This article provides another algorithm for the least squares estimates and its performance is demonstrated by simulation results.

• Structural Engineering and Mechanics
• /
• v.51 no.4
• /
• pp.601-625
• /
• 2014

Based on continuum mechanics and the principle of virtual displacements, incremental total Lagrangian formulation (T.L.) and incremental updated Lagrangian formulation (U.L.) were presented. Both T.L. and U.L. considered the large displacement stiffness matrix, which was modified to be symmetrical matrix. According to the incremental updated Lagrangian formulation, small strain, large displacement, finite rotation of three dimensional Timoshenko fiber beam element tangent stiffness matrix was developed. Considering large displacement and finite rotation, a new type of tangent stiffness matrix of the beam element was developed. According to the basic assumption of plane section, the displacement field of an arbitrary fiber was presented in terms of nodal displacement of centroid of cross-area. In addition, shear deformation effect was taken account. Furthermore, a nonlinear finite element method program has been developed and several examples were tested to demonstrate the accuracy and generality of the three dimensional beam element.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.6
• /
• pp.599-605
• /
• 2003

A dual-mode asymmetric canonical filter is widely used in an input demultiplexer for satellite transponder. This paper deals with a simple synthesis method fur an asymmetric canonical filter. The coupling matrix of an asymmetric canonical filter is obtained by applying plane rotation technique to the coupling matrix of a symmetric canonical filter. This paper gives a list of pivots and rotation angles to obtain the coupling matrix of asymmetric canonical structure filters. The coupling matrix of 8th and 10th order asymmetric canonical filter is obtained by this proposed method. It is shown that the frequency response of asymmetric canonical filter is identical to that of symmetric canonical filter.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.120-131
• /
• 2020

In order to solve the problem of point clouds coordinate conversion of non-directional scanners, this paper proposes a basic Rodrigues rotation method. Specifically, we convert the 6 degree-of-freedom (6-DOF) rotation and translation matrix into the uniaxial rotation matrix, and establish the equation of objective vector conversion based on the basic Rodrigues rotation scheme. We demonstrate the applicability of the new method by using a bar-shaped emboss point clouds as experimental input, the three-axis error and three-term error as validate indicators. The results suggest that the new method does not need linearization and is suitable for optional rotation angle. Meanwhile, the new method achieves the seamless splicing of point clouds. Furthermore, the coordinate conversion scheme proposed in this paper performs superiority by comparing with the iterative closest point (ICP) conversion method. Therefore, the basic Rodrigues rotation method is not only regarded as a suitable tool to achieve the conversion of point clouds, but also provides certain reference and guidance for similar projects.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.7
• /
• pp.166-175
• /
• 1989

In this paper, we present a method which is based on the concept of the rotation of subspaces. This method is highly related to the angle (or distance) between subspaces arising in many applications. An effective procedures is first derived for finding the optimal transformation matrix which rotates one subspace into another as closely as possible in the least squares sense , and then this algorithm is applied to the solution to general direction-of-arrival estimation problem of multiple broadband plane waves which may be a mixture of incoherent, partially coherent or coherent. In this typical application, the rotation of signal subspaces (ROSS) algorithm is effectively developed to achieve the high performance in the active systems for the case in which the noise field remains invariant with the measurement of the array spectral density matrix (or data matrix). It is not uncommon to observe this situation in sonar systems. The advantage of this techniques is not to require the preliminary processing and spatial prefiltering which is used in Wang-Kaveh's CSS focusing method. Furthermore, the array's geometry is not restricted. Simulation results are presented to illustrate the high performance achieved with this new approach relative to that obtained with Wang-Kaveh's CSS focusing method for incoherent sources and forward-backward spatial smoothed MUSIC for coherent sources including the signal eigenvector method (SEM).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.1-6
• /
• 2016

Image rotation is one of main pre-processing step in image processing or image pattern recognition. It is implemented with rotation matrix multiplication. However it requires lots of floating point arithmetic operations and trigonometric function calculations, so it takes long execution time. We propose a new high speed image rotation algorithm without two major time-consuming operations. It use just 2 shear translation operations, so it is very fast. In addition, we apply a parallel computing technique with CUDA. CUDA is a massively parallel computing architecture using prevailed GPU recently. As GPU is a dedicated graphic processor, it is exellent for parallel processing of pixels. We compare the proposed algorithm with the conventional rotation one with various size images. Experimental results show that the proposed algorithm is superior to the conventional rotation ones.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.1
• /
• pp.6-14
• /
• 2011

This paper presents a high-speed QR decomposition architecture for the multi-input-multi-output (MIMO) receiver based on Givens rotation. Under fast-varying channel, since the inverse matrix calculation has to be performed frequently in MIMO receiver, a high performance and low latency QR decomposition module is highly required. The proposed QR decomposition architecture is composed of Sign-Select Lookahead (SSL) coordinate rotation digital computer (CORDIC). In the SSL-CORDIC, the sign bits, which are computed ahead to select which direction to rotate, are used to select one of the last iteration results, therefore, the data dependencies on the previous iterations are efficiently removed. Our proposed QR decomposition module is implemented using TSMC 0.25 ${\mu}M$ CMOS process. Experimental results show that the proposed QR architecture achieves 34.83% speed-up over the Compact CORDIC based architecture for the 4 ${\times}$ 4 matrix decomposition.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.390-396
• /
• 1995

One of the advantages of computer graphics is that it enables to view an object on different viewpoints and different angles. Therefore, a computer graphics system should be able to rotate an arbitrary object by an arbitrary angle about an arbitrary axis. This is usually done by rotating vertices that represent an object and connecting them. Hence an image may have many vertices, it is important to be able to rotate each of them quickly. Therefore, this paper is interested in a rotation matrix computation method that consists of the smallest number of computational steps. This pater proposes an algorithm that computes rotation matrix to rotate a 3 dimensional image about an arbitrary axis quickly.