8
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references55

          • Record: found
          • Abstract: not found
          • Article: not found

          An Efficient Heuristic Procedure for Partitioning Graphs

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On Modularity Clustering

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Convergent tree-reweighted message passing for energy minimization.

              Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper, we focus on the recent technique proposed by Wainwright et al. [33]--tree-reweighted max-product message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy. However, the algorithm is not guaranteed to increase this bound--it may actually go down. In addition, TRW does not always converge. We develop a modification of this algorithm which we call sequential tree-reweighted message passing. Its main property is that the bound is guaranteed not to decrease. We also give a weak tree agreement condition which characterizes local maxima of the bound with respect to TRW algorithms. We prove that our algorithm has a limit point that achieves weak tree agreement. Finally, we show that, our algorithm requires half as much memory as traditional message passing approaches. Experimental results demonstrate that on certain synthetic and real problems, our algorithm outperforms both the ordinary belief propagation and tree-reweighted algorithm in [33]. In addition, on stereo problems with Potts interactions, we obtain a lower energy than graph cuts.
                Bookmark

                Author and article information

                Journal
                International Journal of Computer Vision
                Int J Comput Vis
                Springer Nature
                0920-5691
                1573-1405
                November 2015
                March 2015
                : 115
                : 2
                : 155-184
                Article
                10.1007/s11263-015-0809-x
                3fc5ee90-8246-496a-9a40-86008d78fb10
                © 2015
                History

                Comments

                Comment on this article