Evaluation of a First-Order Primal-Dual Algorithm for MRF Energy Minimization

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Energy Minimization Methods in Computer Vision and Pattern Recognition

• Publication date

  2011-07-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-23094-3_7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Aging and vision.

  2011cited by this paper
• A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling

  2011influential reference
• A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging

  2011influential reference
• Matrix Computations

  2011cited by this paper
• Convex optimization

  2010cited by this paper
• A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R "

  2009cited by this paper
• A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors

  2008cited by this paper
• Graphical Models, Exponential Families, and Variational Inference

  2008cited by this paper
• MRF Optimization via Dual Decomposition: Message-Passing Revisited

  2007cited by this paper
• A Linear Programming Approach to Max-Sum Problem: A Review

  2007cited by this paper
• Combinatorial Optimization: Theory and Algorithms

  2007cited by this paper
• Convergent Tree-Reweighted Message Passing for Energy Minimization

  2006cited by this paper
• Proof of Theorem 3

  2005cited by this paper
• Smooth minimization of non-smooth functions

  2005cited by this paper
• Proof of Theorem 2

  2005cited by this paper
• Factor graphs and the sum-product algorithm

  2001cited by this paper
• Matrix computations (3rd ed.)

  1996cited by this paper
• Combinatorial Optimization

  1992cited by this paper
• A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n

  1986cited by this paper
• Syntactic analysis of two-dimensional visual signals in the presence of noise

  1976cited by this paper

• Structured Prediction Problem Archive

  2022cites this paper
• One-sided Frank-Wolfe algorithms for saddle problems

  2021cites this paper
• Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions

  2020cites this paper
• Discrete Graphical Models - An Optimization Perspective

  2019cites this paper
• MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models

  2018cites this paper
• MAP Inference via Block-Coordinate Frank-Wolfe Algorithm

  2018cites this paper
• A Weighted Mirror Descent Algorithm for Nonsmooth Convex Optimization Problem

  2016cites this paper
• Partial Optimality by Pruning for MAP-Inference with General Graphical Models

  2014cites this paper
• Advanced Structured Prediction

  2014influential citation
• 1 The Power of LP Relaxation for MAP Inference

  2013cites this paper
• Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation

  2013cites this paper
• A New Look at Reweighted Message Passing

  2013cites this paper
• Advanced Structured Prediction

  2013cites this paper
• A bundle approach to efficient MAP-inference by Lagrangian relaxation

  2012cites this paper
• Getting Feasible Variable Estimates from Infeasible Ones: MRF Local Polytope Study

  2012influential citation
• Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing

  2012cites this paper