• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.463-473
• /
• 2005

In this paper, we propose Adaptive GOP Structure to enhance the coding performance of scalable video coding in JVT. Adaptive GOP Structure considers temporal variances of video sequence. In general, SVC encodes a video sequence with fixed GOP size. The coding performance is varying according to the temporal variance of a video sequence. Thus, Adaptive GOP Structure method is proposed. It selects GOP size adaptively by considering temporal variance of video sequence. In the experiments, the propose method showed the enhanced coding performance in most sequences. The PSNR gain of Crew sequence is up to 0.63 dB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2449-2463
• /
• 2014

Hierarchical B-frame coding was introduced into H.264/SVC to provide temporal scalability and improve coding performance. A content analysis-based adaptive group of picture structure (AGS) can further improve the coding efficiency, but damages the inter-frame correlation and temporal scalability of hierarchical B-frame to different degrees. In this paper, we propose a group of pictures (GOP) adaptation coding method based on the positions of video cuts. First, the cut positions are accurately detected by the combination of motion coherence (MC) and mutual information (MI); then the GOP is adaptively and proportionately set by the analysis of MC in one scene. In addition, we propose a binary tree algorithm to achieve the temporal scalability of any size of GOP. The results for test sequences and real videos show that the proposed method reduces the bit rate by up to about 15%, achieves a performance gain of about 0.28-1.67 dB over a fixed GOP, and has the advantages of better transmission resilience and video summaries.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.470-474
• /
• 2005

There are many suggestion of methods which get good quality images by controling the GOP structure. But the existing algorithm should have not good to deal the real time adaptive processing determine the GOP structure because which check the fixed quantity of image in advance and require high capacity of frame memories and have delay time by increasing calculation quantity. This paper propose the algorithm which adapt the real time by the basic of macro block. We show the good simulation results using the proposed GOP structure based on macro block.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.129-132
• /
• 2003

Fixed GOP allocation in MPEG-2 cannot cope with scene change and amount of motion, which results in degradation picture quality. By finding suitable N and M and allocating dynamic GOP, the improvement of picture quality can be achieved. In this paper, N and M are determined by scene change detection and estimation of amount of motion using color histogram per each macroblock. The simulation results show that the average PSNR is improved, especially around the shot boundaries.

• Journal of Broadcast Engineering
• /
• v.21 no.3
• /
• pp.349-356
• /
• 2016

In this paper, we propose an efficient assignment method that assigns quantization parameter (QP) in accordance with group of picture (GOP) structure given in HEVC encoder. Each video frames can have difference QP values based on given GOP configuration for HEVC encoding. Particularly, for important frames we can assign low QP values, and vice versa. However, there has not been thorough investigation on efficient QP assignment method by far. Even in HEVC reference software encoder, only monotonic QP assignment method is employed. Thus, the proposed method assign adaptive QP values to each GOP so that temporal dynamic activity between GOPs can be exploited. Through the experiment, the proposed method showed a 7.3% gain of compression performance in terms of BD-rate compared to HEVC test model (HM) in low-delay configuration, and outperformed the existing QP assignment study on average.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.258-264
• /
• 2004

This paper propose a method that GOP structure based on the picture complexity change realtime adaptive without pre-analysis or time delay. Proposed algorithm calculates the complexity of pictures at first, and the ratio of the complexity( X$\sub$p/ /X$\sub$i/) between P picture and I picture is calculated. The suitable M value for the three picture select by comparing with predetermined threshold. Used bit and vbv_delay the value of GOP is calculated according to selected M. Experimental results show that the prediction error is reduce than the fixed GOP structure. Since the complexity distribution of the sequence is different, applied limits of threshold value is changed, also.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2675-2677
• /
• 2001

MPEG에서 GOP의 길이가 고정되어 있다 하더라도 부호화 효율 측면에서 최상의 화질을 제공하지는 않는다. GOP의 길이 N은 약 0.5초의 랜덤 접근을 위해 15나 12로 고정되고 있으며 P-picture의 구간 M은 GOP 구조를 정의하는 중요한 변수중의 하나이다. 이것은 원 영상의 특성과는 관계없는 부호화 수행으로 M=3은 영상 시퀸스에 널리 사용되고 있다. 그러나 P-picture의 구간 M=3은 모든 영상열에 좋은 화질을 제공하는 것은 아니다. 우리는 실시간 MPEG-2 비디오코딩을 위한 적응적 GOP구조 선택 방법을 제안한다. 이 방법은 single-pass 부호화를 갖는 코딩 복잡도를 기반으로 하여 3개의 picture 구간에서 P-picture의 구간 M을 동적으로 적응시킨다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.140-142
• /
• 2020

본 논문에서는 심층적 강화학습 기반 GOP (Group of Picture) 크기를 선택하여 HEVC/H.265의 인코더를 제어하는 방법을 제안한다. 기존 방법에서는 현재 비디오 신호를 부호화 하는 과정에서 이미 부호화한 정보를 사용해야하는 부호화 의존성에 관한 문제가 있었다. 제안 방법은 강화학습 방식을 도입하여 이러한 문제를 극복하고 입력 비디오의 시간적 상관도에 따라 GOP의 크기를 적응적으로 선택하여 부호화 한다. 본 논문에서는 GOP 선택을 위한 강화학습 환경을 새롭게 정의하고 부호화 성능에 따른 보상을 부여하는 방식으로 학습을 수행한다. 제안된 적응적 GOP 선택에 따라 인코더 제어 시, 부호화 방법의 부호화 효율이 -6.07% BD-rate 향상된 실험 결과를 보이며 본 방법의 우수성을 입증한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.1957-1964
• /
• 2010

In Video coding, the first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP for the first frame of GOP affects the first frame as well as the following frames. Traditionally, the initial QP of a GOP is determined by the initial QP of the previous GOP and the average QP of the inter mode frames. In case of JM, the initial QP of a GOP is adjusted as the initial QP being less than the average QP of inter mode frames by two. However, this method is not suitable for the low bit rate video coding. In this paper, the linear relationship between the optimal QP and the ratio of the PSNR of the first frame and the average PSNR of the inter mode frames is first investigated and the linear model is proposed based on the results of the investigation. The proposed model calculate the optimal initial QP using the encoding results of the previous GOP. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JM algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.9
• /
• pp.1009-1018
• /
• 2015

In video coding, the first frame of a GOP is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP for the first frame encoding affects the first frame as well as the following frames. To determine the initial QP that maximizes the PSNR of a GOP, several algorithms which uses the ratio of the PSNR of the I frame and the PSNR of P frames of a GOP have been proposed. In this paper, we propose a new traffic model that can be used to determine the optimal initial QP simply and exactly in algorithms that use the PSNR ratio. We first analyze the characteristics of the PSNR ratio of I and P frames and the PSNR of a GOP, and then propose a new traffic model which can represent the characteristics and determine the optimal intial QP. It is shown by experimental results that the initial QP determination method with the proposed model can predict an optimal initial QP whose difference from the optimal value is less than 2. The proposed scheme can also generate the PSNR performance better than that of the existing JVT algorithm.