Video Motion Merge Candidate Prioritization for Better Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video compression techniques struggle with increasing video size, resolution, and frame rate, necessitating improved encoding efficiency and image quality, particularly in configuring merge candidate lists for motion compensation.
Innovation Solution
A method and apparatus for efficiently configuring merge candidate lists through priority-based spatial merge candidates, considering zero motion information, and managing a history-based merge candidate buffer for each coding tree unit line, with redundancy checks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If video size, resolution, and frame rate are increased to improve video quality, then image quality is improved, but the amount of data to be encoded increases
Solution Approach 1:
The patent changes the parameters of merge candidate selection by introducing priority-based spatial merge candidates and considering zero motion information. This optimizes the motion compensation process to achieve better encoding efficiency for high-resolution and high-frame-rate videos, allowing improved image quality without proportionally increasing data amount.
2Quantity of substance
If existing compression techniques are used to reduce data amount, then data compression is improved, but encoding efficiency and image quality deteriorate
Solution Approach 1:
The patent performs preliminary actions by configuring merge candidate lists with priority-based spatial merge candidates before the actual encoding process. This preliminary optimization of motion information selection improves encoding efficiency and image quality while maintaining effective data compression, reversing the trade-off of existing techniques.
3Device complexity
If merge candidate lists are configured without optimization to simplify the process, then device complexity is reduced, but coding efficiency deteriorates
Solution Approach 1:
The patent optimizes the merge candidate list configuration by changing parameters such as prioritizing spatial merge candidates and considering zero motion information. This optimized configuration improves coding efficiency while maintaining manageable device complexity through systematic candidate selection.
4Productivity
If redundancy checks are performed to improve merge candidate list accuracy, then coding efficiency is improved, but device complexity increases
Solution Approach 1:
The patent applies local quality optimization by performing redundancy checks specifically on spatial merge candidates and considering zero motion information in relevant contexts. This targeted approach improves coding efficiency through accurate merge candidate selection while minimizing the increase in device complexity by focusing checks where they are most beneficial.
Data Source
AI summary
A video encoding/decoding method and apparatus are provided. A video decoding method includes deriving a spatial merge candidate, based on neighboring blocks spatially adjacent to a current block. The method also includes deriving a temporal merge candidate, based on neighboring blocks temporally adjacent to the current block. The method also includes generating a first merge candidate list based on the spatial merge candidate and the temporal merge candidate. The method also includes deriving a history-based merge candidate, based on motion information of a block encoded before the current block. The method also includes generating a second merge candidate list, based on the first merge candidate list and the history-based merge candidate. The method also includes generating a prediction block of the current block, based on the second merge candidate list. The first merge candidate list and the second merge candidate list are generated based on a priority of motion information.