• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.325-343
• /
• 2012

This paper proposes the coding method to predict the split structure of LCU in the current frame on the basis of the reference frame or temporally-previous frame. HEVC encoder determines split structure according to image characteristics in LCU which is an basic element of CU. The split structure of the current LCU is very similar to the split structure of collocated LCU in the reference frame or temporally-previous frame. Thus, this paper proposes the method to reduce the encoder computational complexity by predicting split structure of the current LCU on the basis of that of collocated LCU in the reference frame or temporally-previous frame. And it also proposes the method to reduce the BD-Bitrate by coding after the prediction of the CU split information. The simulation results of changing only encoder showed that the mean of encoder computational complexity was lower by 21.3%, the decoder computational complexity was negligible change and the BD-Bitrate increase by the maximum of 0.6%. Also, the method changing encoder, bitstream, and decoder improves the mean of encoder computational complexity was lower by 22%, the decoder computational complexity was negligible change and the BD-Bitrate is improved to the maximum of 0.3%. When compared with the conventional method, indicating that the proposed method is superior.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.305-312
• /
• 2020

As a demand for a new video coding standard having higher coding efficiency than the existing standards is growing, recently, MPEG and VCEG has been developing and standardizing the next-generation video coding project, named Versatile Video Coding (VVC). Many inter prediction techniques have been introduced to increase the coding efficiency, and among them, an adaptive motion vector resolution (AMVR) technique has contributed on increasing the efficiency of VVC. However, the best motion vector can only be determined by computing many rate-distortion costs, thereby increasing encoding complexity. It is necessary to reduce the complexity for real-time video broadcasting and streaming services, but it is yet an open research topic to reduce the complexity of AMVR. Therefore, in this paper, an efficient technique is proposed, which reduces the encoding complexity of AMVR. For that, the proposed method exploits a special VVC tree structure (i.e., multi-type tree structure) to accelerate the decision process of AMVR. Experiment results show that the proposed decision method reduces the encoding complexity of VVC test model by 10% with a negligible loss of coding efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.706-715
• /
• 2005

In this paper, we present a transcoding algorithm for converting an MPEG-2 video bitstream to an H.264 bitstream. The proposed transcoder consists of two parts. One is MPEG2 decoding part and the other is H.264 encoding part Because our algorithm is for transcoding in the spatial domain, MPEG2 decoding part carries out full decoding of MPEG2 bitstream. While, because macroblock type and coded block pattern in MPEG2 are significantly related to macroblock mode in H.264, macroblock mode is selected adaptively according to macroblock type and coded block pattern in H.264 decoding part. Furthermore, motion vector is also used as side-information for 16$\ctimes$16 macroblock mode. Simulation results show that the proposed transcoder yields high reduction of total transcoding time at comparable PSNR.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.94-104
• /
• 1997

This paper presents a new vertex-based binary shape coding scheme using one-dimensional vertex selection/encoding and vertex reordering. In compared with the conventional object-adaptive vertex encoding(OA VEL the extracted vertices are, firstly, classified into one-dimensional(lD) vertices and two-dimensional (2D) vertices in the proposed method. For lD vertices, new coding method proposed in this paper is performed. For 2D vertices, the vertex reordering and OA VE are carried out. Experimental results show that the proposed vertex-based coding scheme red.uces coding bits up to 12 % compared with the conventional one and its coding gain depends on the characteristics of contour.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.232-235
• /
• 2010

This paper proposes an efficient depth-map coding method. The adaptive block-based depth-map coding method decides the number of bit planes to be encoded according to the quantization parameters to obtain the desired bit rates. So, the depth-map coding using the block-based decision of the bit-plane to be encoded proposes to free from the constraint of the quantization parameters. Simulation results show that the proposed method, in comparison with the adaptive block-based depth-map coding method, improves the average BD-rate savings by 3.5% and the average BD-PSNR gains by 0.25dB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.681-686
• /
• 2009

In H.264/Ave, an intra prediction added to the P-frame coding slightly improves both of image quality and bit rate, but greatly increases an amount of computation. In order to reduce the increase in computation, this paper proposes an image contents based intra prediction coding using characteristics that the best intra block mode depends on the image content of a macro block. The proposed algorithm estimates the image content with image complexity and the best inter block mode, and then selects or excludes a intra block mode on the basis of it. The simulation results show that the proposed algorithm reduces average O.OldB in image quality, and increases average 0.38% in the bit rate, but reduces average 37.02% in computation time compared with the conventional algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.560-563
• /
• 2015

동영상 부호화 표준, HEVC(High Efficiency Video Coding)는 부호화 성능을 극대화하기 위해 총 35 개의 화면내 예측 모드를 사용한다. 화면내 예측 모드는 각도를 가진 모드와 각도가 없는 모드로 구성된다. 부호화 성능을 높이기 위해 사용한 다수의 화면내 예측 모드 방법은 HEVC 부호화기의 복잡도를 증대 시키는데 큰 역할을 하게 된다. 본 논문은 총 35 개의 화면내 예측 모드 중 현재 블록의 주변 블록 정보로부터 얻을 수 있는 예측 모드들 및 각도를 대표하는 예측 모드들을 선별적으로 추려서 후보 예측 모드를 결정하고, 평가 과정을 거쳐 해당 후보 모드 중에서 최종 화면내 예측 모드를 결정한다. 본 제안 방법은 35 개의 전체 화면내 예측 모드 중 소수의 후보 모드만을 평가함으로써 HEVC 표준의 화면내 예측 및 부호화 과정의 복잡도를 감소시키려 한다. 제안 방법을 다양한 테스트 시퀀스에 적용한 결과, 35 개 화면내 예측 모드를 전부 사용한 경우와 비교하여 1.1%의 BD-rates 이 증가하면서 18.7%의 부호화기 복잡도를 감소시킬 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.492-500
• /
• 2012

In this paper, improved contour region coding method is proposed to accomplish better depth map coding performance. First of all, in order to use correlation between color video and depth map, a structure in SVC is applied to 3DVC. This can reduce bit-rate of the depth map while supporting the video to be transferred via various collection of network. As the depth map is mainly used to synthesize videos from different views, corrupted contour region can damage the overall quality of video. We hereby adapt a new differential quantization method when separating the contour region. The experimental results show that the proposed method can improve video quality by 0.06~0.5dB which translate the bit rate saving by 0.1~1.15%, when compared to the reference software.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8C
• /
• pp.591-597
• /
• 2008

In this paper, we present a improved rate distortion optimization (RDO) for H.264 intra coding. By using new mode decision criteria pass for $I4{\times}4$ in company with the original RDO, the proposed method can achieve the better coding efficiency comparing with the original RDO. Our experimental results show that the proposed algorithm can archive about $0.64{\sim}1.6578%$ bit rate decrease at the same PSNR and $0.049{\sim}0.101dB$ PSNR increase at the same bit rate.

• 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.