Method of entropy coding of transformation coefficient in image/video coding
A transformation coefficient and entropy coding technology, applied in the field of coefficient entropy coding, can solve the problem of not being perfect, and achieve the effect of improving compression performance, superior compression performance, and beneficial to variable-length coding.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment 1
[0015] Embodiment 1: Suppose the coefficient string after the transformation and quantization scanning of a certain block in video coding is:
[0016] -1-1-3 3-110-40002-100-20001-210000011001
[0017] Extract the position information of the non-zero coefficient and the value information of the non-zero coefficient from the coefficient string, and then perform variable-length encoding on the two kinds of information:
[0018] 1) Location information
[0019] Divide it into several combinations of zero runs (the number of consecutive zeros) and non-zero coefficients (the number of consecutive non-zero coefficients), and arrange them in reverse order from the end of the coefficient string as follows :
[0020] (2,1)(5,2)(3,3)(2,1)(3,2)(1,1)(0,6)
[0021] where each parenthesis represents a combined pair, the first number in the parentheses represents the run of zero, and the second represents the run of the nonzero coefficient following the zero. For example, the end of the ...
Embodiment 2
[0039] Embodiment 2: Let the coefficient string after the transformation and quantization scanning of a certain block in the image coding be:
[0040] 0-1100000010000010000000000-1
[0041] Extract the position information of the non-zero coefficient and the value information of the non-zero coefficient from the coefficient string, and then perform variable-length encoding on the two kinds of information:
[0042] 1) Location information.
[0043] The encoding method of the position information of the non-zero coefficients in the second embodiment is completely the same as the encoding method of the position information in the first embodiment. (This embodiment may also use other existing methods different from those in Embodiment 1 to encode location information.)
[0044] Specifically: First divide it into several combinations of zero run lengths and non-zero coefficient run lengths, and arrange them in reverse order from the end of the coefficient string as follows:
[0...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com