Solving MRF minimization by mirror descent

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7431 LNCS, Issue PART 1, 2012, Pages 587-598

  Luong, Duy V N ^a   Parpas, Panos ^a   Rueckert, Daniel ^a   Rustem, Berç ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE STEP SIZE; CONVERGENCE ANALYSIS; CONVERGENCE PROPERTIES; CONVERGENCE RATES; DUAL PROBLEM; EUCLIDEAN; LINEAR CONSTRAINTS; MARKOV RANDOM FIELDS; MINIMIZATION PROBLEMS; NON-DIFFERENTIABLE; OBJECTIVE FUNCTIONS; OPTIMAL STEP-SIZE; VISION PROBLEMS;

ALGORITHMS; COMPUTER VISION; ENTROPY;

MIRRORS;

EID: 84866695934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33179-4_56     Document Type: Conference Paper

References (14)

1. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1222-1239 (2001)
2. Yedidia, J.S., Freeman, W.T., Weiss, Y.: Understanding belief propagation and its generalizations. In: Exploring Artificial Intelligence in the New Millennium, pp. 239-269 (2003)
3. Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Map estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Trans. on Information Theory 51, 3697-3717 (2005)
4. Komodakis, N., Paragios, N., Tziritas, G.: Mrf energy minimization and beyond via dual decomposition. IEEE Trans. Pattern Anal. Mach. Intell. 33, 531-552 (2011)
5. Savchynskyy, B., Schmidt, S., Kappes, J., Schnorr, C.: A study of nesterov's scheme for lagrangian decomposition and map labeling. In: Computer Vision and Pattern Recognition, pp. 1817-1823 (2011)
6. Schmidt, M.: Ugm: Matlab code for undirected graphical models (2011)
7. Jancsary, J., Matz, G.: Convergent decomposition solvers for tree-reweighted free energies. Journal of Machine Learning Research
8. Ben-tal, A., Margalit, T., Nemirovski, A.: The ordered subsets mirror descent optimization method with applications to tomography. SIAM Journal on Optimization 12 (2001)
9. Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters (2003)
10. Juditsky, A., Nemirovski, A.: First order methods for nonsmooth convex large-scale optimization, i: General purpose methods. In: Optimization for Machine Learning. MIT Press (2010)
11. Jojic, V., Gould, S., Koller, D.: Accelerated dual decomposition for map inference. In: International Conference of Machine Learning, pp. 503-510 (2010)
12. Censor, Y., Zenios, S.A.: Proximal minimization algorithm with d-functions. Journal of Optimization Theory and Applications 73, 451-464 (1992)
13. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)
14. Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for mrfs. IEEE Trans. Pattern Anal. Mach. Intell., 1068-1080 (2008)