2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Computer Vision – ECCV 2008 

      Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles

      other

      ,

      Springer Berlin Heidelberg

      Read this book at

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

          Related collections

          Most cited references 10

          • 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
            • Record: found
            • Abstract: not found
            • Article: not found

            MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming

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

              A Linear Programming Approach to Max-Sum Problem: A Review

                Bookmark

                Author and book information

                Book
                978-3-540-88689-1
                978-3-540-88690-7
                2008
                10.1007/978-3-540-88690-7
                Book Chapter
                2008
                : 806-820
                10.1007/978-3-540-88690-7_60

                Comments

                Comment on this book

                Book chapters

                Similar content 2,913

                Cited by 8