Last-Coefficient Position Coding to Reduce Decoder Switching

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current video coding standards face inefficiencies in arithmetic coding and decoding of last position information, particularly due to frequent switching between different arithmetic decoding methods, which hinders efficient processing.

Innovation Solution

An image coding method that binarizes and codes the last position information by separating it into components, using context adaptive binary arithmetic coding and bypass coding, and arranging the coded signals in a bit stream to minimize switching between decoding methods, allowing for efficient decoding.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If conventional arithmetic coding methods are used for last position information, then coding completeness is maintained, but the number of switching between decoding methods increases, reducing processing efficiency

Engineering Contradiction:
Improveprocessing efficiencyVSAvoidnumber of decoding method switches
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The last position information is segmented into two separate components: horizontal last position information and vertical last position information. Each component is independently binarized and coded using the same arithmetic coding method, avoiding the need to switch between different decoding methods and thereby improving processing efficiency.

Inventive Principle:
Principle #1Segmentation

2Adaptability or versatility

If different arithmetic coding methods are used for different components, then coding adaptability is improved, but the complexity of decoding process increases due to method switching

Engineering Contradiction:
Improvecoding adaptabilityVSAvoiddecoding process simplicity
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The last position information is divided into horizontal and vertical components that are processed separately using the same arithmetic coding method, maintaining coding adaptability while simplifying the decoding process by eliminating method switching.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

A single arithmetic coding method is made universal to handle both horizontal and vertical last position information components, eliminating the need for multiple specialized decoding methods and thereby simplifying the overall decoding process.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUSRE49788E1Image coding method, image coding apparatus, image decoding method and image decoding apparatus
Publication Date: 2024.01.02 SUN PATENT TRUST
  • USRE49788E1 patent drawing
  • USRE49788E1 patent drawing
  • USRE49788E1 patent drawing

AI summary

An apparatus is provided for decoding last position information indicating a horizontal position and a vertical position of a last non-zero coefficient in a predetermined order within a current block to be decoded, the current block being included in a picture and including a plurality of coefficients. The apparatus includes one or more processors, a communication unit, and storage coupled to the one or more processors and the communication unit. The communication unit is configured to transmit a request for a bitstream to an external system, and receive the bitstream from the external system. The one or more processors are configured to obtain the bitstream, perform first arithmetic decoding, perform second arithmetic decoding, derive a horizontal component of the last position information, and derive a vertical component of the last position. A system for decoding and a displaying method are also provided.