资源论文A Convex Discrete-Continuous Approach for Markov Random Fields

A Convex Discrete-Continuous Approach for Markov Random Fields

2020-04-02 | |  102 |   43 |   0

Abstract

We propose an extension of the well-known LP relaxation for Markov random fields to explicitly allow continuous label spaces. Unlike conventional continuous formulations of labelling problems which assume that the unary and pairwise potentials are convex, our formulation allows them to be general piecewise convex functions with continuous domains. Furthermore, we present the extension of the widely used efficient scheme for handling L1 smoothness priors over discrete ordered label sets to con- tinuous label spaces. We provide a theoretical analysis of the proposed model, and empirically demonstrate that labelling problems with huge or continuous label spaces can benefit from our discrete-continuous rep- resentation.

上一篇:Mixed-Resolution Patch-Matching

下一篇:Latent Pyramidal Regions for Recognizing Scenes

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...