1 / 41

Present by fakewen

Video Compression Using Nested Quadtree Structures, Leaf Merging, and Improved Techniques for Motion Representation and Entropy Coding. Present by fakewen. introduction. Video Compression Using Nested Quadtree Structures.

sammy
Download Presentation

Present by fakewen

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Video Compression Using Nested QuadtreeStructures, Leaf Merging, and Improved Techniquesfor Motion Representation and Entropy Coding Present by fakewen

  2. introduction

  3. Video Compression Using Nested Quadtree Structures • A video coding architecture is described that is based on nested and pre-configurable quadtree structures for flexible and signal-adaptive picture partitioning. • partitioning concept is to provide a high degree of adaptability for both temporal and spatial prediction

  4. Leaf merging • leaf merging mechanism is included in order to prevent excessive partitioning of a picture into prediction blocks and to reduce the amount of bits for signaling the prediction signal.

  5. Improved Techniquesfor Motion Representation • For fractional-sample motion-compensated prediction, a fixed-point implementation of the maximal-order-minimum-support algorithm is presented that uses a combination of infinite impulse response and FIR filtering.

  6. Entropy Coding • Entropy coding utilizes the concept of probability interval partitioning entropy codes that offers new ways for parallelization and enhanced throughput.

  7. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  8. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  9. Overview of the Video Coding Scheme • Wide-range variable block-size prediction • Nested wide-range variable block-size residual coding • Merging of prediction blocks • Fractional-sample MOMS interpolation • Adaptive in-loop filter • PIPE coding

  10. Wide-range variable block-size prediction • the size of prediction blocks can be adaptively chosen by using a quadtree-based partitioning. • Maximum (Nmax ) and minimum (Nmin ) admissible block edge length can be specified as a side information. Nmax = 64 and Nmin = 4.

  11. Nested wide-range variable block-size residual coding • the block size used for discrete cosine transform (DCT)-based residual coding is adapted to the characteristicsof the residual signal by using a nested quadtree-basedpartitioning of the corresponding prediction block.

  12. Merging of prediction blocks • in order to reduce theside information required for signaling the predictionparameters, neighboring blocks can be merged into oneregion that is assigned only a single set of predictionparameters.

  13. Fractional-sample MOMS interpolation • Interpolationof fractional-sample positions for motion-compensatedprediction is based on a fixed-point implementationof the maximal-order-minimum-support (MOMS) algorithm using an infinite impulse response (IIR)/FIR filter

  14. Adaptive in-loop filter • in addition to the deblockingfilter, a separable 2-D Wiener filter is applied withinthe coding loop. The filter is adaptively applied toselected regions indicated by the use of quadtree-basedpartitioning

  15. PIPE coding • the novel probability interval partitioningentropy (PIPE) coding scheme provides the coding efficiency and probability modeling capability of arithmeticcoding at the complexity level of Huffman coding.

  16. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  17. Picture Partitioning for Prediction andResidual Coding • The concept of a macroblock as the basic processing unitin standardized video coding is generalized to what we calla coding tree block (CTB).

  18. Dividingeach picture into CTBs and further recursively subdividingeach CTB into square blocks of variable size allows to partitiona given picture of a video signal in such a way that boththe block sizes and the block coding parameters such asprediction or residual coding modes will be adapted to thespecific characteristics of the signal at hand.

  19. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  20. Motion-Compensated Prediction • Fractional-Sample Interpolation Using MOMS • Generalized interpolation using MOMS • Choice of MOMS basis functions • Implementation aspects of cubic and quintic O-MOMS • Interleaved Motion-Vector Prediction • Merging of Motion-Compensated Predicted Blocks

  21. Interleaved Motion-Vector Prediction • In order to reduce the bit rate required for transmittingthe motion vectors • first step, the vertical motion vector component is predicted using conventional median prediction • Then, only those motion vectors of neighboring blocks for which the absolute difference between their vertical component and the vertical component for the current motion vector is minimized are used for the prediction of the horizontal motion-vector component

  22. Merging of Motion-Compensated Predicted Blocks • However, in general, quadtree-based block partitioning mayresult in an over-segmentation due to the fact that, withoutany further provision, at each interior node of a quadtree, foursubblocksare generated while merging of blocks is possibleonly by pruning complete branches consisting of at least fourchild nodes in the parent-child relationship within a quadtree.

  23. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  24. Spatial Intra Prediction • For all prediction block sizes, eight directional intra-prediction modes and one additional averaging (DC) mode areavailable.

  25. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  26. Variable Block-Size Spatial Transforms and Quantization • each prediction blockcan be further subdivided for the purpose of transform codingwith the subdivision being determined by the correspondingRQT. Transform block sizes in the range of 4 × 4 to 64 × 64 • The transform kernel for each supportedtransform block size is given by a separable integer approximation of the 2-D type-II discrete cosine transform of thecorresponding block size

  27. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  28. Internal Bit Depth Increase • The internal bit depth d i for generating the prediction signal • bit depth do of luma and chroma samples of the original input video signal. • d s = d i − d o • increased internal bit depth d I Original input:do do:in-loop filter di bit for prediction

  29. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  30. In-Loop Filtering • Our proposed video coding scheme utilizes two types of cascaded in-loop filters: • Deblocking filter • The filtering operations are applied to samples at block boundaries of the reconstructed signal • Quadtree-Based Separable 2-D Wiener Filter • The quadtree-based Wiener filter as part of our proposed video coding approach, is designed as a separable filter with the advantage of providing a better tradeoff in computational cost versus rate-distortion (R-D) performance compared to nonseparableWiener filters

  31. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  32. Entropy Coding • Probability Interval Partitioning Entropy Coding • PIPE Coding Using Arithmetic Codes • PIPE Coding Using V2V Codes

  33. Application of a Fast Optimal Tree Pruning Algorithm • G-BFOS algorithm • Mode Decision Process • Residual Quadtree Pruning Process

  34. outline • Overview of the Video Coding Scheme • Picture Partitioning for Prediction and Residual Coding • Motion-Compensated Prediction • Spatial Intra Prediction • Variable Block-Size Spatial Transforms and Quantization • Internal Bit Depth Increase • In-Loop Filtering • Entropy Coding • Encoder Control • Coding Conditions and Results

  35. we used for the generation • of our submitted CS 1 bitstreams a hierarchical B picture • coding structure [37] with 4 layers and a corresponding intra • frame period. For CS 2, a structural delay is not allowed • and random access capabilities are not required

  36. fixed CTB size of • 64 × 64 (for luma) and a maximum prediction quadtree depth • of D = 4.

  37. Coding Conditions and Results

More Related