[ALGORITHM]
@misc{sun2021spatial,
title={Spatial Dual-Modality Graph Reasoning for Key Information Extraction},
author={Hongbin Sun and Zhanghui Kuang and Xiaoyu Yue and Chenhao Lin and Wayne Zhang},
year={2021},
eprint={2103.14470},
archivePrefix={arXiv},
primaryClass={cs.CV}
}
Method | Modality | Macro F1-Score | Download |
---|---|---|---|
sdmgr_unet16 | Visual + Textual | 0.888 | model | log |
sdmgr_novisual | Textual | 0.870 | model | log |
Method | Modality | Edge F1-Score | Node Macro F1-Score | Node Micro F1-Score | Download |
---|---|---|---|---|---|
sdmgr_novisual | Textual | 0.786 | 0.926 | 0.935 | model | log |
:::{note}
- In the case of openset, the number of node categories is unknown or unfixed, and more node category can be added.
- To show that our method can handle openset problem, we modify the ground truth of
WildReceipt
toWildReceiptOpenset
. Thenodes
are just classified into 4 classes:background, key, value, others
, while addingedge
labels for each box. - The model is used to predict whether two nodes are a pair connecting by a valid edge.
- You can learn more about the key differences between CloseSet and OpenSet annotations in our tutorial. :::