.png){kind=icon}
返回
Keypoint-Driven Line Drawing Vectorization via PolyVector Flow
.png){kind=icon}
OA
AI
DOI：10.1145/3478513.3480529.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Line drawing vectorization is a daily task in graphic design, computer animation, and engineering, necessary to convert raster images to a set of curves for editing and geometry processing. Despite recent progress in the area, automatic vectorization tools often produce spurious branches or incorrect connectivity around curve junctions; or smooth out sharp corners. These issues detract from the use of such vectorization tools, both from an aesthetic viewpoint and for feasibility of downstream applications (e.g., automatic coloring or inbetweening). We address these problems by introducing a novel line drawing vectorization algorithm that splits the task into three components: (1) finding keypoints, i.e., curve endpoints, junctions, and sharp corners; (2) extracting drawing topology, i.e., finding connections between keypoints; and (3) computing the geometry of those connections. We compute the optimal geometry of the connecting curves via a novel geometric flow - PolyVector Flow - that aligns the curves to the drawing, disambiguating directions around Y-, X-, and T-junctions. We show that our system robustly infers both the geometry and topology of detailed complex drawings. We validate our system both quantitatively and qualitatively, demonstrating that our method visually outperforms previous work.
Keyword:
line drawing
vectorization
frame field
geometric flow
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
引用论文
Net throughput with IEEE 802.11 wireless LANs.png)
2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540)
2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540)IF0
PREAI
分享收藏
An improved topology extraction approach for vectorization of sketchy line drawings一种改进的草图矢量化拓扑提取方法VISUAL COMPUTER
VISUAL COMPUTERIF2.9
PREAI
分享收藏分享收藏
查看更多内容