• Journal for History of Mathematics
• /
• v.11 no.2
• /
• pp.63-76
• /
• 1998

When teaching the linear regression analysis in the class, the power transformation must be introduced to fit the linear regression model for nonlinear data. Box and Cox (1964) proposed the attractive power transformation technique which is so called Box-Cox transformation. In this paper, an effective algorithm selecting an appropriate value for Box-Cox transformation is developed which is considered to find a value minimizing error sum of squares. When the proposed algorithm is used to find a value for transformation, the number of iterations needs to be considered. Thus, the number of iterations is examined through simulation study. Since SAS is one of most widely used packages and does not provide the procedure that performs iterative Box-Cox transformation, a SAS program automatically choosing the value for transformation is developed. Hence, the students could learn how the Box-Cox transformation works, moreover, researchers can use this for analysis of data.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.323-335
• /
• 1999

In this paper, we propose a new hybrid model of artificial neural networks(ANNs) and genetic algorithm (GA) to optimal feature transformation and feature weighting. Previous research proposed several variants of hybrid ANNs and GA models including feature weighting, feature subset selection and network structure optimization. Among the vast majority of these studies, however, ANNs did not learn the patterns of data well, because they employed GA for simple use. In this study, we incorporate GA in a simultaneous manner to improve the learning and generalization ability of ANNs. In this study, GA plays role to optimize feature weighting and feature transformation simultaneously. Globally optimized feature weighting overcome the well-known limitations of gradient descent algorithm and globally optimized feature transformation also reduce the dimensionality of the feature space and eliminate irrelevant factors in modeling ANNs. By this procedure, we can improve the performance and enhance the generalisability of ANNs.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.202-204
• /
• 2006

In this paper, the detection scheme of the spatial coordinates based on stereo camera for a Transformation algorithm of an Leg-wheel Hexapod Robot is proposed. Robot designed as can have advantages that do transfer possibility fast mobility in flat topography and uneven topography through walk that use wheel drive. In the proposed system, using the disparity data obtained from the left and right images captured by the stereo camera system and the perspective transformation between a 3-D scene and an image plane, depth information can be detected. Robot uses construed environmental data and transformation algorithm, decide wheel drive and leg waik, and can calculate width of street and regulate width of robot.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1671-1674
• /
• 1997

In tihs paper, an acceleratiion transformation algorithm which compensates the sculling error is proposed for strapdown inertial navigation system. The algorithm utilize the corss-product of the acceleromenter outputs and gyro outputs to keep the accuracy of the vehicle velocity under high frequency dynamic motion. From the error analysis of the algorithm, it is shown that the magnitude of estimation error is reduced by four orders.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.52-62
• /
• 1997

To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.05a
• /
• pp.249-263
• /
• 2000

This paper considers an algorithm using Johnson transformation to calculate process capability index for non-normal distribution. Johnson transformation is well known as one of methods transforming the data with non-normal distribution to normal data.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.2
• /
• pp.195-205
• /
• 2005

In decision tree analysis, C4.5 and CART algorithm have some problems of computational complexity and bias on variable selection. But QUEST algorithm solves these problems by dividing the step of variable selection and split point selection. When input variables are continuous, QUEST algorithm uses ANOVA F-test under the assumption of normality and homogeneity of variances. In this paper, we investigate the influence of violation of normality assumption and effect of the transformation of variables in the QUEST algorithm. In the simulation study, we obtained the empirical powers of variable selection and the empirical bias of variable selection after transformation of variables having various type of underlying distributions.

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

In these days, XML is a de facto standard language for representing and exchanging data. In order to define the conceptual model of the XML, we need to define the representation rules expressed in the diagram and propose the transformation algorithm that converts the diagram into a logical model of XML. This paper proposes a transformation methodology for generating a logical model from the conceptual model of the XML. We use CMXML as a conceptual model and generate XML schema definition as a logical model. For this, we define transformation rules and data structures for XML schema, and propose a transformation algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.98-105
• /
• 1997

Image transformation ahs been widely used in compuater graphics, computer vision, robot vision, and image processing. Image rotation is one of important part of image transformation. In image rotation, a two-pass algorithm has many advantages over a one-pass algorithm in high speed computation. This paper presents a new two-pass algorithm that overcomes the limitations of previously reported effect of interpolation. A brief comparison of existent techniques and the twp-pass algorithm newly suggeste is presented. This paper also present the hardware structure for the two-pass algorithm suggested.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.785-794
• /
• 2013

Soon after Lee and O'Sullivan proposed a new interpolation algorithm for algebraic soft-decision decoding of Reed-Solomon codes, there have been some attempts to apply a coordinate transformation technique to the new algorithm, with a remarkable complexity reducing effect. In this paper, a conceptually simple way of applying the transformation technique to the interpolation algorithm is proposed.