• Journal of computational fluids engineering
• /
• v.17 no.4
• /
• pp.32-40
• /
• 2012

Efficient Global Optimization (EGO) method is a global optimization technique which can select the next sample point automatically by infill sampling criteria (ISC) and search for the global minimum with less samples than what the conventional global optimization method needs. ISC function consists of the predictor and mean square error (MSE) provided from the kriging model which is a stochastic metamodel. Also the constrained EGO method can minimize the objective function dealing with the constraints under EGO concept. In this study the constrained EGO method applied to the RAE2822 airfoil shape design formulated with the constraint. But the noisy CFD data caused the kriging model to fail to depict the true function. The distorted kriging model would make the EGO deviate from the correct search. This distortion of kriging model can be handled with the interpolation(p=free) kriging model. With the interpolation(p=free) kriging model, however, the search of EGO solution was stalled in the narrow feasible region without the chance to update the objective and constraint functions. Then the accuracy of EGO solution was not good enough. So the three-step search method was proposed to obtain the accurate global minimum as well as prevent from the distortion of kriging model for the noisy constrained CFD problem.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.5
• /
• pp.57-66
• /
• 2008

An adaptive optimization of parametric cubic convolution for image interpolation is derived in this paper. The proposed technique is based on optimizing the standard cubic convolution interpolation formula at each interpolated pixel. Conventional parametric cubic convolution methods use a fixed parameter in an image, so properties of each pixel cannot be incorporated into the interpolation. The proposed method optimizes the interpolation kernel by obtaining parameters adaptively on each pixel. A new cost function is introduced to reflect frequency properties of the original data. The proposed technique produces noticeably sharper edges than traditional techniques and exhibits an average PSNR improvement of traditional techniques.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.9
• /
• pp.172-178
• /
• 1999

3D linear and circular interpolations are a basic part for the machining of complex shapes. Until now, because of the absence of appropriate algorithms for the generation of 3D lines and circles, a full accomplishment for available machine tool resolution is difficult. this paper presents new algorithms for 3D linear and circular interpolation in the reference pulse technique. In 3D space, the line or circle is not expressed as an implicit function, it is only defined as the intersection of two surfaces. A 3D line is defined as the intersection of two planes, and a 3D circle is defined as the intersection of a plane and the surface of a sphere. Based on these concepts, interpolation algorithms are designed to follow intersection curves in 3D space, and a real-time 3D linear and circular interpolator was developed in software using a PC. The algorithm implemented in a PC showed promising results in interpolation error and speed performance. It is expected that it can be applied to the next generation computerized numerical control systems for the machining of 3D lines, circles and some other complex shapes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.4
• /
• pp.795-798
• /
• 2007

In this paper, we propose an image reconstruction method utilizing an optimized adaptive interpolation kernel along with a 2D M-channel perfect reconstruction filter bank (M-ch PR-FB) structure. In particular, the proposed approach leads to construction of a sharper image than a direct conversion, still preserving high frequency components of the original image through the subband processing of the 2D M-ch PR-FB. Finally, the image quality of the proposed approach is demonstrated by comparing with those of the direct methods using conventional interpolation kernels.

• Journal of Information Display
• /
• v.5 no.3
• /
• pp.1-7
• /
• 2004

We developed a novel frame interpolation method to interpolate a frame between two successive original frames. Using this method, we are able to apply a double-rate driving method instead of an impulse driving method where a black frame is inserted between two successive original frames. The double-rate driving method enables amelioration of the motion blur of LCDs caused by the characteristics of human vision without reducing the luminosity of the whole screen. The image quality of the double-rate driving method was also found to be better than that of an impulse driving method using our motion picture simulator and an actual panel. Our initial model of our frame interpolation method consists of motion estimation with a maximum matching pixel count estimation function, an area segmentation technique, and motion compensation with variable segmentation threshold. Although salt and pepper noise remained in a portion of an object mainly due to inaccuracy of motion estimation, we verified the validity of our method and the possibility of improvement in hold-type motion blurring.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.2
• /
• pp.433-442
• /
• 1995

