TU tree structure decision algorithm based on HEVC video coding

A tree structure and video coding technology, applied in the field of video coding, can solve the problems of increased hardware cost, high computational complexity, and low hardware performance, and achieve the effect of reducing complexity, reducing complexity, and improving performance

Active Publication Date: 2017-10-20
芯原微电子(北京)有限公司 +2
View PDF6 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] The purpose of the present invention is to provide a TU tree structure selection algorithm based on HEVC video coding, which solves the problems o

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • TU tree structure decision algorithm based on HEVC video coding
  • TU tree structure decision algorithm based on HEVC video coding
  • TU tree structure decision algorithm based on HEVC video coding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0045] In HEVC video coding, the TU tree structure is a coding tool newly proposed by the HEVC video standard to improve coding efficiency. The TU sizes are 4x4, 8x8, 16x16, and 32x32. Blocks are used for rdcost (rate-distortion) calculations. TU blocks include 64 4x4 blocks, 16 8x8 blocks, 4 16x16 blocks, and 1 32x32 block, totaling 85 blocks.

[0046] Such as figure 1 As shown, a TU tree structure selection algorithm based on HEVC video coding described in this embodiment includes the following steps:

[0047] (a) Transform the residual residual of TU to obtain the coefficient C0 before quantization;

[0048] (b) Quantize the C0 obtained in step (a) to obtain the coefficient C1;

[0049] (c) Use a fixed binary Bin and bits compression ratio to obtain the estimated value bits_estimate of the number of bits;

[0050] (d) Dequantize the C1 obtained in step (b) to obtain the coefficient C2;

[0051] (e) Calculate the distortion value distortion of the TU: distortion=Sum(C2-C...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a TU tree structure decision algorithm based on HEVC video coding, comprising the following steps of (a) transforming TU residuals to obtain a coefficient C0 before quantization; (b) quantifying C0 obtained in step (a) to obtain a coefficient C1; (c) using a fixed binary Bin and a bits compression ratio to obtain an estimate value of the number of bits; (d) dequantizing C1 obtained in step (b) to obtain a coefficient C2; (e) calculating a distortion value of the TU; (f) calculating the rate distortion cost after the TU residual coding; (g) calculating the rate distortion cost of the TU residual without any coding; and (h) comparing the rate distortion cost obtained in the step (g) with the rate distortion cost obtained in the step (f), and taking the rate distortion cost of a smaller value as the best price of this TU. The invention adopts the above algorithm, which can reduce the complexity of the calculation, reduce the hardware overhead, and improve the hardware performance.

Description

technical field [0001] The invention relates to the field of video coding, in particular to a TU tree structure selection algorithm based on HEVC video coding. Background technique [0002] In HEVC video coding, the TU tree structure is a coding tool newly proposed by the HEVC video standard to improve coding efficiency. The TU size is 4x4, 8x8, 16x16, 32x32, which plays a great role in improving coding efficiency, but its selection algorithm requires The extremely high computational complexity makes the hardware overhead larger and increases the hardware cost. [0003] For example, HM is the HEVC reference encoder and algorithm implementation organized by JCTVC. The TU selection process adopted by it is as follows: [0004] For all possible TU blocks (64 4x4 blocks, 16 8x8 blocks, 4 16x16 blocks, 1 32x32 block), do the following calculation process: [0005] 1. Transform (Transform) -> Quantization (Quant) -> Inverse Quantization (Dequant) -> Inverse Transform (...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04N19/156H04N19/34H04N19/423H04N19/96H04N19/70
CPCH04N19/156H04N19/34H04N19/423H04N19/70H04N19/96
Inventor 栗可
Owner 芯原微电子(北京)有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap