File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: End-to-end wireframe parsing

TitleEnd-to-end wireframe parsing
Authors
Issue Date2019
Citation
Proceedings of the IEEE International Conference on Computer Vision, 2019, v. 2019-October, p. 962-971 How to Cite?
AbstractWe present a conceptually simple yet effective algorithm to detect wireframes in a given image. Compared to the previous methods which first predict an intermediate heat map and then extract straight lines with heuristic algorithms, our method is end-to-end trainable and can directly output a vectorized wireframe that contains semantically meaningful and geometrically salient junctions and lines. To better understand the quality of the outputs, we propose a new metric for wireframe evaluation that penalizes overlapped line segments and incorrect line connectivities. We conduct extensive experiments and show that our method significantly outperforms the previous state-of-the-art wireframe and line extraction algorithms. We hope our simple approach can be served as a baseline for future wireframe parsing studies. Code has been made publicly available at https://github.com/zhou13/lcnn.
Persistent Identifierhttp://hdl.handle.net/10722/327758
ISSN
2023 SCImago Journal Rankings: 12.263
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorZhou, Yichao-
dc.contributor.authorQi, Haozhi-
dc.contributor.authorMa, Yi-
dc.date.accessioned2023-05-08T02:26:36Z-
dc.date.available2023-05-08T02:26:36Z-
dc.date.issued2019-
dc.identifier.citationProceedings of the IEEE International Conference on Computer Vision, 2019, v. 2019-October, p. 962-971-
dc.identifier.issn1550-5499-
dc.identifier.urihttp://hdl.handle.net/10722/327758-
dc.description.abstractWe present a conceptually simple yet effective algorithm to detect wireframes in a given image. Compared to the previous methods which first predict an intermediate heat map and then extract straight lines with heuristic algorithms, our method is end-to-end trainable and can directly output a vectorized wireframe that contains semantically meaningful and geometrically salient junctions and lines. To better understand the quality of the outputs, we propose a new metric for wireframe evaluation that penalizes overlapped line segments and incorrect line connectivities. We conduct extensive experiments and show that our method significantly outperforms the previous state-of-the-art wireframe and line extraction algorithms. We hope our simple approach can be served as a baseline for future wireframe parsing studies. Code has been made publicly available at https://github.com/zhou13/lcnn.-
dc.languageeng-
dc.relation.ispartofProceedings of the IEEE International Conference on Computer Vision-
dc.titleEnd-to-end wireframe parsing-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICCV.2019.00105-
dc.identifier.scopuseid_2-s2.0-85081932291-
dc.identifier.volume2019-October-
dc.identifier.spage962-
dc.identifier.epage971-
dc.identifier.isiWOS:000531438101009-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats