Adaptive GOP size control in H.265/AVC encoding based on Scene Change Detection

Alfonso, Daniele; Biffi, B.; Pezzoni, Luca

doi:10.1109/norsig.2006.275283

Cited by 14 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It bears some resemblances with the positioning of reference frames in video sequences. This has been studied for both standard [13], [14] and distributed video coding schemes [15], [16]. The reference frame positions are adjusted based on the content of video sequences.…”

Section: Introductionmentioning

confidence: 99%

Reference View Selection in DIBR-Based Multiview Coding

Maugey

Petrazzuoli

Frossard

et al. 2016

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

Abstract-Augmented reality, interactive navigation in 3D scenes, multiview video and other emerging multimedia applications require large sets of images hence larger data volumes and increased resources compared to traditional video services. The significant increase of the number of images in multiview systems leads to new challenging problems in data representation and data transmission to provide high quality of experience on resource-constrained environments. In order to reduce the size of the data, different multi view video compression strategies have been proposed recently. Most of them use the concept of reference or key views that are used to estimate other images when there is high correlation in the dataset. In such coding schemes, the two following questions become fundamental: i) how many reference views have to be chosen for keeping a good reconstruction quality under coding cost constraints? ii) where to place these key views in the multiview dataset? As these questions are largely overlooked in the literature, we study the reference view selection problem and propose an algorithm for the optimal selection of reference views in multiview coding systems. Based on a novel metric that measures the similarity between the views, we formulate an optimization problem for the positioning of the reference views such that both the distortion of the view reconstruction and the coding rate cost are minimized. We solve this new problem with a shortest path algorithm that determines both the optimal number of reference views and their positions in the image set. We experimentally validate our solution in a practical multiview distributed coding system and in the standardized 3D-HEVC multi view coding scheme. We show that considering the 3D scene geometry in the reference view positioning problem brings significant rate-distortion improvements and outperforms traditional coding strategy that simply selects key frames based on the distance between cameras.Index Terms-Multiview distributed coding, key view positioning, inter-view correlation, view synthesis, multiview image coding

show abstract

Section: Introductionmentioning

confidence: 99%

Reference View Selection in DIBR-Based Multiview Coding

Maugey

Petrazzuoli

Frossard

et al. 2016

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

show abstract

“…A number of algorithms [4,[11][12][13][14] are proposed in the literature for AGOP and SCD. Dimou et al [11] used dynamic threshold based on the mean and standard deviation of the previous frames for SCD.…”

Section: Introductionmentioning

confidence: 99%

“…Alfonso et al [12] used ME & MC to find the SCD. To avoid repetitive scene change, they imposed lower limit of scene change as four frames.…”

Section: Introductionmentioning

confidence: 99%

Video coding with dynamic background

Paul

Wang

Lau

et al. 2013

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

Motion estimation (ME) and motion compensation (MC) using variable block size, sub-pixel search, and multiple reference frames (MRFs) are the major reasons for improved coding performance of the H.264 video coding standard over other contemporary coding standards. The concept of MRFs is suitable for repetitive motion, uncovered background, non-integer pixel displacement, lighting change, etc. The requirement of index codes of the reference frames, computational time in ME & MC, and memory buffer for coded frames limits the number of reference frames used in practical applications. In typical video sequences, the previous frame is used as a reference frame with 68-92% of cases. In this article, we propose a new video coding method using a reference frame [i.e., the most common frame in scene (McFIS)] generated by dynamic background modeling. McFIS is more effective in terms of rate-distortion and computational time performance compared to the MRFs techniques. It has also inherent capability of scene change detection (SCD) for adaptive group of picture (GOP) size determination. As a result, we integrate SCD (for GOP determination) with reference frame generation. The experimental results show that the proposed coding scheme outperforms the H.264 video coding with five reference frames and the two relevant state-of-the-art algorithms by 0.5-2.0 dB with less computational time.

show abstract

“…Recently, many papers about adaptive group of picture (AGOP) structure coding schemes are presented [5][6][7][8][9][10][11]. In early years, there are many papers about AGOP coding schemes presented to improve coding performance for MPEG system [5][6][7][8].…”

Section: Introductionmentioning

confidence: 99%

“…The high computation is needed to perform two-pass motion estimations for predictive frame coding. Recently, a systematic investigation of AGOP structure coding schemes for H.264/AVC was conducted in [9][10][11]. The method [9] proposed a quantization decision rule for intra-frame with the entropy of the block histogram (EBH) method when the sequence has rapid motion or scene change.…”

Section: Introductionmentioning

confidence: 99%

High-performance adaptive group-of-picture rate control for H.264/AVC

Hsia

Wang

2009

SIViP

View full text Add to dashboard Cite

In this paper, an adaptive group-of-picture (AGOP) control is proposed to improve the coding performance for the H.264/AVC system. The efficient algorithm is developed to find the quantized parameter with temporal correlation between inter-frames. According to the estimated parameters, the GOP coding type can be adaptively selected as AGOP or BGOP (basic GOP). The rate control with some decision functions is proposed to modify the quantization parameter (QP). The coding rate can accurately meet the target rate with adjusting QP value dynamically, while keeping low computational overhead. Simulation results show that the proposed algorithm can improve PSNR by about 1 dB in average compared with the original H.264/AVC reference software (JM12.4), from various sequences testing.

show abstract

Adaptive GOP size control in H.265/AVC encoding based on Scene Change Detection

Cited by 14 publications

References 9 publications

Reference View Selection in DIBR-Based Multiview Coding

Reference View Selection in DIBR-Based Multiview Coding

Video coding with dynamic background

High-performance adaptive group-of-picture rate control for H.264/AVC

Contact Info

Product

Resources

About