• Honam Mathematical Journal
• /
• v.41 no.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.

• Honam Mathematical Journal
• /
• v.39 no.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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1847-1852
• /
• 2004

This article provides the connection between feedback stabilization and interpolation conditions for n-D linear systems (n > 1). In addition to internal stability, if one demands performance as a design goal, then there results an n-D matrix Nevanlinna-Pick interpolation problem. Application of recent work on Nevanlinna-Pick interpolation on the polydisk yields a solution of the problem for the 2-D case. The same analysis applies in the n-D case (n > 2), but leads to solutions which are contractive in a norm (the "Schur-Agler norm") somewhat stronger than the $H^{\infty}$ norm. This is an analogous version of the connection between the standard $H^{\infty}$ control problem and an interpolation problem of Nevanlinna-Pick type in the classical 1-D linear time-invariant systems.

• Structural Engineering and Mechanics
• /
• v.59 no.6
• /
• pp.1071-1094
• /
• 2016

We employ the so-called problem-dependent linked interpolation concept to develop two cubic 4-node quadrilateral plate finite elements with 12 external degrees of freedom that pass the constant bending patch test for arbitrary node positions of which the second element has five additional internal degrees of freedom to get polynomial completeness of the cubic form. The new elements are compared to the existing linked-interpolation quadratic and nine-node cubic elements presented by the author earlier and to the other elements from literature that use the cubic linked interpolation by testing them on several benchmark examples.

• Communications of the Korean Mathematical Society
• /
• v.19 no.4
• /
• pp.691-700
• /
• 2004

Let X and Y be operators acting on a Hilbert space and let (equation omitted) be a subspace lattice of orthogonal projections on the space containing 0 and I. We investigate normal interpolation problems in Alg(equation omitted): Given operators X and Y acting on a Hilbert space, when does there exist a normal operator A in Alg(equation omitted) such that AX = Y?

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.3
• /
• pp.128-134
• /
• 2014

A real-time, continuous-scale image interpolation method is proposed based on a bilinear interpolation with directionally adaptive low-pass filtering. The proposed algorithm was optimized for hardware implementation. The ordinary bi-linear interpolation method has blocking artifacts. The proposed algorithm solves this problem using directionally adaptive low-pass filtering. The algorithm can also solve the severe blurring problem by selectively choosing low-pass filter coefficients. Therefore, the proposed interpolation algorithm can realize a high-quality image scaler for a range of imaging systems, such as digital cameras, CCTV and digital flat panel displays.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.5
• /
• pp.690-695
• /
• 2014

This paper presents a modified CCI image interpolation method based on the even-odd decomposition (EOD). The CCI method is a well-known technique to interpolate images. Although the method provides better image quality than the linear interpolation, its complexity still is a problem. To remedy the problem, this paper introduces analysis on the EOD decomposition of CCI and then proposes a reduced CCI interpolation in terms of complexity, providing better image quality in terms of PSNR. To evaluate the proposed method, we conduct experiments and complexity comparison. The results indicate that our method do not only outperforms the existing methods by up to 43% in terms of MSE but also requires low-complexity with 37% less computing time than the CCI method.

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

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

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.31-38
• /
• 1994

This paper presents an improved interpolation algorithm which enables to find a unit function in $H^{\infty}$. From the proposed algorithm the interpolation problem on the infinity point with multiplicity can be solved. This is based on the DPL algorithm the acquired unit function has low order and can be directly applied to strong/simultaneous stabilization problem in control systems. Finally, we verify that poles of transfer function of closed-loop system exist in stable region while investgating internal stability.