Adaptive Bilateral Matching for Decoder Motion Vector Refinement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding techniques face challenges in achieving efficient compression of video data while maintaining high video quality, particularly due to the large amounts of data required for high fidelity and resolution, which burdens communication networks and devices.
Innovation Solution
The implementation of decoder-side motion vector refinement using adaptive bilateral matching, which refines motion vectors by selecting appropriate search strategies and constraints to minimize block matching costs, thereby improving video quality and compression efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If video coding techniques use higher resolution and frame rates to meet consumer demands for high fidelity video, then video quality is improved, but the amount of data required increases, burdening communication networks and devices
Solution Approach 1:
The patent changes the parameters of motion vector refinement by adaptively selecting between different search strategies (unconstrained vs. constrained bilateral matching) based on motion characteristics. This allows the system to optimize compression efficiency dynamically, reducing the data amount needed while maintaining video quality through more accurate motion compensation.
2Measurement precision
If decoder-side motion vector refinement uses more extensive search strategies to improve motion vector accuracy, then video quality is improved, but computational complexity and processing time increase
Solution Approach 1:
The patent implements a dynamic system that adapts the motion vector refinement process based on motion characteristics. The system switches between constrained and unconstrained bilateral matching strategies, adjusting the search complexity dynamically. This allows the decoder to maintain high motion vector accuracy when needed while reducing processing complexity for scenes with simpler motion patterns.
Solution Approach 2:
The patent applies different levels of refinement quality to different regions or blocks based on their motion characteristics. By identifying blocks with significant motion and applying more extensive search strategies only where necessary, the system achieves high overall video quality without uniformly increasing processing complexity across the entire frame.
3Productivity
If adaptive bilateral matching is used to refine motion vectors, then compression efficiency is improved, but the complexity of the decoding process increases
Solution Approach 1:
The patent segments the decoding process into distinct stages: initial motion vector derivation, motion characteristic analysis, adaptive strategy selection, and bilateral matching refinement. This segmentation allows the complex adaptive bilateral matching process to be organized into manageable steps, improving compression efficiency while making the decoding complexity more tractable and implementable.
Data Source
AI summary
Systems and techniques are provided for processing video data. For example, the systems and techniques can include obtaining a current picture of video data and obtaining reference pictures for the current picture from the video data. A merge mode candidate can be determined for the current picture. First and second motion vectors can be identified for the merge mode candidate. A motion vector search strategy can be selected for the merge mode candidate from a plurality of motion vector search strategies. The selected motion vector search strategy can be associated with one or more constraints corresponding to at least one of the first motion vector or the second motion vector. The selected motion vector search strategy can be used to determine refined motion vectors based on the first motion vector, the second motion vector, and the reference pictures. The merge mode candidate can be processed using the refined motion vectors.