Steganographic Node Data Encoding for Graph Visualization Readability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Displaying supplemental data for nodes in complex system graphs is challenging due to limited screen real estate, making it difficult to convey additional information like GUID, type, and last modification time without compromising readability.
Innovation Solution
The method involves dividing the visual representation of the system graph into rectangles corresponding to each node, where supplemental data is steganographically encoded along with offset distances, allowing for the inclusion of additional attributes without impacting the graphical representation's readability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If additional node attributes (GUID, type, last modification time) are displayed in the graph visualization, then information completeness is improved, but readability is worsened due to limited screen real estate
Solution Approach 1:
The patent extracts supplemental node data (GUID, type, last modification time) from the main graph visualization and embeds it steganographically within the node images themselves. This allows the information to be separated from the visual layout while remaining associated with the correct nodes, thus improving information completeness without compromising readability.
Solution Approach 2:
The patent nests supplemental data directly within the node image files using steganographic encoding. The additional information is hidden inside the existing node visuals, creating a nested structure where the node image contains both its visual representation and its data attributes. This eliminates the need for separate data layers while preserving both readability and information completeness.
2Loss of information
If more comprehensive node data is included in the visualization, then data completeness is improved, but device complexity is worsened due to additional data layers and links
Solution Approach 1:
The patent merges the supplemental node data with the node visual representation by encoding the information directly into the node image files. This combination eliminates the need for separate data structures, links, and layers that would otherwise be required to associate additional attributes with nodes. The merged node image serves both visual and data storage functions, reducing overall system complexity.
Solution Approach 2:
The patent makes the node image files multi-functional by enabling them to serve both as visual elements and as containers for supplemental data. Each node image simultaneously provides graphical representation and stores associated attributes (GUID, type, last modification time), eliminating the need for separate data storage mechanisms and reducing the complexity of data management structures.
3Loss of information
If node information is displayed in a screenshot, then information availability is improved, but visual clarity is worsened due to crowding
Solution Approach 1:
The patent extracts supplemental information from the visual display area and embeds it within the node images themselves. This extraction removes the need for additional text labels or data displays that would crowd the screenshot, while the information remains accessible through the node visuals. The result is improved information availability without compromising visual clarity in captured images.
Solution Approach 2:
The patent nests supplemental data within the node image files, creating a self-contained structure where the node visual includes its own data. When a screenshot is taken, the embedded information is captured along with the visual element, providing complete node information in the screenshot without requiring additional space or compromising the visual clarity of the graph representation.
Data Source
AI summary
A method and system for communicating supplemental data for nodes of a graph representing a system. A visual representation of the graph is divided into a portions, each portion of the visual representation of the graph being a rectangle corresponding to a respective node of the graph, wherein the visual representation is an area of a computer screen displaying the graph. Supplemental data for each respective node, together with an offset distance between a reference point of each respective node and a reference point of the supplemental data for each respective node, is encoded steganographically into the portion of the graphical representation corresponding to each respective node.