• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.161-163
• /
• 2005

In this paper, we propose an efficient motion vector recovery algorithm for the new coding standard H.264, which makes use of the Lagrange interpolation formula. In H.264/AVC, a 16$\times$16 macroblock can be divided into different block shapes for motion estimation, and each block has its own motion vector. In the natural video the motion vector is likely to move in the same direction, hence the neighboring motion vectors are correlative. Because the motion vector in H.264 covers smaller area than previous coding standards, the correlation between neighboring motion vectors increases. We can use the Lagrange interpolation formula to constitute a polynomial that describes the motion tendency of motion vectors, and use this polynomial to recover the lost motion vector. The simulation result shows that our algorithm can efficiently improve the visual quality of the corrupted video.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.2
• /
• pp.267-281
• /
• 2016

In this paper, we consider multi-degree reduction of $B{\acute{e}}zier$ curves with continuity of any (r, s) order with respect to $L_2$ norm. With help of matrix theory about generalized inverses we can use Lagrange multipliers to obtain the degree reduction matrix in a very simple form as well as the degree reduced control points. Also error analysis comparing with the least squares degree reduction without constraints is given. The advantage of our method is that the relationship between the optimal multi-degree reductions with and without constraints of continuity can be derived explicitly.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.1
• /
• pp.59-63
• /
• 2005

In this article, we apply the standard method of Lagrange multipliers to examine the algorithm in a recent IEEE publication which calculates the optimal generation for minimizing the system loss using loss sensitivities derived by angle reference transposition, and show that the two algorithms are mathematically the same.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.527-535
• /
• 2005

Numerical differentiation is one of the main topics which have been studied by many researchers. If we use the forward difference scheme or the centered difference scheme, the convergence rates to the derivative are O(h) and O($h^2$), respectively. In this paper, using the Lagrange Interpolation, we construct a simple high order numerical differentiation scheme which has the convergence rate O($h^{2k}$) if we have 2k+1 equally spaced nodes. Our scheme is constructive.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.31-48
• /
• 2007

The paper deals with the solution of some fractional partial differential equations obtained by substituting modified Riemann-Liouville derivatives for the customary derivatives. This derivative is introduced to avoid using the so-called Caputo fractional derivative which, at the extreme, says that, if you want to get the first derivative of a function you must before have at hand its second derivative. Firstly, one gives a brief background on the fractional Taylor series of nondifferentiable functions and its consequence on the derivative chain rule. Then one considers linear fractional partial differential equations with constant coefficients, and one shows how, in some instances, one can obtain their solutions on bypassing the use of Fourier transform and/or Laplace transform. Later one develops a Lagrange method via characteristics for some linear fractional differential equations with nonconstant coefficients, and involving fractional derivatives of only one order. The key is the fractional Taylor series of non differentiable function $f(x+h)=E_{\alpha}(h^{\alpha}{D_x^{\alpha})f(x)$.

• Journal of Mechanical Science and Technology
• /
• v.14 no.10
• /
• pp.1122-1130
• /
• 2000

Based on the value of the Lagrange multiplier and the degree of constraint activeness, a new update rule is proposed for penalty parameters of the ALM method. The theoretical exposition of this suggested update rule is presented by using the algorithmic interpretation and the geometric interpretation of the augmented Lagrangian. This interpretation shows that the penalty parameters can effect the performance of the ALM method. Also, it offers a lower limit on the penalty parameters that makes the augmented Lagrangian to be bounded. This lower limit forms the backbone of the proposed update rule. To investigate the numerical performance of the update rule, it is embedded in our ALM based dynamic response optimizer, and the optimizer is applied to solve six typical dynamic response optimization problems. Our optimization results are compared with those obtained by employing three conventional update rules used in the literature, which shows that the suggested update rule is more efficient and more stable than the conventional ones.

• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.101-114
• /
• 1995

In this paper we consider the multiple unit root tests both for the regular and seasonal unit roots based on the Lagrange Multiplier(LM) principle. Unlike Li(1991)'s method, by plugging the restricted maximum likelihood estimates of the nuisance parameters in the model, we propose a Lagrange multiplier test which does not depend on the existence of the nuisance parameters. The asymptotic distribution of the proposed statistic is derived and empirical percentiles of the test statistic for selected seasonal periods are provided. The power and size of the test statistic for examined for finite samples through a Monte Carlo simularion.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.9 s.102
• /
• pp.1030-1036
• /
• 2005

This paper is concerned with the application of perturbation method to the dynamic analysis of space structure floating in space. In dealing with the dynamics of space structure, the use of Lagrange's equations of motion in terms of quasi-coordinates were suggested to derive hybrid equations of motion for rigid-body translations and elastic vibrations. The perturbation method is then applied to the hybrid equations of motion along with discretization by means of admissible functions. This process is very tiresome. Recently, a new approach that applies the perturbation method to the Lagrange's equations directly was proposed and applied to the two-dimensional floating structure. In this paper. we propose the application of the perturbation method to the Lagrange's equations of motion in terms of quasi-coordinates. Theoretical derivations show the efficacy of the proposed method.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.2
• /
• pp.367-377
• /
• 2012

The goal of the image restoration is to find a good approximation of the original image for the degraded image, the blurring matrix, and the statistics of the noise vector given. Fast truncated Lagrange (FTL) method has been proposed by G. Landi as a image restoration method for large-scale ill-conditioned BTTB linear systems([3]). We implemented FTL method for the image restoration problem with reflective boundary condition which gives better reconstructions of the unknown, the true image.

• Journal of the Chungcheong Mathematical Society
• /
• v.31 no.1
• /
• pp.137-149
• /
• 2018

In this paper, under the assumption of the symmetry point spread function, antireflective boundary conditions(AR-BCs) are considered in connection with the fast truncated Lagrange(FTL) method. The FTL method is proposed as an image restoration method for large-scale ill-conditioned BTTB(block Toeplitz with Toeplitz block) and BTHHTB(block Toeplitz-plus-Hankel matrix with Toeplitz-plus-Hankel blocks) linear systems([13, 17]). The implementation and efficiency of the FTL method in the AR-BCs are further illustrated. Especially, by employing the AR-BCs, both the continuity of the image and the continuity of its normal derivative are preserved at the boundary. A reconstructed image with less artifacts at the boundary is obtained as a result.