Enriched Multimedia Scene Graph Adaptivity Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multimedia scene representation technologies face challenges in adapting to diverse hardware capabilities and network conditions, leading to inefficient data transmission and increased workload in creating multiple scene graphs for different configurations, which results in network congestion and latency.
Innovation Solution
A method and apparatus for producing a unique enriched multimedia scene representation that is independent of specific configurations, using a generic scene graph with adaptive coding strategies identified by nodes, allowing for efficient sharing and processing across different devices and networks without multiplying sub-graphs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple scene graphs are created for different hardware configurations and network conditions, then adaptation to diverse clients is improved, but device complexity and workload increase
Solution Approach 1:
The patent applies universality by creating a single generic scene graph that can serve multiple hardware configurations and network conditions. Instead of creating separate specialized scene graphs for each client type, one universal scene graph structure is designed that can be adaptively processed downstream to match diverse client requirements, thereby reducing the workload of creating multiple graphs while maintaining broad adaptability.
Solution Approach 2:
The patent applies preliminary action by pre-defining a generic scene graph structure that contains all necessary elements and relationships, but defers the specific adaptation to downstream processing stages. This allows the scene graph to be prepared in advance in a standardized form, with adaptation to specific client configurations occurring automatically during transmission or rendering, rather than requiring manual creation of multiple specialized versions.
2Productivity
If multiple scene graphs are transmitted to different clients, then client-specific optimization is improved, but network congestion and latency increase
Solution Approach 1:
The patent applies merging by consolidating multiple client-specific scene graphs into a single generic scene graph that is transmitted once to all clients. This eliminates the need to send duplicate data over the network, reducing network congestion and transmission time. The single graph is then adaptively processed at the receiving end to meet individual client requirements, achieving client-specific optimization without the overhead of transmitting multiple versions.
3Productivity
If scene representation data is highly compressed for limited bandwidth, then network efficiency is improved, but manufacturing precision and quality of representation decrease
Solution Approach 1:
The patent applies local quality by maintaining high precision in the generic scene graph structure itself, while allowing for selective compression or simplification of specific elements during downstream adaptation based on network conditions and client capabilities. This ensures that the core scene representation maintains its integrity and quality, while peripheral or less critical elements can be compressed more aggressively to optimize network transmission efficiency.
Data Source
Figure 1
Figure 2(a)
Figure 2(b)
AI summary
The representation of content, in a scene representation, is enriched with a view to the adaptive use of the latter according to a set of common parameters. A subgraph of the scene graph, which is suitable for variable processing, is identified. For this purpose, it is possible to define two new types of scene element one of which allows the identification of the subgraph and the second of which allows the set of common parameters to be imposed in conjunction with the subgraph. An example of the first type consists of a node of the so-called "AdaptivityControl" type which encompasses the entire subgraph, a list of the nodes describing the set of common parameters and a group of fields allowing a dynamic updating of the content of this node. An example of the second type consists of a node of the so-called "CompressedlmageStrategy" type which comprises information relating to the object to be coded and the parameters of the coding.