• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.10
• /
• pp.1079-1086
• /
• 2013

Optimal mount position of a front pillar trim considering heat resistant characteristics can be determined by two methods. One is conventional approximate optimization method which uses the statistical design of experiments (DOE) and response surface method (RSM). Generally, approximated optimum results are obtained through the iterative process by a trial and error. The quality of results depends seriously on the factors and levels assigned by a designer. The other is a methodology derived from previous work by the authors, which is called sequential design of experiments (SDOE), to reduce a trial and error procedure and to find an appropriate condition for using artificial neural network (ANN) systematically. An appropriate condition is determined from the iterative process based on the analysis of means. With this new technique and ANN, it is possible to find an optimum design accurately and efficiently.

• Korean Journal of Remote Sensing
• /
• v.30 no.2
• /
• pp.219-226
• /
• 2014

Fractional values resulted from the spectral mixture analysis could be used to classify not only urban area with various materials but also forest area in more detailed spatial scale. Especially South Korea is largely consist of mixed forest, so the spectral mixture analysis is suitable as a classification method. For the successful classification using spectral mixture analysis, extraction of optimal endmembers is prerequisite process. Though geometric endmember selection has been widely used, it is barely suitable for forest area. Therefore, in this study, we modified Iterative Error Analysis (IEA), one of the most famous algorithms of image endmember selection which extracts pure pixel directly from the image. The endmembers which represent deciduous and coniferous trees are automatically extracted. The experiments were implemented on two sites of Compact Airborne Spectrographic Imager (CASI) and classified forest area into two types. Accuracies of each classification results were 86% and 90%, which mean proposed algorithm effectively extracted proper endmembers. For the more accurate classification, another substances like forest gap should be considered.

• Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.218-232
• /
• 2015

Piecewise linear (G01-based) tool paths generated by CAM systems lack $G_1$ and $G_2$ continuity. The discontinuity causes vibration and unnecessary hesitation during machining. To ensure efficient high-speed machining, a method to improve the continuity of the tool paths is required, such as B-spline fitting that approximates G01 paths with B-spline curves. Conventional B-spline fitting approaches cannot be directly used for tool path B-spline fitting, because they have shortages such as numerical instability, lack of chord error constraint, and lack of assurance of a usable result. Progressive and Iterative Approximation for Least Squares (LSPIA) is an efficient method for data fitting that solves the numerical instability problem. However, it does not consider chord errors and needs more work to ensure ironclad results for commercial applications. In this paper, we use LSPIA method incorporating Energy term (ELSPIA) to avoid the numerical instability, and lower chord errors by using stretching energy term. We implement several algorithm improvements, including (1) an improved technique for initial control point determination over Dominant Point Method, (2) an algorithm that updates foot point parameters as needed, (3) analysis of the degrees of freedom of control points to insert new control points only when needed, (4) chord error refinement using a similar ELSPIA method with the above enhancements. The proposed approach can generate a shape-preserving B-spline curve. Experiments with data analysis and machining tests are presented for verification of quality and efficiency. Comparisons with other known solutions are included to evaluate the worthiness of the proposed solution.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.1222-1229
• /
• 1993

An advanced design environment , which is based on adaptive and knowledge -based finite elements (INTELMESH), has been developed. Unlike other approaches, INTEMMESH incorporates the information about the object geometry as well as the boundary and loading conditions to generate an ${\alpha}$-priori finite element mesh which is more refined around the critical regions of the problem domain. INTEMMESH is designed for planar domains and axisymmetric 3-D structures of elasticity and heat transfer subjected to mechanical and thermal loading . It intelligently identifies the critical regions/points in the problem domain and utilize the new concepts of substructuring and wave propagation to choose the proper mesh size for them. INTEMMESH generates well-shaped triangular elements by applying trangulartion and Laplacian smoothing procedures. The adaptive analysis involves the intial finite elements analyze and an efficient ${\alpha}$-posteriori error analysis involves the initial finite element anal sis and an efficient ${\alpha}$-posteriori error analysis and estimation . Once a problem is defined , the system automatically builds a finite element model and analyzes the problem though automatic iterative process until the error reaches a desired level. It has been shown that the proposed approach which initiates the process with an ${\alpha}$-priori, and near optimum mesh of the object , converges to the desired accuracy in less time and at less cost. Such an advanced design/analysis environment will provide the capability for rapid product development and reducing the design cycle time and cost.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.171-184
• /
• 2014

