Approximation algorithms for the metric labeling problem via a new linear programming formulation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 109-118

  Chekuri, Chandra ^a   Khanna, Sanjeev ^b   Naor, Joseph ^c   Zosin, Leonid ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d ITG Inc   (United States)

Author keywords

Algorithms; Design; Measurement; Theory; Verification

Indexed keywords

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

References (22)

1. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.184, October 14-16, 1996
2. Yair Bartal, On approximating arbitrary metrices by tree metrics, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.161-168, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/ 276698.276725]
3. Y. Boykov, O. Veksler, R. Zabih, Markov Random Fields with Efficient Approximations, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p.648, June 23-25, 1998
4. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In Proceedings of the 7th IEEE International Conference on Computer Vision, pages 377-384, 1999.
5. Yuri Boykov, Olga Veksler, Ramin Zabih, A New Algorithm for Energy Minimization with Discontinuities, Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, p.205-220, July 26-29, 1999
6. Gruia Cǎlinescu, Howard Karloff, Yuval Rabani, An improved approximation algorithm for multiway cut, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.48-52, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/276698.276711]
7. Gruia Calinescu, Howard Karloff, Yuval Rabani, Approximation algorithms for the 0-extension problem, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.8-16, January 07-09, 2001, Washington, D.C., United States
8. Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.114-123, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/276698.276719]
9. Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge Plotkin, Approximating a Finite Metric by a Small Number of Tree Metrics, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.379, November 08-11, 1998
10. Fernand S Cohen, Markov random fields for image modelling and analysis, Modelling and applications of stochastic processes, Kluwer, B.V., Deventer, The Netherlands, 1986
11. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis, The Complexity of Multiterminal Cuts, SIAM Journal on Computing, v.23 n.4, p.864-894, Aug. 1994 [doi〉10.1137/S0097539792225297]
12. David R. Karger, Philip Klein, Cliff Stein, Mikkel Thorup, Neal E. Young, Rounding algorithms for a geometric embedding of minimum multiway cut, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.668-678, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/ 301250.301430]
13. R. Dubes and A. Jain. Random field models in image analysis. J. of Applied Statistics, 16, 1989.
14. D. Greig, B. Porteous, and A. Seheult. Exact maximum a posteriori estimation for binary images. J. of Royal Statistical Society B, 48, 1989.
15. Anupam Gupta, Éva Tardos, A constant factor approximation algorithm for a class of classification problems, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.652-658, May 21-23, 2000, Portland, Oregon, United States [doi〉10.1145/335305.335397]
16. H. Ishikawa, D. Geiger, Segmentation by Grouping Junctions, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p.125, June 23-25, 1998
17. H. Ishikawa and D. Geiger. Mapping Image Restoration to a Graph Problem. In Proceedings of the 1999 IEEE-EURASIP Workshop on Nonlinear Signal and Image Processing, pages 20.-23, 1999.
18. Alexander V. Karzanov, Minimum 0-extensions of graph metrics, European Journal of Combinatorics, v.19 n.1, p.71-101, Jan., 1998 [doi〉10.1006/eujc. 1997.0154]
19. A. Karzanov. A combinatorial algorithm for the minimum (2, r)-metric problem and some generalizations. Combinatorica, 18(4):549-569, 1999.
20. Jon Kleinberg, Eva Tardos, Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.14, October 17-18, 1999
21. S. Z. Li, Markov random field modeling in computer vision, Springer-Verlag, London, 1995
22. Sébastien Roy, Ingemar J. Cox, A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem, Proceedings of the Sixth International Conference on Computer Vision, p.492, January 04-07, 1998