• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.729-737
• /
• 2007

The H.264/AVC video coding standard provides higher coding efficiency compared to the conventional MPEG-2 standard. Since a lot of videos have been encoded using MPEG-2, the format conversion from MPEG-2 to H.264 is essential. In this paper, we propose an efficient method for the conversion of DCT coefficients to H.264/AVC transform coefficients. This conversion is essential, since $8{\times}8$ DCT and $4{\times}4$ integer transform are used in MPEG-2 and H.264/AVC, respectively. The mathematical analysis and computer simulation show that the computational complexity of the proposed algorithm is reduced compared to the conventional algorithm, while the loss caused by the conversion is negligible.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.37-48
• /
• 2009

In the theory and the applications of Numerical Linear Algebra, the class of H-matrices is very important. In recent years, many appeared works have proposed iterative criterion for H-matrices. In this paper, we provide a new type of interleaved iterative algorithm, which is always convergent in finite steps for H-matrices and needs fewer iterations than those proposed in the related works, and a corresponding algorithm for general matrix, which eliminates the redundant computations when the given matrix is not an H-matrix. Finally, several numerical examples are presented to show the effectiveness of the proposed algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1039-1045
• /
• 2008

The H.264/AVC video coding standard shows extremely higher coding efficiency, but it causes high computational complexity. Especially, the intra mode decision using the rate-distortion method requires many computations. Thus, the efficient intra mode decision methods have been proposed by decreasing the encoding complexity. In this paper, we propose an efficient intra mode decision algorithm using $4{\times}4$ integer transform coefficients in the conversion of MPEG-2 to H.264 standard. It is shown that the proposed algorithm reduces encoding time and complexity compared to the conventional algorithm, while showing similar PSNR performance.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.62 no.2
• /
• pp.98-102
• /
• 2013

There are so many CCTV in our streets, buildings and public places. Nevertheless, security methods for CCTV are rarely. This paper describes a study on developing a media crypto algorithm for anti-hacking into CCTV. H.264 codec is used to compress the video stream in CCTV systems. HIGHT algorithm provided by KISA is adopted as a crypto algorithm in our development. Other crypto methods except HIGHT could be selected by company's security police. Only some bytes in VCL(Video Coding Layer) of H.264 are encrypted to improve the performance of limited platforms, such as CCTV, WebCam, smartphone. Very fast and light crypto algorithm was developed by our researches.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.4
• /
• pp.362-368
• /
• 2001

We study on the velocity matching algorithm for transfer alignment of inertial navigation system(INS) using a robust H$_2$ filter. We suggest an uncertainty model and a discrete robust H$_2$filter for INS and apply the suggested robust H$_2$ filter to the uncertainty model. The discrete robust H$_2$filter is shown by simulation to have better performance time and accuracy than Kalman filter.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.4
• /
• pp.276-284
• /
• 2000

In this paper, the genetic algorithm is used to design a mixed H₂/ H/sub ∞/ controller Two kinds of controller forms, Youla's form and the general form, are considered to design a mixed H₂/ H/sub ∞/ controller. Efficient searching methods are sought to minimize the given H₂cost function under the H∞ constraint. It is verified by an example that the developed algorithm can provide stable results in the region where unstable results are shown by the conventional gradient method.

• ETRI Journal
• /
• v.44 no.4
• /
• pp.560-572
• /
• 2022

H²RDC (heuristic handover based on RCC-DTSK-C), a heuristic algorithm based on a highly interpretable deep Takagi-Sugeno-Kang fuzzy classifier, is proposed for suppressing the mobile heterogeneous networks problem of frequent handover and handover ping-pong in the multibase-station scenario. This classifier uses a stack structure between subsystems to form a deep classifier before generating a base station (BS) priority sequence during the handover process, and adaptive handover hysteresis is calculated. Simulation results show that H²RDC allows user equipment to switch to the best antenna at the optimal time. In high-BS density load and mobility scenarios, the proposed algorithm's handover success rate is similar to those of classic algorithms such as best connection (BC), self tuning handover algorithm (STHA), and heuristic for handover based on AHP-TOPSIS-FUZZY (H²ATF). Moreover, the handover rate is 83% lower under H²RDC than under BC, whereas the handover ping-pong rate is 76% lower.

• Communications for Statistical Applications and Methods
• /
• v.4 no.1
• /
• pp.229-241
• /
• 1997

We consider discrimination curve and minimum dwell time for Poisson distribution and Poisson-power function distribution. Let the random variable X has Poisson distribution with mean .lambda.. For the hypothesis testing H$\_$0/:.lambda. = t vs. H$\_$1/:.lambda. = d (d$\_$0/ if X.leq.c. Since a critical value c can not be determined to satisfy both types of errors .alpha. and .beta., we considered discrimination curve that gives the maximum d such that it can be discriminated from t for a given .alpha. and .beta.. We also considered an algorithm to compute the minimum dwell time which is needed to discriminate at the given .alpha. and .beta. for the Poisson counts and proved its convergence property. For the Poisson-power function distribution, we reject H$\_$0/ if X.leq..'{c}.. Since a critical value .'{c}. can not be determined to satisfy both .alpha. and .beta., similar to the Poisson case we considered discrimination curve and computation algorithm to find the minimum dwell time for the Poisson-power function distribution. We prosent this algorithm and an example of computation. It is found that the minimum dwell time algorithm fails for the Poisson-power function distribution if the aiming error variance .sigma.$\^$2/$\_$2/ is too large relative to the variance .sigma.$\^$2/$\_$1/ of the Gaussian distribution of intensity. In other words, if .ell. is too small, we can not find the minimum dwell time for a given .alpha. and .beta..

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.438-443
• /
• 2003

In this paper, we propose a control algorithm for two-wheel mobile robot that can move the rider to his or her command and autonomously keep its balance. The control algorithm is based on a mixed $H_2/H_{\infty}$ control scheme. In this control problem the main issue is to move the rider while keeping its balance in the presence of disturbances and parameter uncertainties. The disturbance force caused by uneven road surfaces and the uncertainty due to different rider's heights are considered. To this end we first consider a state feedback controller as a basic framework. Secondly, we obtain the state feedback gain $K_2$ minimizing the $H_2$ norm and the state feedback gain $K_{\infty}$ minimizing the $H_{\infty}$ norm over the whole range of parameter uncertainty. Finally, we select mixed $H_2$/$H_{\infty}$ state feedback controller K as the geometric mean of $K_2$ and $K_{\infty}$. Simulation results show that the mixed $H_2/H_{\infty}$ state feedback controller combines the effects of the optimal $H_2$ state feedback controller and robust $H_{\infty}$ controller state feedback controller efficiently in the presence of disturbance and parameter uncertainty.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.105-112
• /
• 2015

Generally, the optimal solution of assignment problem has been obtained by Hungarian algorithm with O($n^3$) time complexity. This paper proposes more simple algorithm with O($n^2$) time complexity than Hungarian algorithm. The proposed algorithm simply selects minimum cost in each row, and classified into set S, H, and T. Then, the minimum cost is moved from S to T and $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm can be obtain the same optimal solution as well-known algorithms and improve the optimal solution of partial unbalanced assignment problems.