资源论文Efficient Structured Parsing of Fac¸ades Using Dynamic Programming

Efficient Structured Parsing of Fac¸ades Using Dynamic Programming

2019-12-12 | |  64 |   46 |   0

Abstract

We propose a sequential optimization technique for segmenting a rectifified image of a fac¸ade into semantic categories. Our method retrieves a parsing which respects common architectural constraints and also returns a certifificate for global optimality. Contrasting the suggested method, the considered fac¸ade labeling problem is typically tackled as a classifification task or as grammar parsing. Both approaches are not capable of fully exploiting the regularity of the problem. Therefore, our technique very signifificantly improves the accuracy compared to the state-of-the-art while being an order of magnitude faster. In addition, in 85% of the test images we obtain a certifificate for optimality

上一篇:Graph Cut based Continuous Stereo Matching using Locally Shared Labels

下一篇:FAST LABEL: Easy and Efficient Solution of Joint Multi-Label and Estimation Problems

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...