Beyond procedural facade parsing: Bidirectional alignment via linear programming

5Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a novel formulation for parsing facade images with user-defined shape prior. Contrary to other state-of-the-art methods, we do not explore the procedural space of shapes derived from a grammar. Instead we formulate parsing as a linear binary program which we solve using Dual Decomposition. The algorithm produces plausible approximations of globally optimal segmentations without grammar sampling. It yields state-of-the-art performance on standard datasets.

Cite

CITATION STYLE

APA

Koziński, M., Obozinski, G., & Marlet, R. (2015). Beyond procedural facade parsing: Bidirectional alignment via linear programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9006, pp. 79–94). Springer Verlag. https://doi.org/10.1007/978-3-319-16817-3_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free