Using combinatorial optimization within max-product belief propagation

Advances in Neural Information Processing Systems

Volumn , Issue , 2007, Pages 369-376

  Duchi, John ^a   Tarlow, Daniel ^a   Elidan, Gal ^a   Koller, Daphne ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION; BELIEF PROPAGATION ALGORITHM; BIPARTITE MATCHINGS; COMBINATORIAL OPTIMIZATION ALGORITHM; CORRESPONDENCE PROBLEMS; GEOMETRIC CONSTRAINT; IMPROVED CONVERGENCE; MARKOV RANDOM FIELDS; MATCHING CONSTRAINTS; MAX-PRODUCT; MAXIMUM A POSTERIORI; MINIMUM CUT; MUTUAL EXCLUSIONS; REAL NETWORKS; REGULAR NETWORKS; RUNNING TIME; SUB-NETWORK; SUBNETWORKS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; IMAGE CODING; IMAGE MATCHING; OPTIMIZATION;

NETWORK CODING;

EID: 84864047140     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. D. Anguelov, D. Koller, P. Srinivasan, S. Thrun, H. Pang, and J. Davis. The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces. In NIPS, 2004.
2. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In ICCV, 1999.
3. G. Elidan, I. McGraw, and D. Koller. Residual belief propagation. In UAI, 2006.
4. J. Hooker, G. Ottosson, E.S. Thorsteinsson, and H.J. Kim. A scheme for unifying optimization and constraint satisfaction methods. In Knowledge Engineering Review, 2000.
5. H. Ishikawa. Exact optimization for Markov random fields with convex priors. PAMI, 2003.
6. J. Kleinberg and E. Tardos. Algorithm Design. Addison-Wesley, 2005.
7. P. Kohli and P. Torr. Measuring uncertainty in graph cut solutions - efficiently computing min-marginal energies using dynamic graph cuts. In ECCV, 2006.
8. V. Kolmogorov and M. Wainwright. On the optimality of tree-reweighted max-product message-passing. In UAI '05.
9. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? In ECCV, 2002.
10. E. Lawler. The quadratic assignment problem. In Management Science, 1963.
11. K. Murphy and Y. Weiss. Loopy belief propagation for approximate inference: An empirical study. In UAI '99.
12. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
13. A. Raj, G. Singh, and R. Zabih. MRF's for MRI's: Bayesian reconstruction of MR images via graph cuts. In CVPR, 2006. To appear.
14. C. Rother, S. Kumar, V. Kolmogorov, and A. Blake. Digital tapestry. In CVPR, 2005.
15. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 2000.
16. T. Stützle and M. Dorigo. ACO algorithms for the quadratic assignment problem. In New Ideas in Optimization. 1999.
17. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for Markov random fields. In ECCV, 2006.
18. B. Taskar, V. Chatalbashev, and D. Koller. Learning associative markov networks. In ICML '04.
19. B. Taskar, V. Chatalbashev, D. Koller, and C. Guestrin. Learning structured prediction models: a large margin approach. In ICML '05.
20. Y.Weiss andW. Freeman. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory, 47, 2001.