Approximate labeling via graph cuts based on linear programming

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 29, Issue 8, 2007, Pages 1436-1453

  Komodakis, Nikos ^a   Tziritas, Georgios ^a  

^a UNIVERSITY OF CRETE   (Greece)

Author keywords

Early vision; Global optimization; Graph algorithms; Graph labeling; Graph theoretic methods; Image restoration; Linear programming; Markov Random Fields; Motion; Pixel classification; Stereo

Indexed keywords

GRAPH ALGORITHMS; GRAPH LABELING; GRAPH--THEORETIC METHODS; PIXEL CLASSIFICATION;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER VISION; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; MARKOV PROCESSES;

IMAGE RECONSTRUCTION;

EID: 34447280839     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2007.1061     Document Type: Article

References (23)

1. Y. Boykov, O. Veksler, and R. Zabih, "Fast Approximate Energy Minimization via Graph Cuts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, Nov. 2001.
2. J. Kleinberg and E. Tardos, "Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields," J. ACM, vol. 49, pp. 616-630, 2002.
3. O. Veksler, "Efficient Graph-Based Energy Minimization Methods in Computer Vision," PhD dissertation, Cornell Univ., 1999.
4. S. Roy and I. Cox, "A Maximum-Flow Formulation of the n-Camera Stereo Correspondence Problem," Proc. Sixth IEEE Int'l Conf. Computer Vision, 1998.
5. A. Gupta and E. Tardos, "Constant Factor Approximation Algorithms for a Class of Classification Problems," Proc. 32nd Ann. ACM Symp. Theory of Computing, pp. 652-658, 2000.
6. H. Ishikawa and D. Geiger, "Segmentation by Grouping Junctions," Proc. Conf. Computer Vision and Pattern Recognition, 1998.
7. C. Chekuri, S. Khanna, J. Naor, and L. Zosin, "Approximation Algorithms for the Metric Labeling Problem via a New Linear Programming Formulation," Proc. 12th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 109-118, 2001.
8. A. Archer, J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, K. Talvar, and E. Tardos, "Approximate Classification via Earth-mover Metrics," Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms, 2004.
9. N. Komodakis and G. Tziritas, "A New Framework for Approximate Labeling via Graph-Cuts," Proc. 10th IEEE Int'l Conf. Computer Vision, 2005.
10. N. Komodakis and G. Tziritas, "Approximate Labeling via the Primal-Dual Schema," Technical Report CSD-TR-05-01, Computer Science Dept., http://www.csd.uoc.gr/~komod/publications/docs/ CSD_TR_2005_01.pdf, Feb. 2005.
11. M. Wainwright, T. Jaakkola, and A. Willsky, "Map Estimation via Agreement on (Hyper)Trees: Messagepassing and Linear Programming Approaches," Proc. 40th Ann. Allerton Conf. Comm., Control, and Computing, 2002.
12. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
13. V. Kolmogorov and R. Zabih, "Multi-Camera Scene Reconstruction via Graph Cuts," Proc. Seventh European Conf. Computer Vision, pp. 82-96, 2002.
14. R. Zabih and V. Kolmogorov, "Spatially Coherent Clustering Using Graph Cuts," Proc. Conf. Computer Vision and Pattern Recognition, pp. 437-444, 2004.
15. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
16. V. Kolmogorov, "Convergent Tree-Reweighted Message Passing for Energy Minimization," Proc. 10th Int'l Workshop Artificial Intelligence and Statistics, 2005.
17. T. Meltzer, C. Yanover, and Y. Weiss, "Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation," Proc. 10th IEEE Int'l Conf. Computer Vision, 2005.
18. V. Vazirani, Approximation Algorithms. Springer, 2001.
19. C. Rother, S. Kumar, V. Kolmogorov, and A. Blake, "Digital Tapestry," Proc. Conf. Computer Vision and Pattern Recognition, 2005.
20. D. Scharstein and R. Szeliski, "A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms," Int'l J. Computer Vision, vol. 47, nos. 1-3, pp. 7-42, Apr.-June 2002.
21. M.F. Tappen and W.T. Freeman, "Comparison of Graph Cuts with Belief Propagation for Stereo, Using Identical mrf Parameters," Proc. Ninth IEEE Int'l Conf. Computer Vision, pp. 900-907, 2003.
22. M.J. Black and P. Anandan, "The Robust Estimation of Multiple Motions: Parametric and Piecewise-Smooth Flow Fields," Computer Vision and Image Understanding, vol. 63, no. 1, pp. 75-104, 1996.
23. A. Bruhn, J. Weickert, and C. Schnörr, "Lucas/Kanade Meets Horn/Schunck: Combining Local and Global Optic Flow Methods," Int'l J. Computer Vision, vol. 61, no. 3, pp. 211-231, 2005.