• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.151-160
• /
• 2005

In this paper, we propose a new fast motion estimation algorithm based on successive elimination algorithm (SEA) which can dramatically reduce heavy complexity of the variable block size motion estimation in H.264 encoder. The proposed method applies the conventional SEA in the hierarchical manner to the seven block modes. That is, the proposed algorithm can remove the unnecessary computation of SAD by means of the process that the previous minimum SAD is compared to a current SAD for each mode which is obtained by accumulating sum norms or SAD of $4\times4$ blocks. As a result, we have tighter bound in the inequality between SAD and sum norm than in the ordinary SEA. If the basic size of the block is smaller than $4\times4$, the bound will become tighter but it also causes to increase computational complexity, specifically addition operations for sum norm. Compared with fast full search algorithm of JM of H.264, our algorithm saves 60 to $70\%$ of computation on average for several image sequences.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.461-464
• /
• 2003

This paper proposes the multi-level vector error diffusion for smear artifact reduction in the boundary regions. Smear artifact mainly results from a large accumulation of quantization error. Accordingly, to reduce these artifacts, the proposed method excludes the large quantization error in the error diffusion process by comparing the magnitude of the error vector with predetermined first threshold. In addition, if the vector norm of the difference between the error adjusted input vector and the primary co]or that has minimum vector norm for the error adjusted input vector is larger than second threshold, the error is excluded. As a result, the proposed method reduce smear artifact in the boundary region and produces visually pleasing halftone pattern.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.705-710
• /
• 2002

In this paper, we present a method to find motion vectors in frequency domain for video data compression. The proposed algorithm is based on the Format Number Transform (FNT), and it declares the most correlated-block as the best matching block, as opposed to declaring the block with least sum of differences between blocks. We show that the proposed method is equivalent to declaring the block with the minimum L2-norm as the best matching block. Unlike other previous fast algorithms, the time requirement for the proposed algorithm does not defend on the image type for finding the optimum solution.

• Journal of Biomedical Engineering Research
• /
• v.25 no.6
• /
• pp.575-580
• /
• 2004

In this work, a method is presented to find an anatomical site of a current source crudely in a standard brain using grand average of MEG data. Minimum norm estimation algorithm and truncated singular value decomposition were applied to calculate the distributed sources that can reproduce the measured signals. Grand average over all subjects was obtained from the transformed signals, which would be detected in a standard sensor plane by the obtained distributed current sources. In the simulation study, it was shown that the localized dipole using the grand average is consistent with the mean location of localized dipoles of all subjects within several mm even with large inter-individual differences of sensor positions. This result suggests that the mean location of low level signal source can be estimated as a dipole source in grand average and it was confirmed in the localization of the current source of N100m. when the localized dipole is registered on a standard brain. This result also suggests that the activity region obtained from grand average can be crudely estimated on a standard brain using the source location of the N100m as a reference point.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.1 no.1
• /
• pp.72-74
• /
• 1983

Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.58-64
• /
• 1994

In this paper, a robust control scheme of a nonlinear system with norm bounded uncertainty is studied. The proposed algorithm is based on variable structure systems (VSS) theory. the sliding mode which is robust to plant uncertainty and disturbances is obtained by regulating a sliding surface equation. This VSS control law can improve the robustness of control systems by adjusting the minimum reaching velocity in a reaching phase. A numerical example is given to verify the effectiveness of the control law.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.5
• /
• pp.600-607
• /
• 1998

일반적인 비선형 동역학 최적화문제를 비선형 프로그래밍 문제로 변환하는데 제어변수들을 방사성 기본 함수로 근사화하는 방법이 사용되었다. 방사성 기본 함수의 계수들을 연속적으로 보정하기 위하여 최소수정기법에 기초를 둔 비선형 프로그래밍 알고리즘이 연구되었다. 이러한 알고리즘을 실제적인 다변수 제어 시스템에 적용하여 성능을 검증하였다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.123-126
• /
• 1991

A generalization of null-spectrum for use in the estimation of directions of arrival of signal sources is considered in this paper. The upper and lower bounds of the generalized null-spectrum, the maximum and minimum null-spectra, are also derived. We observed that the maximum null-spectrum has higher resolution capability than other null-spectra including the two well-known null-spectra, the multiple signal classification null-spectrum and the Min-Norm null-spectrum.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.13-13
• /
• 2000

This paper considers delay-dependent guaranteed cost control for uncertain time-delay systems with norm-bounded parametric uncertainties. A new delay-dependent condition for the existence of the guaranteed cost control law is presented in terms of linear matrix inequalities (LMI). An algorithm involving convex optimization is proposed to design a controller which guarantees the suboptimal minimum of the guaranteed cost of the closed-loop system for all admissible uncertainties.