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

가장 최근에 표준화된 H.264/AVC 동영상 압축 부호화 방식은 기존의 방법인 MPEG-2에 비해 우수한 압축 효율을 보이지만, 아직 많은 응용분야에서 MPEG-2가 적용되고 있기 때문에 MPEG-2에서 H.264/AVC로의 변환 기법 개발이 필요하다. 본 논문에서는 이러한 변환을 위해 가장 첫 번째 단계로 볼 수 있는 DCT 계수에서 H.264 변환 계수로의 변환을 위한 효율적인 방법을 제안한다. 이러한 변환은 영상의 압축을 위한 변환기술로 MPEG-2에서는 $8{\times}8$ discrete cosine transform(DCT)를 사용하고 있고, H.264/AVC 표준안에서는 $4{\times}4$ integer transform을 사용하고 있기 때문에 필수적이다. 제안하는 알고리듬에서는 부호화 성능을 유지하면서 효율적으로 계산량을 감소시킬 수 있는 방법을 제시하고 계산량 분석과 모의실험을 통해서 이를 입증한다.

• Journal of applied mathematics & informatics
• /
• 제27권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.

• 한국통신학회논문지
• /
• 제33권12C호
• /
• pp.1039-1045
• /
• 2008

H.264/AVC 비디오 부호화 표준은 높은 부호화 효율을 보여주지만, 그에 따른 부호기의 복잡도가 증가하는 단점이 있다. 특히 비트율-왜곡 최적화 기법을 이용하여 인트라 모드를 결정하는 방법은 부호기의 복잡도를 증가시키는 가장 큰 원인이다. 따라서 부호화 효율을 유지하면서 부호기의 복잡도를 감소시키는 여러 가지 방법이 제안되고 있다. 본 논문에서는 MPEG-2에서 H.264로의 변환 과정에서 $4{\times}4$ 정수 변환 계수를 이용하여 효율적으로 인트라 예측 모드를 결정하는 방법을 제안한다. 제안하는 알고리듬을 적용한 모의실험 결과는 영상의 부호화 성능을 유지하면서 복잡도 및 부호화 수행 시간을 감소시킬 수 있었다.

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

• 제어로봇시스템학회논문지
• /
• 제7권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.

• 제어로봇시스템학회논문지
• /
• 제6권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
• /
• 제44권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
• /
• 제4권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년도 ICCAS
• /
• 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.

• 한국컴퓨터정보학회논문지
• /
• 제20권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.