FRUC Decoder Motion Vector Refinement via Bilateral Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding techniques for frame rate up-conversion (FRUC) are complex and energy-intensive, requiring a large number of reference samples from external memory for search operations, which increases processing power and energy consumption.
Innovation Solution
The proposed solution reduces the amount of reference samples used from external memory by constructing a candidate list of motion vector information and refining the starting motion vector information using bilateral matching or template matching, allowing for efficient decoder-side motion information derivation and predictive block generation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a large number of reference samples from external memory are used for search operations in FRUC, then motion estimation accuracy is improved, but processing complexity and energy consumption increase
Solution Approach 1:
The patent segments the motion estimation process into two phases: (1) constructing a candidate list of motion vectors from a limited set of reference samples, and (2) refining these candidates using bilateral matching or template matching. This segmentation allows accurate motion estimation while reducing the total number of reference samples needed from external memory, thereby lowering processing complexity.
Solution Approach 2:
The patent performs preliminary action by pre-selecting and storing a limited set of candidate motion vectors in a candidate list before the actual motion estimation. This preliminary selection reduces the search space for subsequent refinement operations, maintaining accuracy while decreasing the computational burden and energy consumption associated with processing all possible reference samples.
2Measurement precision
If a large number of reference samples from external memory are used for search operations in FRUC, then motion estimation accuracy is improved, but energy consumption increases
Solution Approach 1:
The patent segments the motion estimation process into two phases: (1) constructing a candidate list of motion vectors from a limited set of reference samples, and (2) refining these candidates using bilateral matching or template matching. This segmentation allows accurate motion estimation while reducing the total number of reference samples needed from external memory, thereby lowering processing complexity.
Solution Approach 2:
The patent performs preliminary action by pre-selecting and storing a limited set of candidate motion vectors in a candidate list before the actual motion estimation. This preliminary selection reduces the search space for subsequent refinement operations, maintaining accuracy while decreasing the computational burden and energy consumption associated with processing all possible reference samples.
3Productivity
If decoder-side motion information derivation is performed, then coding efficiency is maintained, but processing complexity increases
Solution Approach 1:
The patent applies partial action by performing motion information derivation only for a selected subset of coding units rather than all blocks. The decoder uses the candidate list and refinement processes selectively, maintaining coding efficiency for important regions while reducing processing complexity for other areas, thus achieving a balance between productivity and device complexity.
Data Source
AI summary
A method of decoding video data includes constructing, by a video decoder implemented in processing circuitry, a candidate list of motion vector information for a portion of a current frame. The method includes receiving, by the video decoder, signaling information indicating starting motion vector information of the candidate list of motion vector information, the starting motion vector information indicating an initial position in a reference frame. The method includes refining, by the video decoder, based on one or more of bilateral matching or template matching, the starting motion vector information to determine refined motion vector information indicating a refined position in the reference frame that is within a search range from the initial position. The method includes generating, by the video decoder, a predictive block based on the refined motion vector information and decoding, by the video decoder, the current frame based on the predictive block.