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

      Robust Higher Order Potentials for Enforcing Label Consistency

      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.

          Abstract

          Related collections

          Most cited references21

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

          Normalized cuts and image segmentation

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

            Efficient Graph-Based Image Segmentation

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

              What energy functions can be minimized via graph cuts?

              In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a general-purpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.
                Bookmark

                Author and article information

                Journal
                International Journal of Computer Vision
                Int J Comput Vis
                Springer Nature
                0920-5691
                1573-1405
                May 2009
                January 2009
                : 82
                : 3
                : 302-324
                Article
                10.1007/s11263-008-0202-0
                04820b6f-b81f-476d-aeed-51fa9cab1066
                © 2009
                History

                Comments

                Comment on this article