Reference Picture Set Signaling Overhead Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards face challenges in efficiently reducing reference picture set (RPS) signal overhead, particularly in signaling and decoding processes, which leads to increased bitstream size and computational complexity.
Innovation Solution
The proposed solution involves generating partial RPS templates at the decoder side based on a received full RPS, reducing the need to send unnecessary RPS templates in the bitstream, and employing symmetry characteristics to minimize the number of bits required for coding RPS index values, thereby decreasing signal overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If full RPS templates are sent in the bitstream, then decoding accuracy is improved, but signal overhead increases
Solution Approach 1:
The patent extracts only the essential RPS template information needed for decoding and removes redundant data. By sending minimal RPS templates rather than full templates, the signal overhead is reduced while maintaining sufficient decoding accuracy through selective extraction of critical reference picture set parameters.
Solution Approach 2:
The patent applies partial action by transmitting only a subset of RPS template data rather than complete information. The decoder can reconstruct or infer the remaining information from context, allowing partial transmission that reduces overhead while achieving adequate decoding performance for the application.
2Measurement precision
If RPS index values are coded with high precision, then reference picture identification accuracy is improved, but bitstream size increases
Solution Approach 1:
The patent applies local quality by using different coding precision for different RPS index values based on their importance and frequency of use. Frequently referenced pictures use compact indexing with sufficient precision, while less critical references use coarser indexing, optimizing the balance between identification accuracy and bitstream efficiency for each local case.
Solution Approach 2:
The patent changes the parameter representation by using variable-length coding and context-adaptive precision for RPS index values. The coding precision is dynamically adjusted based on the specific picture reference patterns, allowing high precision when needed and lower precision when sufficient, thereby reducing overall bitstream size while maintaining necessary accuracy.
3Productivity
If all RPS templates are transmitted in the bitstream, then decoder performance is improved, but encoding and decoding complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-defining and signaling a limited set of RPS template configurations at higher levels (sequence or picture parameter sets). These pre-configured templates are then referenced by individual slices or picture groups, eliminating the need to transmit complete template data repeatedly and reducing both encoding and decoding complexity while maintaining decoder performance.
Solution Approach 2:
The patent makes RPS templates universal by creating reusable template definitions that can be applied across multiple slices, picture groups, or even sequences. A single template definition serves multiple purposes and locations, reducing the total amount of data that needs to be encoded and decoded while improving decoder efficiency through consistent template application.
Data Source
AI summary
A previously signaled reference picture set (RPS) corresponding to a current picture is indicated. A first flag for a picture in the previously signaled RPS is set if the picture is to be used as a reference picture for the current picture. A bitstream is sent.