Volumetric Video Encoding Pruning Graph View Precedence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for encoding and decoding volumetric video content, particularly 6DoF video, face challenges in creating non-redundant and complementary color and depth patches, leading to inefficiencies in data transmission and potential visual artifacts during view synthesis.
Innovation Solution
A method involving the creation of a pruning graph to determine the precedence of views in a multi-views frame, allowing for the efficient pruning of redundant information and encoding of the graph in the data stream, which is then used for accurate view synthesis at the decoding stage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all views of a multi-views frame are encoded without pruning, then complete view information is preserved for high-quality rendering, but the data transmission volume increases and encoding efficiency decreases
Solution Approach 1:
The patent extracts and removes redundant view information from the multi-views frame before encoding. By identifying and eliminating duplicate or highly correlated views, the system reduces data transmission volume while preserving the essential information needed for high-quality view synthesis at the decoder side.
Solution Approach 2:
The patent discards redundant view data during encoding and recovers the complete view information at the decoder side through view synthesis algorithms. The pruned views are transmitted efficiently, and the full multi-view content is reconstructed using the transmitted data combined with synthesis techniques.
2Productivity
If views are pruned to reduce data transmission, then data efficiency improves, but visual artifacts may occur during view synthesis
Solution Approach 1:
The patent performs preliminary analysis of view redundancy and correlation before pruning decisions are made. By pre-processing the multi-views frame to identify which views can be safely removed without impacting synthesis quality, the system avoids visual artifacts while maximizing compression efficiency.
Solution Approach 2:
The patent incorporates feedback mechanisms where the encoder analyzes the impact of pruning decisions on potential synthesis quality and adjusts the pruning strategy accordingly. This feedback loop ensures that views critical for high-quality rendering are preserved while redundant ones are removed.
3Quantity of substance
If a complex pruning algorithm is used to maximize redundancy removal, then data compression improves, but device complexity and processing time increase
Solution Approach 1:
The patent applies partial pruning by removing only the most obviously redundant views rather than attempting to eliminate all possible redundancy. This approach achieves significant compression with simpler algorithms and lower computational complexity, accepting that some redundancy may remain but is manageable.
Solution Approach 2:
The patent segments the view set into different groups based on redundancy levels and processes them with different pruning strategies. This segmentation allows the system to apply complex algorithms only where necessary while using simpler methods for clearly redundant views, reducing overall processing complexity.
Data Source
AI summary
Methods, devices and stream for encoding, decoding and transmitting a multi-views frame are disclosed. A non-pruned MVD frame is obtained and an acyclic graph representing pruning precedence relations between views is determined. The MVD is pruned by using these precedence relations. The pruned MVD and data representative of the graph are encoded in the data stream. At the decoding, the contribution of each view for a pixel of a viewport frame to generate is determined as a function of the decoded pruning graph.