Efficient belief propagation for higher-order cliques using linear constraint nodes

Computer Vision and Image Understanding

Volumn 112, Issue 1, 2008, Pages 39-54

  Potetz, Brian ^a   Lee, Tai Sing ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Belief propagation; Continuous Markov random fields; Factor graphs; Higher order cliques; Non pairwise cliques

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHLORINE COMPOUNDS; COMPUTER VISION; FLOW INTERACTIONS; GRAPHIC METHODS; HIDDEN MARKOV MODELS; IMAGE ENHANCEMENT; IMAGE PROCESSING; IMAGE RECONSTRUCTION; JAVA PROGRAMMING LANGUAGE;

BELIEF PROPAGATION; CLIQUE SIZE; COMPUTER VISION PROBLEMS; CONTINUOUS MARKOV RANDOM FIELDS; FACTOR GRAPHS; GRAPHICAL MODELS; HIGHER-ORDER; HIGHER-ORDER CLIQUES; IMAGE-BASED-RENDERING; LINEAR CONSTRAINTS; MARKOV RANDOM FIELDS; NATURAL IMAGES; NON-PAIRWISE CLIQUES; NON-PARAMETRIC; PAIR-WISE INTERACTION; POTENTIAL FUNCTIONS; RANGE IMAGING; REAL-VALUED VARIABLES; SHAPE-FROM-SHADING;

CRACK PROPAGATION;

EID: 52949111496     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2008.05.007     Document Type: Article

References (52)

