Abstract
In this paper, we present a simple yet efficient framework, BlumNet, for extracting object skeletons in natural images and binary shapes. With the need for highly reliable skeletons in various multimedia applications, the proposed BlumNet is distinguished in three aspects: (1) The inception of graph decomposition and reconstruction strategies further simplifies the skeleton extraction task into a graph component detection problem, which significantly improves the accuracy and robustness of extracted skeletons. (2) The intuitive representation of each skeleton branch with multiple structured and overlapping line segments can effectively prevent the skeleton branch vanishing problem. (3) In comparison to traditional skeleton heatmaps, our approach directly outputs skeleton graphs, which is more feasible for real-world applications. Through comprehensive experiments, we demonstrate the advantages of BlumNet: significantly higher accuracy than the state-of-the-art AdaLSN (0.826 vs. 0.786) on the SK1491 dataset, a marked improvement in robustness on mixed object deformations, and also a state-of-the-art performance on binary shape datasets (e.g. 0.893 on the MPEG7 dataset).
Original language | English |
---|---|
Title of host publication | MM '22: Proceedings of the 30th ACM International Conference on Multimedia |
Publisher | Association for Computing Machinery |
Pages | 5527-5536 |
Number of pages | 10 |
ISBN (Electronic) | 9781450392037 |
DOIs | |
Publication status | Published - 10 Oct 2022 |
Event | 30th ACM International Conference on Multimedia 2022 - Lisbon, Portugal Duration: 10 Oct 2022 → 14 Oct 2022 |
Conference
Conference | 30th ACM International Conference on Multimedia 2022 |
---|---|
Abbreviated title | MM 2022 |
Country/Territory | Portugal |
City | Lisbon |
Period | 10/10/22 → 14/10/22 |
Keywords
- skeleton
- skeleton extraction
- skeleton graph
- transformer
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Graphics and Computer-Aided Design
- Human-Computer Interaction
- Software