• 대한전자공학회논문지SP
• /
• 제48권3호
• /
• pp.119-124
• /
• 2011

보간 필터는 통신과 멀티미디어 응용프로그램에 널리 사용된다. 다항식 보간은 보간된 값을 얻기 위해서 입력정보에 따른 다항식의 계수를 계산한다. 최근에 다항식 보간방법의 성능을 향상시키기 위하여 보조필터를 이용한 FIR 보간방법이 제안되었다. 본 논문에서는 최대값 또는, 최소값 계산 등 특정 순간의 보간 값만 필요한 응용에서 보간필터의 성능을 더욱 향상시킬 수 있는 보조필터를 이용한 가중치 적용 보간방법을 제안한다. 제안한 방법을 X-선 형광분석장치에서 사용되는 정규분포곡선에 대한 보간에 적용하여 기존 보간방법에 비해 더욱 우수한 보간 성능이 제공됨을 보인다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.474-479
• /
• 2003

This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.

• 호남수학학술지
• /
• 제39권4호
• /
• pp.617-635
• /
• 2017

By applying a classical approach for scalar rational interpolation problem, certain type of minimal interpolation problem for rational matrix functions is solved. It is shown that an appropriately defined matrix plays a key role in solving the minimal problem.

• 호남수학학술지
• /
• 제41권4호
• /
• pp.823-835
• /
• 2019

A solution for Nevanlinna-Pick interpolation problem with low complexity is constructed via non-recursive method. More precisely, a stable rational function satifying the given interpolation data in the complex right half plane is found by solving a homogeneous interpolation problem related to a minial interpolation problem for the given data in the right half plane together with its mirror-image data.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.129.1-129
• /
• 2001

In this paper, we present an approach for matching images from finding interesting points and applying new image interpolation algorithm. New algorithms are developed that automatically align the input images match them and reconstruct 3-D surfaces. The interpolation algorithm is designed to cope with simple shapes. The proposed image interpolation algorithm generate a rotation image about vertical axes by an any angle from 4 base images. Each base image that was obtained from CCD camera has an angle difference of 90$^{\circ}$ The proposed image interpolation algorithm use the geometric analysis of image and depth information.

• 한국통신학회논문지
• /
• 제32권8C호
• /
• pp.696-702
• /
• 2007

This paper proposes a regional feature preserving adaptive interpolation algorithm for natural images. The algorithm can be used in resolution enhancement, arbitrary rotation and other applications of still images. The basic idea is to first scan the sample image to initialize a 2D array which records the edge direction of all four-pixel squares, and then use the array to adapt the interpolation at a higher resolution based on the edge structures. A hybrid approach of switching between bilinear and triangulation-based interpolation is proposed to reduce the overall computational complexity. The experiments demonstrate our adaptive interpolation and show higher PSNR results of about max 2 dB than other traditional interpolation algorithms.

• 한국항해항만학회지
• /
• 제39권5호
• /
• pp.377-384
• /
• 2015

The interpolation of missing AIS data can be used for recovering the lost data of a ship's state which is then able to produce useful information for VTS stations or other ships. Previous research has introduced some interpolating methods however there are some problems with regard to missing AIS data. This paper proposes one new method which includes linear interpolation, cubic Hermit interpolation and an identification mechanism to overcome some of those limitations, first AIS data regarding ship position, COG, SOG and HDG is divided into separate time series, then the characteristic of the missing data is investigated into through using an identification mechanism, an appropriate interpolation is selected to fit all the time series which matches the characteristics. Numerical experiments are carried out using real AIS data to validate the algorithm of this approach and the results are compared with the previous method, after which the actual missing area is suggested to be interpolated by the proposed method. The interpolation results show this approach can be applied well in practice.

• 전기학회논문지
• /
• 제56권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.570-575
• /
• 2002

This paper presents a new circular curve fitting approach of articulated manipulators, based on pseudoinverses. The paper aims at gaining the interpolation of circle from n data points, under the condition that the fitted circle should pass both a start point and an end point. In this paper, two algorithms of circular interpolation are presented. Prior to circular interpolation, are a spherical fitting should be performed, using least squares. In the first algorithm, the relationship between point data and normal vector on the sphere is used. In the second algorithm. the equation of plane which can be obtained from 3 points, i.e., a start point, an end point, and center of a sphere. The proposed algorithms are show to be efficient by using MATLAB-based simulation.

• 한국생산제조학회지
• /
• 제22권2호
• /
• pp.256-262
• /
• 2013

This paper presents a linear path control algorithm for NeuroMate robot in a skull drilling system. For the path control inverse kinematics of the robot is analyzed and a linear interpolation algorithm is presented. A geometric approach is used for solving inverse kinematic equations for the robot. Four feasible solutions are found through the approach. The approach gives geometric insights for selecting the best solution from the feasible solutions. The presented linear interpolation algorithm computes a next position considering current velocity and remaining distance to the target position. Presented algorithm is implemented and tested in a skull drilling system.