Video Coding Merging Motion Candidate Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing moving picture coding technologies face challenges in efficiently performing parallel processing of motion compensation prediction across multiple neighboring blocks, particularly when using a motion vector of a processed block as a reference, which can lead to complex operations and hinder efficient coding efficiency.
Innovation Solution
A moving picture coding and decoding technology that generates and selects merging motion information candidates shared among prediction blocks, allowing for efficient coding and decoding of motion information using a merging motion information candidate generation and selection unit, and coding/decoding an index to specify the selected candidate, enabling parallel processing of motion compensation prediction.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If motion compensation prediction is performed collectively on multiple neighboring prediction blocks using a motion vector of a processed block, then coding efficiency is improved, but processing complexity increases and parallel processing becomes difficult
Solution Approach 1:
The patent divides the prediction block processing into independent segments by allowing each prediction block to select from multiple merging motion information candidates. This segmentation enables parallel processing while maintaining coding efficiency, as each block can be processed independently based on its selected candidate rather than requiring sequential collective processing.
Solution Approach 2:
The patent introduces dynamic selection of merging motion information candidates for each prediction block, allowing the system to adaptively choose the most appropriate candidate based on local characteristics. This dynamic approach improves coding efficiency while maintaining processing independence for parallel execution.
2Productivity
If motion compensation prediction is performed collectively on multiple neighboring prediction blocks, then coding efficiency is improved, but parallel processing capability deteriorates
Solution Approach 1:
The patent segments the motion compensation prediction process by allowing independent selection of merging motion information candidates for each prediction block. This creates independent processing units that can be executed in parallel while still achieving collective coding efficiency through the shared candidate selection mechanism.
Solution Approach 2:
The patent performs preliminary generation of merging motion information candidates before the actual prediction block processing. This preliminary action prepares the candidate pool in advance, enabling subsequent parallel processing of multiple prediction blocks without requiring sequential collective operations.
3Productivity
If a motion vector of a processed block is used as a reference for motion compensation prediction, then coding efficiency is improved, but operation complexity increases
Solution Approach 1:
The patent uses copying by referencing previously processed motion information as merging motion information candidates. Instead of performing complex calculations for each prediction block, the system copies and reuses motion information from neighboring processed blocks, significantly reducing operation complexity while maintaining coding efficiency.
Solution Approach 2:
The patent changes the parameter representation by using merging motion information candidates that encapsulate motion vector data. This parameter transformation allows efficient reuse of motion information without requiring complex operations, as the candidate selection process simplifies the handling of motion parameters.
Data Source
AI summary
A merging motion information candidate generation unit derives, when information indicating whether or not to derive a merging motion information candidate shared for all prediction blocks in a coding block is information indicating the derivation of a merging motion information candidate shared for all the prediction blocks in the coding block, a plurality of merging motion information candidates shared for all the prediction blocks in the coding block. A merging motion information selection unit selects one merging motion information candidate from the plurality of merging motion information candidates and uses the selected merging motion information candidate in a prediction block subject to coding.


