Video Coding Inter Prediction Candidate Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional motion compensation methods in video coding, such as those used in MPEG-4 AVC/H.264, have a fixed number of motion information candidates per block, which limits coding efficiency and does not effectively reduce the overall code size.
Innovation Solution
A moving picture coding and decoding technology that derives and selects inter prediction information candidates from neighboring blocks within the same picture and from different time points, allowing for dynamic adjustment of the number of candidates based on profile and decoding ability, and codes the syntax elements indicating these candidates to reduce the code size.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a fixed number of motion information candidates per block is used in conventional motion compensation methods, then the coding structure is simple and easy to implement, but the coding efficiency is limited and the overall code size cannot be effectively reduced
Solution Approach 1:
The patent applies dynamics by making the number of motion information candidates variable rather than fixed. The coding structure dynamically adjusts the number of candidates based on block characteristics and prediction requirements, allowing the system to adapt to different coding scenarios and improve overall coding efficiency while maintaining manageable complexity through structured adaptation rules
Solution Approach 2:
The patent changes the parameter of motion information candidate count from a fixed value to a variable parameter. By allowing this parameter to change based on picture type, block size, and prediction mode, the system can optimize coding efficiency for different situations without requiring a completely complex adaptive structure, thus resolving the contradiction between efficiency and complexity
2Measurement precision
If the number of inter prediction information candidates is increased to improve coding efficiency, then the prediction accuracy improves, but the code size for coding the syntax elements increases
Solution Approach 1:
The patent applies local quality by allowing different blocks to have different numbers of motion information candidates based on their specific characteristics. Rather than uniformly increasing candidates across all blocks, the system selectively increases candidates only where needed (e.g., for blocks with complex motion patterns), thus improving prediction accuracy locally without proportionally increasing overall code size
Solution Approach 2:
The patent implements partial action by increasing the number of motion information candidates only for specific blocks that benefit from it, rather than for all blocks. This selective approach ensures that prediction accuracy is improved where necessary while avoiding the penalty of increased code size for blocks that would be adequately predicted with fewer candidates
Data Source
AI summary
A prediction information derivation unit derives inter prediction information candidates from inter prediction information of coded prediction blocks neighboring a prediction block subject to coding within the same picture as the prediction block subject to coding and inter prediction information of a prediction block in a coded picture that is different from the prediction block subject to coding. The prediction information derivation unit determines an inter prediction information candidate to be used for inter prediction of the prediction block subject to coding from the inter prediction information candidates that have been derived. A second bitstream generation uni codes an index that indicates the inter prediction information candidate based on the number of the inter prediction information candidates.