Motion Vector Encoding Using Spatial Division and Grouping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional video compression techniques, such as H.264/AVC, face limitations in improving motion vector encoding efficiency due to increased indexing side information and decoder crash issues, leading to reduced compression performance.
Innovation Solution
The method involves aggregating predicted motion vector candidates into groups, selecting representative vectors, and encoding differential vectors along with a group index to efficiently compress motion vectors, thereby reducing the number of encoded bits and improving compression efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If MVComp uses a number of predicted motion vector candidates to improve compression efficiency, then compression performance is improved by 5%, but the quantity of indexing side information increases
Solution Approach 1:
The patent divides the set of predicted motion vector candidates into multiple groups based on their spatial positions. By segmenting the candidates into groups (e.g., first group, second group, third group), the encoder can select a group index instead of individually indexing each candidate, thereby reducing the quantity of side information while maintaining compression efficiency.
Solution Approach 2:
The patent introduces a spatial dimension for organizing motion vector candidates by grouping them according to their spatial positions (e.g., left, upper, upper-right neighboring blocks). This spatial grouping adds a dimensional structure to the candidate selection process, allowing the use of group indices rather than individual candidate indices, thus reducing side information overhead.
2Productivity
If one motion vector is selected from plurality of predicted motion vector candidates and side information is transmitted to identify the selected motion vector, then compression efficiency is improved, but decoder crash problem occurs and computational load on decoder increases
Solution Approach 1:
By segmenting candidates into groups and transmitting only a group index, the patent reduces the complexity and potential for decoder errors. The segmented structure provides a more robust framework that is less prone to decoder crashes while maintaining the ability to identify the selected motion vector.
3Reliability
If a limited number of motion vector candidates are used to address decoder crash problem, then decoder stability is improved, but compression performance is disadvantageously limited
Solution Approach 1:
The patent reconciles decoder stability with compression performance by segmenting a large number of candidates into groups. This allows the system to work with a manageable number of groups (maintaining decoder stability) while each group can contain multiple candidates (preserving compression performance).
Solution Approach 2:
By adding the spatial grouping dimension, the patent enables the system to handle more candidates effectively. The spatial organization allows the decoder to efficiently process grouped candidates without increasing computational load, thus maintaining both stability and performance.
Data Source
AI summary
Disclosed is a method for encoding a motion vector by using spatial division, the method comprises: aggregating predicted motion vector candidates of a current block into a plurality of groups; selecting representative predicted motion vectors for respective groups by selecting one of aggregated predicted motion vector candidates within the respective groups as representative predicted motion vector; selecting single representative predicted motion vector from the representative predicted motion vectors for the respective groups as a predicted motion vector; and encoding a differential vector representing difference between a current motion vector of the current block and a selected predicted motion vector.