Holistically-Attracted Wireframe Parsing

2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR)(2020)

引用 103|浏览416
暂无评分
摘要
This paper presents a fast and parsimonious parsing method to accurately and robustly detect a vectorized wire-frame in an input image with a single forward pass. The proposed method is end-to-end trainable, consisting of three components: (i) line segment and junction proposal generation, (ii) line segment and junction matching, and (iii) line segment and junction verification. For computing line segment proposals, a novel exact dual representation is proposed which exploits a parsimonious geometric reparameterization for line segments and forms a holistic 4-dimensional attraction field map for an input image. Junctions can be treated as the "basins" in the attraction field. The proposed method is thus called Holistically-Attracted Wireframe Parser (HAWP). In experiments, the proposed method is tested on two benchmarks, the Wireframe dataset [15] and the YorkUrban dataset [8]. On both benchmarks, it obtains state-of-the-art performance in terms of accuracy and efficiency. For example, on the Wireframe dataset, compared to the previous state-of-the-art method L-CNN [41], it improves the challenging mean structural average precision (msAP) by a large margin (2.8% absolute improvements), and achieves 29.5 FPS on single GPU (89% relative improvement). A systematic ablation study is performed to further justify the proposed method. The source code is publicly available.
更多
查看译文
关键词
mean structural average precision,HAWP,line segment and junction verification,line segment and junction matching,line segment and junction proposal generation,L-CNN method,parsimonious parsing method,Holistically-Attracted Wireframe parsing,YorkUrban dataset,Wireframe dataset,Holistically-Attracted Wireframe Parser,parsimonious geometric reparameterization,vectorized wireframe
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要