• Journal of Information Processing Systems
• /
• v.2 no.3 s.4
• /
• pp.153-158
• /
• 2006

In this paper, we propose an image interpolator for low computational complexity. The proposed image interpolator supports the image scaling using a modified cubic convolution interpolation between the input and output resolutions for a full screen display. In order to reduce the computational complexity, we use the difference in value of the adjacent pixels for selecting interpolation methods and linear function of the cubic convolution. The proposed image interpolator is compared with the conventional one for the computational complexity and image quality. The proposed image interpolator has been designed and verified by Verilog HDL(Hardware Description Language). It has been synthesized using the Xilinx VirtexE FPGA, and implemented using an FPGA-based prototype board.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.83-85
• /
• 2003

This paper presents a correction technique of missing load data. In this paper, the ARIMA(Autoregressive Integrated Moving Average) model and Piecewise Cubic Interpolation are applied to seek the missing parameters. The new model has been tested under a variety of conditions and it is shown in this paper to produce excellent results. It is helpful for operators to designed the load duration curve.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.111-119
• /
• 2009

This paper presents an adaptive image interpolation algorithm using local characteristics. An input image is classified into edge region and flat low frequency region. And then, the edge region is further partitioned into directive edge region and high frequency texture region. A bilinear interpolation is applied to flat low frequency region, cubic convolution is applied to texture region, and new edge directed interpolation to directive edge region, respectively. Simulation results show that the proposed algorithm outperforms the existing interpolation methods in terms of visual quality as well as PSNR.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.6
• /
• pp.22-34
• /
• 2010

Existing image scalers generally adopt simple interpolation methods such as bilinear method to take cost-benefit, or highly complex architectures to achieve high quality resulting images. However, demands for a low power, low cost, and high performance image scaler become more important because of emerging high quality mobile contents. In this paper we propose the novel low power hardware architecture for a high quality raster scan image scaler. The proposed scaler architecture enhances the existing cubic interpolation look-up table architecture by reducing and optimizing memory access and hardware components. The input data buffer of existing image scaler is replaced with line memories to reduce the number of memory access that is critical to power consumption. The cubic interpolation formula used in existing look-up table architecture is also rearranged to reduce the number of the multipliers and look-up table size. Finally we analyze the optimized parameter sets of look-up table, which is a trade-off between quality of result image and hardware size.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.163-171
• /
• 2008

In this paper, we present an adaptive parametric cubic convolution technique in order to enlarge the low resolution image to the high resolution image. The proposed method consists of two steps. During the first interpolation step, we acquire adaptive parameters in introducing a new cost-function to reflect frequency properties. And, the second interpolation step performs cubic convolution by applying the parameters obtained from the first step. The enhanced interpolation kernel using adaptive parameters produces output image better than the conventional one using a fixed parameter. Experimental results show that the proposed method can not only provides the performances of $0.5{\sim}4dB$ improvements in terms of PSNR, but also exhibit better edge preservation ability and original image similarity than conventional methods in the enlarged images.

• The Korean Journal of Applied Statistics
• /
• v.26 no.3
• /
• pp.549-568
• /
• 2013

This paper discusses conversion methods between multiple decrement models and associated single decrement models. One of most popular assumptions on fractional age is UDD(uniform distribution of decrement) or constant force of mortality in actuarial practice. Instead of these assumptions, this paper suggests cubic spline interpolation to approximate the distribution of fractional age with the continuous force of decrements. Conversion formulas are derived. The comparisons of these two methods based on the numerical data show that the cubic spline interpolation approach is more accurate.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.12
• /
• pp.820-826
• /
• 2004

In this paper, studied error of various signal interpolation methods in vibration signal analysis with digital order tracking. Because, interpolation errors are related with sampling rate and amount of calculation. Appled Signal interpolation methods are Lagrange, Newton and Cubic-spline. This paper proposed more proper interpolation method. Also, we suggest guideline for adaptive application of signal interpolation methods with Calculated results.

• 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.358-363
• /
• 1998

An algorithm for representing the cubic spline interpolation of differentiable functions by a fuzzy system is presented in this paper. The cubic B-spline functions which form a basis for the interpolation function are used as the fuzzy sets for input fuzzification. The ordinal number of the coefficient cKL in the list of the coefficient cij's as sorted in increasing order, is taken to be the output fuzzy set number in the (k, l) th entry of the fuzzy rule table. Spike functions are used for the output fuzzy sets, with cij's as support boundaries after they are sorted. An algorithm to compute the support boundaries explicitly without solving the matrix equation involved is included, along with a few properties of the fuzzy rule matrix for the designed fuzzy system.