TY - JOUR
T1 - GraphDecoder
T2 - Recovering Diverse Network Graphs from Visualization Images via Attention-Aware Learning
AU - Song, Sicheng
AU - Li, Chenhui
AU - Li, Dong
AU - Chen, Juntong
AU - Wang, Changbo
N1 - Publisher Copyright:
© 1995-2012 IEEE.
PY - 2024/7/1
Y1 - 2024/7/1
N2 - DNGs are diverse network graphs with texts and different styles of nodes and edges, including mind maps, modeling graphs, and flowcharts. They are high-level visualizations that are easy for humans to understand but difficult for machines. Inspired by the process of human perception of graphs, we propose a method called GraphDecoder to extract data from raster images. Given a raster image, we extract the content based on a neural network. We built a semantic segmentation network based on U-Net. We increase the attention mechanism module, simplify the network model, and design a specific loss function to improve the model's ability to extract graph data. After this semantic segmentation network, we can extract the data of all nodes and edges. We then combine these data to obtain the topological relationship of the entire DNG. We also provide an interactive interface for users to redesign the DNGs. We verify the effectiveness of our method by evaluations and user studies on datasets collected on the internet and generated datasets.
AB - DNGs are diverse network graphs with texts and different styles of nodes and edges, including mind maps, modeling graphs, and flowcharts. They are high-level visualizations that are easy for humans to understand but difficult for machines. Inspired by the process of human perception of graphs, we propose a method called GraphDecoder to extract data from raster images. Given a raster image, we extract the content based on a neural network. We built a semantic segmentation network based on U-Net. We increase the attention mechanism module, simplify the network model, and design a specific loss function to improve the model's ability to extract graph data. After this semantic segmentation network, we can extract the data of all nodes and edges. We then combine these data to obtain the topological relationship of the entire DNG. We also provide an interactive interface for users to redesign the DNGs. We verify the effectiveness of our method by evaluations and user studies on datasets collected on the internet and generated datasets.
KW - Attention mechanism
KW - chart mining
KW - information visualization
KW - network graph
KW - semantic segmentation
UR - https://www.scopus.com/pages/publications/85144060679
U2 - 10.1109/TVCG.2022.3225554
DO - 10.1109/TVCG.2022.3225554
M3 - 文章
C2 - 36449586
AN - SCOPUS:85144060679
SN - 1077-2626
VL - 30
SP - 3074
EP - 3088
JO - IEEE Transactions on Visualization and Computer Graphics
JF - IEEE Transactions on Visualization and Computer Graphics
IS - 7
ER -