Motion Merge Candidate Ordering for Parallel Video Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video encoding and decoding methods lack efficient methods for determining the usability of neighboring blocks in configuring motion candidate lists and achieving parallelism between prediction units within a coding unit, leading to suboptimal video encoding and decoding efficiency.
Innovation Solution
A method and apparatus for determining the availability of neighboring blocks in a motion candidate list by deriving block availability information and motion information based on a predetermined order restriction, allowing parallel configuration of merge candidate lists for improved video encoding and decoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If motion candidate list is configured by checking all neighboring blocks, then prediction accuracy is improved, but processing time increases
Solution Approach 1:
The patent applies preliminary action by pre-determining the availability of neighboring blocks and pre-configuring merge candidates before the main motion compensation process. The decoder checks whether neighboring blocks are available and configures merge candidate lists in advance, so that when motion compensation is needed, the necessary information is already prepared, reducing real-time processing time while maintaining prediction accuracy.
Solution Approach 2:
The patent segments the motion candidate list configuration into multiple independent parts: checking availability of different neighboring blocks (left, top, top-left), determining merge candidate status for each block, and assembling the final candidate list. This segmentation allows parallel processing and reduces the computational burden on any single operation, thereby decreasing overall processing time while preserving comprehensive prediction capability.
2Device complexity
If sequential processing is used for neighboring block availability determination, then processing simplicity is maintained, but encoding/decoding efficiency is reduced
Solution Approach 1:
The patent segments the availability determination process into independent checks for different neighboring blocks (left block, top block, top-left block). Each block's availability can be determined independently without affecting others, enabling parallel processing. This segmentation increases productivity by allowing simultaneous evaluation of multiple blocks while keeping each individual check simple and straightforward.
Solution Approach 2:
The patent introduces dynamic parallel processing capability where the number of simultaneous availability checks can be adjusted based on system resources and block configurations. The system can dynamically configure how many availability determinations are performed in parallel, optimizing the balance between processing simplicity and efficiency for different scenarios without requiring complex reconfiguration of the overall architecture.
3Ease of manufacture
If merge candidate list is configured without parallelism, then implementation simplicity is maintained, but video encoding/decoding efficiency is suboptimal
Solution Approach 1:
The patent segments the merge candidate list configuration into independent operations for each neighboring block. The availability of the left block, top block, and top-left block can be determined and processed independently, then combined to form the complete candidate list. This segmentation enables parallel implementation that maintains relative simplicity while significantly improving encoding/decoding efficiency through concurrent processing of multiple blocks.
Solution Approach 2:
The patent implements preliminary action by pre-determining which neighboring blocks are available and pre-configuring their merge candidates before the main decoding process. This advance preparation allows the actual motion compensation to proceed more efficiently without needing to re-evaluate block availability or re-configure candidates during the main processing loop, thereby improving productivity without adding complex runtime logic.
Data Source
AI summary
The image decoding method according to the present invention comprises the steps of: determining the availability of a block adjacent to a current block; configuring a merge candidate list for the current block on the basis of the result of the determined availability; and performing motion compensation for the current block on the basis of the merge candidate list, wherein the step of determining availability comprises the steps of inducing block availability information on the adjacent block and inducing the availability of motion information on the adjacent block, and the step of determining the availability of the adjacent block is such that when there is more than one adjacent block, the availability of adjacent blocks can be determined in accordance with a predetermined order restriction.