
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tomáš Werner, "Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 8, pp. 14741488, August, 2010.  
BibTex  x  
@article{ 10.1109/TPAMI.2009.134, author = {Tomáš Werner}, title = {Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {32}, number = {8}, issn = {01628828}, year = {2010}, pages = {14741488}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2009.134}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction IS  8 SN  01628828 SP1474 EP1488 EPD  14741488 A1  Tomáš Werner, PY  2010 KW  Weighted constraint satisfaction KW  Gibbs distribution KW  graphical model KW  Markov random field KW  linear programming relaxation KW  marginal polytope KW  cut polytope KW  cuttingplane algorithm KW  global constraint KW  supermodularity KW  treereweighted maxproduct. VL  32 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] P. Meseguer, F. Rossi, and T. Schiex, "Soft Constraints," Handbook of Constraint Programming, chapter 9, Elsevier, 2006.
[2] P.L. Hammer, P. Hansen, and B. Simeone, "Roof Duality, Complementation and Persistency in Quadratic 01 Optimization," Math. Programming, vol. 28, pp. 121155, 1984.
[3] M.I. Schlesinger, "Syntactic Analysis of TwoDimensional Visual Signals in Noisy Conditions," Cybernetics and Systems Analysis, vol. 12, no. 4, pp. 612628, 1976, translation from Russian, Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh, Kibernetika, vol. 12, no. 4, pp. 113130, 1976.
[4] V.A. Kovalevsky and V.K. Koval, "A Diffusion Algorithm for Decreasing Energy of MaxSum Labeling Problem," approx. 1975, Glushkov Inst. of Cybernetics, unpublished.
[5] M.I. Schlesinger, "personal communication, 20002005.
[6] V.K. Koval and M.I. Schlesinger, "Dvumernoe Programmirovanie v Zadachakh Analiza Izobrazheniy (TwoDimensional Programming in Image Analysis Problems)," USSR Academy of Science, Automatics, and Telemechanics, vol. 8, pp. 149168, 1976 (in Russian).
[7] T. Werner, "A Linear Programming Approach to MaxSum Problem: A Review," Technical Report CTUCMP200525, Center for Machine Perception, Czech Technical Univ., Dec. 2005.
[8] T. Werner, "A Linear Programming Approach to MaxSum Problem: A Review," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 7, pp. 11651179, July 2007.
[9] T. Werner, "HighArity Interactions, Polyhedral Relaxations, and Cutting Plane Algorithm for Soft Constraint Optimisation (MAPMRF)," Proc. IEEE Computer Vision and Pattern Recognition Conf., June 2008.
[10] F. Rossi, P. van Beek, and T. Walsh, Handbook of Constraint Programming. Elsevier, 2006.
[11] D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin, "The Complexity of Soft Constraint Satisfaction," Artificial Intelligence, vol. 170, pp. 9831016, 2006.
[12] M.C. Cooper, S. de Givry, M. Sánchez, T. Schiex, and M. Zytnicki, "Virtual Arc Consistency for Weighted CSP," Proc. Conf. Artificial Intelligence, pp. 253258, July 2008.
[13] U. Montanari, "Networks of Constraints: Fundamental Properties and Application to Picture Processing," Information Science, vol. 7, pp. 95132, 1974.
[14] A. Rosenfeld, R.A. Hummel, and S.W. Zucker, "Scene Labeling by Relaxation Operations," IEEE Trans. Systems, Man, and Cybernetics, vol. 6, no. 6, pp. 420433, June 1976.
[15] D. Schlesinger, "Exact Solution of Permuted Submodular MinSum Problems," Proc. Conf. Energy Minimization Methods in Computer Vision and Pattern Recognition, pp. 2838, 2007.
[16] M.J. Wainwright and M.I. Jordan, "Graphical Models, Exponential Families, and Variational Inference," Technical Report 649, Dept. of Statistics, Univ. of California, Berkeley, 2003.
[17] M. Wainwright, T. Jaakkola, and A. Willsky, "MAP Estimation via Agreement on (Hyper)Trees: Message Passing and Linear Programming Approaches," IEEE Trans. Information Theory, vol. 51, no. 11, pp. 36973717, Nov. 2005.
[18] M.J. Wainwright and M.I. Jordan, "Graphical Models, Exponential Families, and Variational Inference," Foundations and Trends in Machine Learning, vol. 1, nos. 1/2, pp. 1305, 2008.
[19] V. Kolmogorov, "Convergent TreeReweighted Message Passing for Energy Minimization," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 15681583, Oct. 2006.
[20] J.K. Johnson, D.M. Malioutov, and A.S. Willsky, "Lagrangian Relaxation for MAP Estimation in Graphical Models," Proc. Allerton Conf. Comm., Control and Computing, 2007.
[21] N. Komodakis, N. Paragios, and G. Tziritas, "MRF Optimization via Dual Decomposition: MessagePassing Revisited," Proc. Int'l Conf. Computer Vision, 2007.
[22] D.P. Bertsekas, Nonlinear Programming. Athena Scientific, 1999.
[23] Y. Weiss, C. Yanover, and T. Meltzer, "MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies," Proc. Conf. Uncertainty in Artificial Intelligence, 2007.
[24] C. Rother, T. Minka, A. Blake, and V. Kolmogorov, "Cosegmentation of Image Pairs by Histogram Matching—Incorporating a Global Constraint into MRFs," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2006.
[25] A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen, "The Partial Constraint Satisfaction Problem: Facets and Lifting Theorems," Operations Research Letters, vol. 23, nos. 35, pp. 8997, 1998.
[26] D. Sontag and T. Jaakkola, "New Outer Bounds on the Marginal Polytope," Proc. Neural Information Processing Systems, 2007.
[27] M.P. Kumar and P.H.S. Torr, "Efficiently Solving Convex Relaxations for MAP Estimation," Proc. Int'l Conf. Machine Learning, pp. 680687, 2008.
[28] N. Komodakis and N. Paragios, "Beyond Loose LPrelaxations: Optimizing MRFs by Repairing Cycles," Proc. European Conf. Computer Vision, 2008.
[29] D. Sontag, T. Meltzer, A. Globerson, T. Jaakkola, and Y. Weiss, "Tightening LP Relaxations for MAP Using Message Passing," Proc. Conf. Uncertainty in Artificial Intelligence, 2008.
[30] M.M. Deza and M. Laurent, Geometry of Cuts and Metrics. Springer, 1997.
[31] F. Barahona and A.R. Mahjoub, "On the Cut Polytope," Math. Programming, vol. 36, no. 2, pp. 157173, 1986.
[32] S. Lauritzen, Graphical Models. Oxford Univ. Press, 1996.
[33] A. Mackworth, "Constraint Satisfaction," Encyclopaedia of Artificial Intelligence, pp. 285292, John Wiley and Sons, 1991.
[34] D. Cohen and P. Jeavons, "The Complexity of Constraint Languages," Handbook of Constraint Programming, chapter 8, Elsevier, 2006.
[35] J.K. Pearson and P.G. Jeavons, "A Survey of Tractable Constraint Satisfaction Problems," Technical Report CSDTR9715, Royal Holloway, Univ. of London, July 1997.
[36] C. Bessiere, "Constraint Propagation," Handbook of Constraint Programming, chapter 3, Elsevier, 2006.
[37] R. Debruyne and C. Bessière, "Domain Filtering Consistencies," J. Artificial Intelligence Research, vol. 14, pp. 205230, 2001.
[38] E.C. Freuder, "A Sufficient Condition for BacktrackFree Search," J. ACM, vol. 29, no. 1, pp. 2432, 1982.
[39] T. Werner, "Marginal Consistency: Unifying Constraint Propagation on Commutative Semirings," Proc. Int'l Workshop Preferences and Soft Constraints (CoLocated with Conf. Principles and Practice of Constraint Programming), pp. 4357, Sept. 2008.
[40] C. Bliek and D. SamHaroud, "Path Consistency on Triangulated Constraint Graphs," Proc. Int'l Joint Conf. Artificial Intelligence, pp. 456461, 1999.
[41] M.I. Schlesinger, "False Minima of the Algorithm for Minimizing Energy of MaxSum Labeling Problem," Glushkov Inst. of Cybernetics, unpublished, 1976.
[42] V.N. Kolmogorov and M.J. Wainwright, "On the Optimality of TreeReweighted MaxProduct MessagePassing," Proc. Conf. Uncertainty in Artificial Intelligence, 2005.
[43] A. Globerson and T. Jaakkola, "Fixing MaxProduct: Convergent Message Passing Algorithms for MAP LPRelaxations," Proc. Neural Information Processing Systems, pp. 553560, 2008.
[44] T. Werner and A. Shekhovtsov, "Unified Framework for SemiringBased Arc Consistency and Relaxation Labeling," Proc. 12th Computer Vision Winter Workshop, pp. 2734, Feb. 2007.
[45] M.I. Schlesinger and V.V. Giginjak, "Solving (max,+) Problems of Structural Pattern Recognition Using Equivalent Transformations," Upravlyayushchie Sistemy i Mashiny (Control Systems and Machines), vols. 1/2, 2007 (in Russian), English translation available.
[46] P. Ravikumar, A. Agarwal, and M.J. Wainwright, "MessagePassing for GraphStructured Linear Programs: Proximal Projections, Convergence and Rounding Schemes," Proc. Int'l Conf. Machine Learning, pp. 800807, 2008.
[47] W.J. van Hoeve and I. Katriel, "Global Constraints," Handbook of Constraint Programming, chapter 7, Elsevier, 2006.
[48] C. Bessière and P.V. Hentenryck, "To Be or Not to Be ... a Global Constraint," Proc. Conf. Principles and Practice of Constraint Programming, pp. 789794, 2003.
[49] R. Gupta, A.A. Diwan, and S. Sarawagi, "Efficient Inference with CardinalityBased Clique Potentials," Proc. Int'l Conf. Machine Learning, pp. 329336, 2007.
[50] M.I. Schlesinger and B. Flach, "Some Solvable Subclasses of Structural Recognition Problems," Proc. Czech Pattern Recognition Workshop, 2000.
[51] D.M. Topkis, Supermodularity and Complementarity. Princeton Univ. Press, 1998.
[52] R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwal, M. Tappen, and C. Rother, "A Comparative Study of Energy Minimization Methods for Markov Random Fields," Proc. European Conf. Computer Vision, vol. II, pp. 1629, 2006.
[53] V. Kolmogorov and C. Rother, "Comparison of Energy Minimization Algorithms for Highly Connected Graphs," Proc. European Conf. Computer Vision, vol. II, pp. 115, 2006.
[54] E. Gregoir, B. Mazure, and C. Piette, "MUST: Provide a FinerGrained Explanation of Unsatisfiability," Proc. Conf. Principles and Practice of Constraint Programming, pp. 317331, 2007.
[55] F. Hemery, C. Lecoutre, L. Sais, and F. Boussemart, "Extracting MUCs from Constraint Networks," Proc. European Conf. Artificial Intelligence, pp. 113117, 2006.
[56] A. Globerson and T. Jaakkola, "Approximate Inference Using Planar Graph Decomposition," Proc. Neural Information Processing Systems, pp. 473480, 2006.
[57] N.N. Schraudolph and D. Kamenetsky, "Efficient Exact Inference in Planar Ising Models," Proc. Neural Information Processing Systems, pp. 14171424, 2008.