Non-Adjacent Merge Candidate Rules for Low-Complexity Video Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards face challenges in managing memory and complexity requirements while maintaining coding efficiency, particularly in handling higher resolution video content.
Innovation Solution
The technology identifies and utilizes non-adjacent merge candidates to construct merge candidates, adhering to specific rules to manage line buffer size and reduce complexity, applicable to video coding standards like HEVC and future codecs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If non-adjacent merge candidates are selected to improve coding efficiency, then coding efficiency is improved, but line buffer size and computational complexity increase
Solution Approach 1:
The patent changes the selection parameters and criteria for merge candidates by introducing specific rules that define which non-adjacent blocks can be selected. These rules impose constraints on the selection process, thereby controlling the number of candidates and reducing the associated memory buffer size and computational complexity while maintaining coding efficiency improvements.
2Productivity
If more non-adjacent blocks are considered for merge candidates, then coding efficiency improves, but memory requirements increase
Solution Approach 1:
The patent modifies the parameters governing merge candidate selection by establishing specific rules that limit which non-adjacent blocks can be considered. This controlled approach allows the system to benefit from additional non-adjacent candidates for improved coding efficiency while preventing uncontrolled growth in memory requirements through enforced selection constraints.
Data Source
AI summary
Devices, systems and methods for constructing low-complexity non-adjacent merge candidates. In a representative aspect, a method for video processing includes receiving a current block of video data, selecting, based on a rule, a first non-adjacent block that is not adjacent to the current block, constructing a first merge candidate comprising motion information based on the first non-adjacent block, identifying a second non-adjacent block that is not adjacent to the current block and different from the first non-adjacent block, based on determining that the second non-adjacent block fails to satisfy the rule, refraining adding a second merge candidate derived from the second non-adjacent block, constructing a merge candidate list based on the first non-adjacent block, and decoding the current block based on the merge candidate list.