1. Dagum P., and Luby M. Approximating probabilistic inference in bayesian belief networks is np-hard. Artif. Intell. 60 1 (1993) 141-153
2. Freeman W.T., Pasztor E., and Carmichael O.T. Learning low-level vision. Int. J. Comput. Vis. 40 1 (2000) 25-47
3. Sun J., Zheng N.-N., and Shum H.-Y. Stereo matching using belief propagation. IEEE Trans. Pattern Anal. Mach. Intell. 25 7 (2003) 787-800
4. K.L. Tang, C.K. Tang, T.T. Wong, Dense photometric stereo using tensorial belief propagation, in: CVPR, 2005, pp. 132-139.
5. X. Lan, S. Roth, D.P. Huttenlocher, M.J. Black, Efficient belief propagation with learned higher-order markov random fields, in: ECCV, 2006, pp. 269-282.
6. N. Petrovic, I. Cohen, B.J. Frey, R. Koetter, T.S. Huang, Enforcing integrability for surface reconstruction algorithms using belief propagation in graphical models, in: CVPR, 2001, pp. 743-748.
7. Wang J., and Cohen M.F. An iterative optimization approach for unified image segmentation and matting. ICCV (2005) 936-943
8. T. Heskes, K. Albers, B. Kappen, Approximate inference and constrained optimization, in: UAI, 2003, pp. 313-320.
9. B. Potetz, Efficient belief propagation for vision using linear constraint nodes, in: CVPR 2007: Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society, Minneapolis, MN, USA, 2007.
10. O.J. Woodford, I.D. Reid, P.H.S. Torr, A.W. Fitzgibbon, Fields of experts for image-based rendering, in: Proceedings of the 17th British Machine Vision Conference, Edinburgh, vol. 3, 2006, pp. 1109-1108.
11. Boykov Y., Veksler O., and Zabih R. Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23 11 (2001) 1222-1239
12. Kolmogorov V., and Zabih R. What energy functions can be minimized via graph cuts?. ECCV'02: Proceedings of the 7th European Conference on Computer Vision-Part III (2002), Springer-Verlag, London, UK 65-81
13. 3 and beyond: solving energies with higher order cliques, in: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2007.
14. Geman S., and Deman D. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. Readings in Computer Vision: Issues, Problems, Principles, and Paradigms (1987), Morgan Kaufman Publishers Inc., San Francisco, CA, USA 564-584
15. E.B. Sudderth, A.T. Ihler, W.T. Freeman, A.S. Willsky, Nonparametric belief propagation, Tech. Rep. MIT//LIDS P-2551, MIT, Laboratory for Information and Decision Systems, 2002.
16. Kschischang F.R., and Frey B.J. Iterative decoding of compound codes by probability propagation in graphical models. IEEE J. Selected Areas Commun. 16 2 (1998) 219-230
17. K.P. Murphy, Y. Weiss, M.I. Jordan, Loopy belief propagation for approximate inference: an empirical study, in: UAI, 1999, pp. 467-475.
18. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufman, San Francisco, CA
19. J.S. Yedidia, W.T. Freeman, Y. Weiss, Generalized belief propagation, in: NIPS, 2000, pp. 689-695.
20. Weiss Y., and Freeman W.T. Correctness of belief propagation in gaussian graphical models of arbitrary topology. Neural Comput. 13 10 (2001) 2173-2200
21. Weiss Y., and Freeman W.T. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Trans. Inf. Theory 47 2 (2001) 736-744
22. Yuille A.L. Cccp algorithms to minimize the Bethe and Kikuchi free energies: convergent alternatives to belief propagation. Neural Comput. 14 7 (2002) 1691-1722
23. P.F. Felzenszwalb, D.P. Huttenlocher, Efficient belief propagation for early vision, in: CVPR, vol. 1, 2004, pp. 261-268.
24. Friedman J.H., Stuetzle W., and Schroeder A. Projection pursuit density estimation. J. Am. Stat. Assoc. 79 (1984) 599-608
25. Zhu S.C., Wu Y.N., and Mumford D. Minimax entropy principle and its applications to texture modeling. Neural Comput. 9 (1997) 1627-1660
26. Zhu S.C., Wu Y.N., and Mumford D. Frame: filters, random fields and maximum entropy-towards a unified theory for texture modeling. Int. J. Comput. Vis. 27 2 (1998) 1-20
27. G. Hinton, Products of experts, in: International Conference on Artificial Neural Networks, vol. 1, 1999, pp. 1-6.
28. S. Roth, M.J. Black, Fields of experts: a framework for learning image priors, in: CVPR, 2005, pp. 860-867.
29. Y. Weiss, W.T. Freeman, What makes a good model of natural images?, in: CVPR 2007: Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society, Minneapolis, MN, USA, 2007.
30. M.F. Tappen, Utilizing variational optimization to learn markov random fields, in: CVPR 2007: Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society, Minneapolis, MN, USA, 2007.
31. Coughlan J.M., and Yuille A.L. Algorithms from statistical physics for generative models of images. Image Vis. Comput. 21 1 (2003) 29-36
32. Deans S.R. The Radon Transform and Some of its Applications (1983), John Wiley & Sons
33. Portilla J., Strela V., Wainwright M.J., and Simoncelli E.P. Image denoising using scale mixtures of gaussians in the wavelet domain. IEEE Trans. Image Process. 12 11 (2003) 1338-1351
34. Witkin A., Terzopoulis D., and Kass M. Signal matching through scale space. Readings in Computer Vision: Issues, Problems, Principles, and Paradigms (1987), Morgan Kaufman Publishers Inc., San Francisco, CA, USA 759-764
35. J.R. Bergen, P. Anandan, K.J. Hanna, R. Hingorani, Hierarchical model-based motion estimation, in: ECCV'92: Proceedings of the Second European Conference on Computer Vision, Springer-Verlag, London, UK, 1992, pp. 237-252.
36. S. Livens, P. Scheunders, G.V. de Wouwer, P. Vautrot, D.V. Dyck, Wavelets for texture analysis, an overview, in: Proceedings of the IEE International Conference on Image Processing and Applications, Dublin, 1997, pp. 581-585.
37. Kumar S., and Hebert M. Discriminative random fields. Int. J. Comput. Vis. 68 2 (2006) 179-202
38. Cheng H., and Bouman C.A. Multiscale bayesian segmentation using a trainable context model. IEEE Trans. Image Process. 10 4 (2001) 511-525
39. Liao L., Fox D., and Kautz H. Location-based activity recognition. In: Weiss Y., Schölkopf B., and Platt J. (Eds). Advances in Neural Information Processing Systems 18 (2006), MIT Press, Cambridge, MA 787-794
40. N.L. Zhang, D. Poole, A simple approach to bayesian network computations, in: Proceedings of the of the Tenth Canadian Conference on Artificial Intelligence, 1994, pp. 171-178.
41. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernetica 11 (1993) 1-21
42. Yedidia J.S., Freeman W.T., and Weiss Y. Understanding belief propagation and its generalizations. Exploring Artificial Intelligence in the New Millennium (2003), Morgan Kaufman Publishers Inc., San Francisco, CA, USA 239-269
43. Heskes T. On the uniqueness of loopy belief propagation fixed points. Neural Comput. 16 11 (2004) 2379-2413
44. A.L. Yuille, An algorithm to minimize the Bethe free energy, in: EMMCVPR, 2001.
45. Wainwright M., Jaakkola T., and Willsky A. A new class of upper bounds on the log partition function. IEEE Trans. Inf. Theory 51 7 (2005) 2313-2335
46. Kolmogorov M.-V. Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28 10 (2006) 1568-1583
47. E. Sudderth, A. Ihler, W. Freeman, A. Willsky, Nonparametric belief propagation, in: CVPR, 2003.
48. M. Isard, Pampas: real-valued graphical models for computer vision, in: CVPR, 2003, pp. 613-620.
49. A. Kozlov, D. Koller, Nonuniform dynamic discretization in hybrid networks, in: UAI, 1997, pp. 314-332.
50. D. Koller, U. Lerner, D. Anguelov, A general algorithm for approximate inference and its application to hybrid bayes net, in: UAI, 1999, pp. 324-333.
51. J. Coughlan, H. Shen, Shape matching with belief propagation: using dynamic quantization to accommodate occlusion and clutter, in: CVPRW, 2004, p. 180.
52. Martin D., Fowlkes C., Tal D., and Malik J. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. ICCV (2001) 416-423