• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.34-44
• /
• 2008

In this paper, a new rate-distortion estimation method is proposed for fast rate-distortion optimized(RDO) mode decision in H.264 encoder. A bit-rate and distortion should be calculated by encoding and reconstruction of each macroblock mode in order to select the optimal RDO mode. To reduce the computations for getting them, a bit-rate and distortion is efficiently estimated in DCT domain. Simulation results show that the proposed method achieves computational saving about 81% of RDO mode decision and saves about 26% of total encoding time without noticeable degradation in coding performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.57-61
• /
• 2015

This paper proposes a fast intra prediction algorithm for the High Efficiency Video Coding (HEVC). HEVC has 35 modes, such as DC mode, Planar mode, and 33 angular modes for the intra-prediction. To reduce the complexity and to support fast decision for intra prediction, this paper proposes a hierarchical mode decision method (HMD). The proposed HMD mainly focuses on how to reduce the number of prediction modes. The experimental results show that the proposed HMD can reduce the encoding time about 39.17% with little BDBR loss. On average, the proposed HMD can achieve the encoding time saving e about 14.13 ~ 19.37% compared to that of the existing algorithms with slightly increasing 0.01 ~ 0.42% BDBR.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.54-62
• /
• 2007

In this paper, we significantly reduces the amount of computation for intra 16$\times$16 mode decision in H.264 by applying the fast algorithm, which obtains the transformed prediction residual with fewer computations. By extending the existing intra 4$\times$4 mode decision, we propose the new algorithm for fast intra 16$\times$16 mode decision. The proposed algorithm uses partial transform coefficients which consist of one DC and three adjacent AC coefficients after 4$\times$4 transform in the intra 16$\times$16 mode decision. Theoretical analysis and experimental results show that the proposed algorithm can reduce computations up to 50% in the intra 16$\times$16 mode decision process with unnoticeable degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1144-1152
• /
• 2005

Intra prediction coding is one of the many coding-efficiency oriented tools of H.264/AVC, but it requires high computational complexity. Many fast intra coding algorithms have been proposed to reduce the computational complexity of intra prediction. While most of them have been focused on the mode decision methods themselves, we propose a fast algorithm in which new intra modes are substituted for the conventional intra modes so that the number of intra modes can be reduced. The simulation results show that the proposed method could reduce the encoding time of the overall sequence by $49\%$ without any noticeable degradation of the coding efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.193-202
• /
• 2010

In this paper, we propose a fast algorithm that can reduce the complexity for inter mode decision of the H.264 encoder. The main idea consists of two techniques. The first one is the technique early terminating mode decision process. We focused on the skip and $16{\times}16$ mode because these modes occupies the largest portion in most of sequences. The second one is the technique skipping unnecessary $8{\times}8$ modes. The time consumption caused by the $8{\times}8$ mode is very considerable. Therefore if we can extract the unnecessary $8{\times}8$ mode calculation well, a large amount of time can be saved in total encoding process. The experimental results show that the proposed algorithm can achieve up to 43% speed up ratio with insignificant PSNR loss. The increase of total bits encoded is also not noticeable.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.793-797
• /
• 2008

To achieve flexible visual contents adaptation for multimedia communications, the ISO/IEC MPEG & ITU-T VCEG form the JVT to develop an SVC amendment for the H.264/AVC standard. JVT uses inter-layer prediction that can improve the rate-distortion efficiency of the enhancement layer. But inter-layer prediction causes computational complexity to be increased. In this paper, we propose a fast mode decision for inter frame coding. It makes use of the correlation between optimized prediction mode and its RD cost. Experimental results show that the proposed schemes save up to 38% of encoding time with a negligible coding loss and bit-rate increase.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.1-11
• /
• 2007

H.264/AVC uses variable block sizes to achieve significant coding gain. It has 7 different coding modes having different motion compensation block sizes in Inter slice, and 2 different intra prediction modes in Intra slice. This fine-tuned new coding feature has achieved far more significant coding gain compared with previous video coding standards. However, extremely high computational complexity is required when rate-distortion optimization (RDO) algorithm is used. This computational complexity is a major problem in implementing real-time H.264/AVC encoder on computationally constrained devices. Therefore, there is a clear need for complexity reduction algorithm of H.264/AVC such as fast mode decision. In this paper, we propose a fast mode decision with early $P8\times8$ mode rejection based on block size activity using large block history map (LBHM). Simulation results show that without any meaningful degradation, the proposed method reduces whole encoding time on average by 53%. Also the hybrid usage of the proposed method and the early SKIP mode decision in H.264/AVC reference model reduces whole encoding time by 63% on average.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.141-142
• /
• 2015

본 논문에서는 HEVC(High Efficiency Video Coding)을 위한 고속 부호화 알고리즘을 제안한다. 제안 방법은 HEVC 의 화면내 부호화 과정에서 주변 부호화 모드 정보인 MPM(Most Probable Mode)과 RMD(Rough Mode Decision) 과정의 결과로 얻어지는 후보 모드들의 상관관계를 이용하여 높은 계산 복잡도를 가지는 RDO(Rate-Distortion Optimization) 과정이 고려하는 후보의 개수를 줄여 전체 부호화기의 부호화 복잡도를 낮춘다. 실험 결과에서는 제안 방법이 약 0.29% BD-rate 의 부호화 손실만으로 20.43%의 부호화 복잡도를 감소시켰음을 보인다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.71-74
• /
• 2013

차세대 동영상 표준 코덱인 High Efficiency Video Coding(HEVC)은 기존의 AVC/H.264 보다 동일 화질 대비 최대 약 2배의 압축 성능을 보여준다. 이러한 HEVC의 성능을 얻기 위하여 복잡한 연산이 많은 기법이 도입되었고 이로 인하여 HEVC의 시간 복잡도는 AVC/H.264보다 더욱 증가하였다. HEVC의 시간 복잡도를 줄이기 위해서 다양한 고속 알고리즘이 논의되고 있고 인트라 예측 모드에서의 고속 알고리즘 연구 또한 많은 연구가 이루어지고 있다. 본 논문에서는 인트라 예측 모드 결정과정에서 HEVC에 구현된 Rough mode decision(RMD)와 Most probable mode(MPM)의 결과를 활용하여 고속화된 최종예측 모드 결정 방법을 제안한다. 실험 결과, HM 10.0의 All Intra 환경을 기준으로 BD-rate에서 약 0.9%의 손실과 함께 평균 24%의 속도 향상을 얻을 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.275-285
• /
• 2003

The now video coding standard H.264 employs variable block size motion compensation, multiple references, and quarter-pel motion vector accuracy. These techniques are key features to accomplish higher coding gain, however, at the same time main factors that increase overall computational complexity. Therefore, in order to apply H.264 to many applications, key techniques are requested to improve their speed. For this reason, we propose a fast motion estimation which is suited for variable block size motion communication. In addition, we propose a fast mode decision method to choose the best mode at early stage. Experimental results show the reduction of the number of SAT SATD calculations by a factor of 4.5 and 2.6 times respectively, when we compare the proposed fast motion estimation and the conventional MVFAS $T^{［8-10］}$. Besides, the number of RDcost computations is reduced by about 45%. Therefore, the proposed methods reduces significantly its computational complexity without noticeable coding loss.