• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.1
• /
• pp.55-65
• /
• 2020

With the development of display hardware, image interpolation techniques have been used in various fields such as image zooming and medical imaging. Traditional image interpolation methods, such as bi-linear interpolation, bi-cubic interpolation and edge direction-based interpolation, perform interpolation in the spatial domain. Recently, interpolation techniques in the discrete cosine transform or wavelet domain are also proposed. Using these various existing interpolation methods and machine learning, we propose decision tree classification-based image interpolation methods. In other words, this paper is about the method of adaptively applying various existing interpolation methods, not the interpolation method itself. To obtain the decision model, we used Weka's J48 library with the C4.5 decision tree algorithm. The proposed method first constructs attribute set and select classes that means interpolation methods for classification model. And after training, interpolation is performed using different interpolation methods according to attributes characteristics. Simulation results show that the proposed method yields reasonable performance.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2001.10a
• /
• pp.381-386
• /
• 2001

When a input image is extensively magnified on the computer system, it is almost impossible to replicate the original shape because of mismatched coordinates system. In order to resolve the problem, the shape of the magnified image has been reconfigured using the bilinear interpolation method, low pass special filtering interpolation method and B-spline interpolation method, Ferguson curve interpolation method based on the CAD/CAM curve interpolation algorithm. The computer simulation main result was that. Nearest neighbor interpolation method is simple in making the interpolation program but it is not capable to distinguish the original shape. Bilinear interpolation method has the merit to make the magnified shape smooth and soft but calculation time is longer than the other method. Low pass spatial filtering method and B-spline interpolation method has an effect to immerge the intense of the magnified shape but it is also difficult to distinguish the original shape. Ferguson curve interpolation method has sharping shape than B-spline interpolation method.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.640-642
• /
• 1998

When resampling an image to a new set of coordinates, there is often a noticeable loss in image quality. The interpolation kernel determines the quality of interpolation. In this paper, We think two interpolation methods: cubic-spline method, neural net method, at first study given interpolation method using spline and then present new interpolation methon using SOFM and LAM(neural net method), finally compare the performance of several interpolation methods including replication, bilinear, spline and new methods.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.16 no.3
• /
• pp.81-95
• /
• 1998

If a image doesn't include sufficient data of output size and resolution, we will scan again the image. Interpolation generates a new pixel by methematical average of processing. In the interpolation method, there are nearest neighbor interpolation, bilinear interpolation and bicubic interpolation etc. This study was carried out for the purpose of researching compatible method to digital scan image caused by only different interpolation methods. Nearest neighbor interpolation show superior effect in the drawing image. Bilinear interpolation show reduction in detail and contrast. Bicubic interpolation show superior effect in the digital photo image USM(Unsharp Mask) application after extension by interpolation show better than extension by interpolation after USM(unsharp mask) application.

• Journal of Industrial Technology
• /
• v.12
• /
• pp.69-76
• /
• 1992

An attempt has been made to determination the NC milling machine's tool-path through the adaptive parabolic interpolation method & the adaptive linear-parabolic interpolation method in consideration of the economical machining time. The algorithms for the above-mentioned interpolation methods have been designed and the numerical experiments for these methods have been conducted with the existing adaptive linear interpolation methods for comparision.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.963-980
• /
• 2009

In this paper, spectral scheme based on Hermite interpolation for solving partial differential equations is presented. The idea of this Hermite spectral method comes from the spectral method on arbitrary grids of Carpenter and Gottlieb [J. Comput. Phys. 129(1996) 74-86] using the Lagrange interpolation.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3165-3168
• /
• 1999

When a input image is extensively magnified on the computer system, it is almost impossible to replicate the original shape because of mismatched coordinates system. In order to resolve the problem, the shape of the magnified image has been reconfigured using the bilinear interpolation method, low pass special filtering interpolation method and B-spline interpolation method. Ferguson curve interpolation method based on the CAD/CAM curve interpolation algorithm.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.6
• /
• pp.56-63
• /
• 2004

The real-time NURBS interpolation method using 2-stage interpolation is studied. The 2-stage interpolation method that compensates for interpolation errors within machine BLU is proposed. The interpolation result was filtered by an Acceleration/Jerk limitation equation. Through this 2-stage interpolation, both the interpolation error condition and the motion kinematics could be satisfied. Using computer simulation in which interpolation results are evaluated by a numerical iteration method, it is shown that the 2-stage interpolation algerian could interpolate target curves precisely with geometric and dynamic contentment. The proposed algorithm was implemented in the CNC simulator system and an experimental un was conducted to identify the real-time adaptation.

• Water for future
• /
• v.29 no.1
• /
• pp.203-212
• /
• 1996

The subject research attempts to develop a new temporal interpolation scheme for the method of characteristics. The proposed three-point time-line Lagrange interpolation Reachback (3PR) method is a temporal quadratic interpolation scheme using the three grid points near the intersection between a characteristic line and a previous time-line. The accuracy of the 3PR method is compared with those of temporal and spatial interpolation schemes such as Reachback, Upwind, and quandratic spatial interpolation methods for two pure advection problems. The results show that on the aspects of the numerical damping and/or oscillation the temporal interpolation schemes are better than the spatial ones under the same interpolation order conditions. In addition, the spatial ones under the same interpolation order conditions. In addition, the proposed 3PR method improves the accuracy of Reachback method as well as it contains the merits of time-line interpolation schemes.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.175-195
• /
• 2012

Representing planar Pythagorean hodograph (PH) curves by the complex roots of their hodographs, we standardize Farouki's double cubic method to become the undetermined junction point (UJP) method, and then prove the generic existence of solutions for general $C^1$ Hermite interpolation problems. We also extend the UJP method to solve $C^2$ Hermite interpolation problems with multiple PH cubics, and also prove the generic existence of solutions which consist of triple PH cubics with $C^1$ junction points. Further generalizing the UJP method, we go on to solve $C^2$ Hermite interpolation problems using two PH quintics with a $C^1$ junction point, and we also show the possibility of applying the modi e UJP method to $G^2[C^1]$ Hermite interpolation.