Shared Candidate List for Video Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding technologies, such as HEVC, face inefficiencies in encoding and decoding multiple blocks of pixels within shared boundaries, as they lack a unified approach to leverage spatial and temporal neighbors for prediction, leading to suboptimal coding performance.
Innovation Solution
A video coder employs a shared candidate list to encode or decode multiple blocks of pixels within a shared boundary, identifying prediction candidates based on spatial or temporal neighbors and using these candidates to code blocks in parallel, thereby improving prediction efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If separate candidate lists are used for each block in HEVC, then prediction accuracy can be maintained for individual blocks, but coding efficiency decreases and computational complexity increases
Solution Approach 1:
The patent merges multiple separate candidate lists into a single shared candidate list that serves multiple blocks within a shared boundary. This shared list contains prediction candidates derived from spatial and temporal neighbors of the entire boundary region, allowing all blocks to access the same set of predictors. This merging approach directly improves coding efficiency by reducing redundancy while managing computational complexity through shared resources.
Solution Approach 2:
The shared candidate list serves multiple blocks simultaneously, making it a universal resource for prediction across the shared boundary. Instead of each block having its own dedicated candidate list, the single shared list performs the function of predicting multiple blocks, thereby improving overall coding efficiency while reducing the total number of candidate lists that need to be maintained and processed.
2Speed
If parallel encoding/decoding of blocks is implemented, then processing speed increases, but coordination and synchronization become more complex
Solution Approach 1:
The shared candidate list is constructed in advance before parallel encoding or decoding operations begin. By pre-computing and storing the prediction candidates for the entire shared boundary region, the system eliminates the need for complex real-time coordination during parallel processing. Each block can independently select from the pre-prepared shared candidate list, enabling straightforward parallel execution without synchronization overhead.
Data Source
AI summary
A video coder that uses a shared candidate list to encode or decode multiple blocks of pixels within a shared boundary is provided. The video coder identifies a shared boundary encompassing a plurality of blocks of pixels of a current picture in a video sequence. The video coder identifies one or more prediction candidates as a shared candidate list based on neighbors of a region defined by the shared boundary. The video coder codes one or more blocks of pixels encompassed by the shared boundary by using one or more prediction candidates selected from the shared candidate list.