• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.93-101
• /
• 2010

In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.30-40
• /
• 2014

As the Hadamard transform can be generalized into the Jacket transform, in this paper, we generalize the Haar transform into the Jacket-Haar transform. The entries of the Jacket-Haar transform are 0 and ${\pm}2^k$. Compared with the original Haar transform, the basis of the Jacket-Haar transform is general and more suitable for signal processing. As an application, we present the DCT-II(discrete cosine transform-II) based on $2{\times}2$ Hadamard matrix and HWT(Haar Wavelete transform) based on $2{\times}2$ Haar matrix, analysis the performances of them and estimate them via the Lenna image simulation.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1178-1188
• /
• 2003

In this paper, we describe image mosaicing techniques for constructing a large high-resolution image with images taken by a video camera in hand. we propose the method which is automatically retrieving the exact matching area using color information and shape information. The proposed method extracts first candidate areas which have similar form using a Voronoi Distance Matching Method which is rapidly estimating the correspondent points between adjacent images, and calculating initial transformations of them and finds the final matching area using color information. It is a method that creates Voronoi Surface which set the distance value among feature points and other points on the basis of each feature point of a image, and extracts the correspondent points which minimize Voronoi Distance in matching area between an input image and a basic image using the binary search method. Using the Levenberg-Marquadt method we turn an initial transformation matrix to an optimal transformation matrix, and using this matrix combine a basic image with a input image.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.199-206
• /
• 2012

Attempt to use as a marker of natural objects directly in the real world, but there is a way to use the accelerometer of the smartphone, to convert the Frontal-View virtual, because it asks only the pitch of the camera, from the side there is a drawback that can not be converted to images. The proposed algorithm, to obtain the rotation matrix of axis 3 pitch, roll, yaw, we set the reference point of the yaw of the target image. Then, to compensate for the rotation matrix to determine Myon'inji any floor, wall, the ceiling of the target image. Finally, to obtain the homography matrix for obtaining the Frontal-View to account for the difference between the gyro sensor coordinate system and image coordinate system, so we can get the Frontal-View from the captured images through the projection transformation was designed. Was tested to convert Frontal-View the picture was taken in an environment smartphone environment surrounding floor, walls and ceiling in order to evaluate the conversion program Frontal-View has been implemented, in this paper, design and The conversion algorithm implementation, it was confirmed that to convert a regular basis Frontal-View footage taken from multiple angles.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.1
• /
• pp.10-18
• /
• 1998

불확실한 변수와 비선형성을 가지는 유연조인트 로봇의 견실제어 방안을 제시한다. 그리고 본 시스템에서 불확실구조는 일치성을 유지하지 않는 불일치성 불확실 시스템이다. 제어기는 리아노프의 방안에 근거를 두고있다. 견실제어는 연산토크법을 사용하고 삽입제어기법을 통하여 좌표변환을 통해 구성된다. 제어기 설계과정은 우선 연산토크방법에 의해 시스템 동역학에서 정격부분을 선형으로 2개의 부분시스템으로 구성한다. 이후 좌표변환을 이용하여 각 부분시스템에 제어기를 구축한다. 이 방안을 통하여 관성 행렬이 알려진 값인 경우 이 행렬의 상위한계 조건없이 제어기를 설계할 수 있다. 따라서 임의의 형태의 로봇에도 적용 가능한 제어알고리즘이 된다. 설계된 견실제어는 변환된 시스템이나 원시스템 모두 실용적 안정성을 보장한다. 이 변환은 단지 불확실변수의 최대 한계값의 정보만을 요구한다.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.20 no.6
• /
• pp.553-563
• /
• 2008

If an arbitrary topography is approximated to a number of vertical steps, both variational approximation and eigenfunction expansion method can be used to compute linear wave transformation over the bottom. In this study a scatterer method associated with variational approximation is proposed to calculate reflection and transmission coefficients. Present method may be shown to be more simple and direct than the successive-application-matrix method by O'Hare and Davies. And Several numerical examples are given which are in good agreement with existing results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.440-443
• /
• 2024

한의학의 증상을 파악하는 한의 변증 진단에서 혀의 형태와 색상을 파악하는 것에서 설질과 설태의 색상을 파악하는 것이 핵심이다. 혀 촬영 장치로 촬영하더라도 조명의 빛 종류와 빛 강도, 위치에 따라 컬러가 변환됨에 따라 혀 취득장치의 컬러교정이 필요하다. 컬러교정을 하지만, 오버피팅, 측정 오류와 노이즈 또는 색상 공간의 불균형으로 컬러의 왜곡이 발생할 수 있다. 이 연구에서는 24개의 patch 중에서 오류를 최소화할 수 있는 patch를 선정하는 최적화의 방법을 제시하려 하였다. 24개 patch 중 몇 개의 선택한 patch의 평균값을 구하여, 기준 값으로 변환시키는 변환 행렬을 구하고, 교정 값을 구하고, 교정된 24 patch 값의 평균과 기준 값과의 오차를 구하여 최소가 되는 변환 행렬을 구하였다. 이 방법은 컬러 챠트의 개수를 줄여 장치의 부피를 줄이는데 활용될 수 있다. 또한 이 방법은 외부의 빛이 차단된 촬영장치에서 활용되었지만, 조명조건이 안정된 개방된 공간에서도 스마트폰을 이용하여 촬영하는데 활용 가능할 것으로 예상된다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.239-246
• /
• 2009

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.831-838
• /
• 1995

Geometric transformations require many operations in displaying moving 3D objects on the screen and a fast computation is a important problem in CAD or animation applications. The general method to compute the transformation coordinates of an object represented by an octree must perform the operations on every node. This paper proposes an efficient method that computes the rectangular coordinates of the vertices of the octree nodes into the coordinates of the universe space using the basicvectors in order to compute quickly geometric transformations of 3D images represented by an octree. The coordinates of the vertices of each octant are computed by using the formula presented here, which requies additions and multiplications by powers of 2. This method has a very fast execution time and is compared with the general computation method.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.709-717
• /
• 2014

The objective of this study is to analyze the degree of correspondences among corners found in building facade imagery when the projective transformation parameters are applied to. Additionally, an appropriate corner detection operator is determined through experiments. Modeling of the shape of a building has been studied in numerous approaches using various type of data such as aerial imagery, aerial lidar scanner imagery, terrestrial imagery, and terrestrial lidar imagery. This study compared the Harris operator with FAST operator and found that the Harris operator is superior in extracting major corner points. After extracting corners using the Harris operator and assessing the degree of correspondence among corners in difference images, real corresponding corners were found to be located in the closest distance. The experiment of the projective transformation with varying corners shows that more corner control points with a good distribution enhances the accuracy of the correspondences.