Coefficient Coding with Reversed Last-Coefficient Position
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face inefficiencies and increased overhead when handling high bit depth, high quality, and high bitrate video, which affects coding speed and throughput.
Innovation Solution
A method for coefficient coding that includes determining a last-significant-coefficient position-reverse flag and encoding/decoding coefficients based on a preset scanning order, using coordinate information to optimize the coding process for high bit depth, high quality, and high bitrate video.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If existing video coding solutions are used for triple-high video (high bit depth, high quality, high bitrate), then video quality and bit depth are improved, but coding overhead increases and coding speed decreases
Solution Approach 1:
The patent changes the parameter representation by introducing a reversed coordinate system for the last significant coefficient position. Instead of encoding the absolute position, the patent encodes the distance from the lower-right corner, which changes the statistical distribution and allows for more efficient coding under triple-high conditions
Solution Approach 2:
The patent inverts the traditional coordinate reference system by measuring positions from the lower-right corner instead of the upper-left corner. This inversion is particularly effective for triple-high video where significant coefficients tend to be distributed differently, reducing the average coded value and overhead
2Manufacturing precision
If existing video coding solutions are used for triple-high video (high bit depth, high quality, high bitrate), then video quality and bit depth are improved, but coding overhead increases
Solution Approach 1:
The patent transforms the parameter encoding by using reversed coordinates, which changes the magnitude and distribution of the values that need to be coded. This reduces the average number of bits required to represent the last significant coefficient position, directly reducing coding overhead
Solution Approach 2:
The patent performs a preliminary transformation of the coordinate system before encoding, converting absolute positions into distances from the lower-right corner. This preliminary action simplifies subsequent encoding operations and reduces the information that needs to be transmitted
3Ease of operation
If coefficient positions are coded using traditional methods, then decoding is straightforward, but coding efficiency decreases for high bit depth and high quality video
Solution Approach 1:
The patent inverts the coordinate reference point from the upper-left corner to the lower-right corner. While this requires a slight modification in the decoding logic, it significantly improves coding efficiency by reducing the average coded values, especially for high bit depth and high quality video where the distribution of significant coefficients changes
Data Source
AI summary
Embodiments of the present disclosure provide a coefficient coding method and a storage medium. The method includes the following. A bitstream is parsed to obtain a video flag. When the video flag indicates that a video satisfies a preset condition, the bitstream is parsed to obtain a last-significant-coefficient position-reverse flag and coordinate information of a last significant coefficient. When the last-significant-coefficient position-reverse flag indicates that a position of the last significant coefficient is reversed for a current block, the position of the last significant coefficient is determined by calculation with the coordinate information of the last significant coefficient. According to a preset scanning order, all coefficients before the position of the last significant coefficient are decoded to determine coefficients of the current block.