A higher order iterative method to compute the Moore-Penrose inverses of arbitrary matrices using only the Penrose equation (ii) is developed by extending the iterative method described in [1]. Convergence properties as well as the error estimates of the method are studied. The efficacy of the method is demonstrated by working out four numerical examples, two involving a full rank matrix and an ill-conditioned Hilbert matrix, whereas, the other two involving randomly generated full rank and rank deficient matrices. The performance measures are the number of iterations and CPU time in seconds used by the method. It is observed that the number of iterations always decreases as expected and the CPU time first decreases gradually and then increases with the increase of the order of the method for all examples considered.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.743-753
• /
• 2001

We provide local convergence results in affine form for inexact Newton-like as well as quasi-Newton iterative methods in a Banach space setting. We use hypotheses on the second or on the first and mth Frechet-derivative (m≥2 an integer) of the operator involved. Our results allow a wider choice of starting points since our radius of convergence can be larger than the corresponding one given in earlier results using hypotheses on the first-Frechet-derivative only. A numerical example is provided to illustrate this fact. Our results apply when the method is, for example, a difference Newton-like or update-Newton method. Furthermore, our results have direct applications to the solution of autonomous differential equations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.224-229
• /
• 2007

This paper presents a camera calibration method using several images for three dimensional measurement applications such as stereo systems, mobile robots, and visual inspection systems in factories. Conventional calibration methods that use single image suffer from errors related to reference point extraction in image, lens distortion, and numerical analysis of nonlinear optimization. The camera parameter values obtained from images of same camera is not same even though we use same calibration method. The camera parameters that are obtained from several images of different view for a calibration target is usaully not same with large error values and we can not assume a special probabilistic distribution when we estimate the parameter values. In this paper, the median value of camera parameters from several images is used to improve estimation of the camera values in an iterative step with nonlinear optimization. The proposed method is proved by experiments using real images.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.593-600
• /
• 2003

Structural optimization often requires the evaluation of design sensitivities. The Semi Analytic Method(SAM) fur computing sensitivity is popular in shape optimization because this method has several advantages. But when relatively large rigid body motions are identified for individual elements. the SAM shows severe inaccuracy. In this study, the improvement of design sensitivities corresponding to the rigid body mode is evaluated by exact differentiation of the rigid body modes. Moreover. the error of the SAM caused by numerical difference scheme is alleviated by using a series approximation for the sensitivity derivatives and considering the higher order terms. Finally the present study shows that the refined SAM including the iterative method improves the results of sensitivity analysis in dynamic problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1525-1530
• /
• 2015

In this paper, We analyzed the performance of turbo equalizer using turbo codes thorough the under water experiment. To compensate the distorted signal induced by multipath effect, we apply the iterative turbo codes that iteratively exchange probabilistic information between LMS-DFE and turbo decoder, thereby reducing the error rates significantly. We showed the successful of turbo decoding of iterative turbo equalizer is 93%.

• Kyungpook Mathematical Journal
• /
• v.62 no.4
• /
• pp.699-713
• /
• 2022

This paper proposes a hybrid successive over-relaxation iterative method for the numerical solution of a nonlinear diffusion in a one-dimensional porous medium. The considered mathematical model is discretized using a computational complexity reduction scheme called half-sweep finite differences. The local truncation error and the analysis of the stability of the scheme are discussed. The proposed iterative method, which uses explicit group technique and modified successive over-relaxation, is formulated systematically. This method improves the efficiency of obtaining the solution in terms of total iterations and program elapsed time. The accuracy of the proposed method, which is measured using the magnitude of absolute errors, is promising. Numerical convergence tests of the proposed method are also provided. Some numerical experiments are delivered using initial-boundary value problems to show the superiority of the proposed method against some existing numerical methods.