For the line search of a multi-variable optimization, an efficient algorithm is presented. The algorithm sequentially employs several polynomial approximations such as 2-point quadratic interpolation, 3-point cubic interpolation/extrapolation and 4-point cubic interpolation/extrapolation. The order of polynomial function is automatically increased for improving the accuracy of approximation. The method of approximation (interpolation or extrapolation) is automatically switched by checking the slope information of the sample points. Also, for selecting the initial step length along the descent vector, a new approach is presented. The performance of the proposed method is examined by solving typical test problems such as mathematical problems, mechanical design problems and dynamic response problems.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1188-1200
• /
• 2015

A unified numerical method for computing the quadrature weights, integration matrix, and differentiation matrix is newly developed in this study. For this purpose, a spline-like interpolation using piecewise continuous polynomials is converted into a global spline interpolation formula, with which the quadrature formulas can be derived from integration and differentiation of the transformed function in an exact manner. To prove the usefulness of the suggested approach, both the Lagrange and tension spline interpolations are represented in exactly the same form as global spline interpolation. The applicability of the proposed method on arbitrary nodes is illustrated using two different sets of nodes. A series of validations using three test functions is conducted to show the flexibility in selecting computational nodes with the present method.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.596-599
• /
• 2003

In this paper, we designed the digital pulse motor control chip including a circular interpolation function. The proposed algorithm in this paper is a nonparametric cure generation algorithm (Jordan's algorith) and a very simple algorithm. So the design for this algorithm used a small number of gates. Also an average error is fairly low. The max output speed is 4Mpps(Pulse per second), the max input frequency is 16MHz and the chip is useful for the stepping and servo motors. The software contains one or two, and many axes linear interpolation algorithm and two axes circular interpolation algorithm.

• Ocean Systems Engineering
• /
• v.9 no.2
• /
• pp.179-190
• /
• 2019

This paper deals with the problem of the global stabilization for a class of ocean structure systems. It is well known that, in general, the global asymptotic stability of the ocean structure subsystems does not imply the global asymptotic stability of the composite closed-loop system. The classical fuzzy inference methods cannot work to their full potential in such circumstances because given knowledge does not cover the entire problem domain. However, requirements of fuzzy systems may change over time and therefore, the use of a static rule base may affect the effectiveness of fuzzy rule interpolation due to the absence of the most concurrent (dynamic) rules. Designing a dynamic rule base yet needs additional information. In this paper, we demonstrate this proposed methodology is a flexible and general approach, with no theoretical restriction over the employment of any particular interpolation in performing interpolation nor in the computational mechanisms to implement fitness evaluation and rule promotion.

• Journal of Korea Multimedia Society
• /
• v.24 no.6
• /
• pp.768-788
• /
• 2021

The reversible data hiding technique safely transmits secret data to the recipient from malicious attacks by third parties. In addition, this technique can completely restore the image used as a transmission medium for secret data. The reversible data hiding schemes have been proposed in various forms, and recently, the reversible data hiding schemes based on interpolation are actively researching. The reversible data hiding scheme based on the interpolation method expands the original image into the cover image and embed secret data. However, the existing interpolation-based reversible data hiding schemes did not embed secret data during the interpolation process. To improve this problem, this paper proposes embedding the first secret data during the image interpolation process and embedding the second secret data into the interpolated cover image. In the embedding process, the original image is divided into blocks without duplicates, and the maximum and minimum values are determined within each block. Three way searching based on the maximum value and two way searching based on the minimum value are performed. And, image interpolation is performed while embedding the first secret data using the PVD scheme. A stego image is created by embedding the second secret data using the maximum difference value and log function in the interpolated cover image. As a result, the proposed scheme embeds secret data twice. In particular, it is possible to embed secret data even during the interpolation process of an image that did not previously embed secret data. Experimental results show that the proposed scheme can transmit more secret data to the receiver while maintaining the image quality similar to other interpolation-based reversible data hiding schemes.