Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields

Journal of the ACM

Volumn 49, Issue 5, 2002, Pages 616-639

  Kleinberg, Jon ^a,b   Tardos, Éva ^a,b  

^a Department of Obstetrics Gynecology   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION PROBLEMS; METRIC FIELDS; PAIRWISE RELATIONSHIPS; RANDOM FIELDS;

ALGORITHMS; APPROXIMATION THEORY; COSTS; GRAPH THEORY; IMAGE PROCESSING; LABELING; MARKOV PROCESSES; METRIC SYSTEM; OPTIMIZATION; POLYNOMIALS;

LABELS;

EID: 1842545358     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/585265.585268     Document Type: Article

References (31)

1. BARTAL Y. 1996. Approximations of metric spaces, and its algorithmic applications. In Proc. IEEE Symposium on Foundations of Computer Science.
2. BARTAL, Y. 1998. On approximating arbitrary metrics by tree metrics. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York.
3. BESAG, J. 1974. Spatial interaction and the statistical analysis of lattice systems. J. Roy. Stat. Soc. B 36.
4. BESAG, J. 1986. On the statistical analysis of dirty pictures. J. Roy. Stat. Soc. B 48.
5. BOYKOV, Y., VEKSLER, O., AND ZABIH, R. 1998. Markov random fields with efficient approximations. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. IEEE computer Society Press, Los Alamtos, Calif.
6. BOYKOV, Y., VEKSLER, O., AND ZABIH, R. 1999. Fast approximate energy minimization via graph cuts. In Proceedings of the International Conference on Computer Vision.
7. BOYKOV, Y., VEKSLER, O., AND ZABIH, R. 2001. Fast approximate energy minimization via graph cuts. IEEE Trans. Patt. Anal. Mach. Intel. 23, 11 (Nov.), 1222-1239.
8. BREIMAN, L., FRIEDMAN, J. H., OLSHEN, R. A., AND STONE, C. J. 1984. Classification and Regression Trees. Wadsworth & Brooks/Cole.
9. CALINESCU, G., KARLOFF, H., AND RABANI, Y. 1998. Improved approximation algorithms for multiway cut. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York.
10. CHAKRABARTI, S., DOM, B., AND INDYK, P. 1998. Enhanced hypertext categorization using hyperlinks. In Proceedings of ACM SIGMOD. ACM, New York.
11. CHARIKAR, M., CHEKURI, C., GOEL, A., GUHA, S., AND PLOTKIN, S. 1998. Approximating arbitrary metrics by O (n log n) trees. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
12. CHELLAPPA, R., AND JAIN, A. 1993. Markov Random Fields: Theory and Applications. Academic Press, Orlando, Fla.
13. COHEN, F. S. 1986. Markov random fields for image modeling and analysis. In Modeling and Application of Stochastic Processes, U. B. Desai, Ed. Kluwer.
14. CUNNINGHAM, W. H., AND TANG, L. 1994. Optimal 3-terminal cuts and linear programming. In Proceedings of the MPS Conference on Integer Programming and Combinatorial Optimization.
15. DAHLHAUS, E., JOHNSON, D., PAPADIMITRIOU, C., SEYMOUR, P., AND YANNAKAKIS, M. 1994. The complexity of multi-terminal cuts. SIAM J. Comput. 23.
16. DIETTERICH, T. G. 1997. Machine learning research: Four current directions. AI Mag. 18.
17. DUBES, R., AND JAIN, A. 1989. Random field models in image analysis. J. Appl. Stat. 16.
18. ERDÖS, P. L., AND SZÉKELY, L. A. 1992. Evolutionary trees: An integer multicommodity max-flow min-cut theorem. Adv. Appl. Math 13.
19. FERRARI, P., FRIGESSI, A., AND DE SA, P. 1995. Fast approximate maximum a posteriori restoration of multi-color images. J. Roy. Stat. Soc. B 57.
20. GEMAN, S., AND GEMAN, D. 1984, Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans. Patt. Anal. Mach. Intell. 6.
21. GREIG, D., PORTEOUS, B., AND SEHEULT, A. 1989. Exact maximum a posteriori estimation for binary Images. J. Roy. Stat. Soc. B 48.
22. ISHIKAWA, H., AND GEIGER, D. 1998. Segmentation by grouping junctions. In IEEE Conference on Computer Vision Pattern Recognition, pp. 125-131.
23. KARGER, D. R., KLEIN, P., STEIN, C., THORUP, M., AND YOUNG, N. E. 1999. Rounding algorithms for a geometric embedding of multiway cut. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York.
24. KARZANOV, A. V. 1998. Minimum 0-extension of graph metrics. Europ. J. Combinat. 19.
25. KINDERMAN, R., AND SNELL, J. 1980. Markov Random Fields and their Applications. AMS Press.
26. Li, S. 1995. Markov Random Field Modeling in Computer Vision. Springer-Verlag. New York.
27. PARDALOS, P., AND WOLKOWICZ, H. 1994. Quadratic assignment and related problems. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16.
28. POTTS, R. 1952. Some generalized order-disorder transformations. Proc. Cambridge Phil. Soc. 48.
29. QUEYRANNE, M. 1986. Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Oper. Res. Lett. 4.
30. ROY, S., AND Cox, I. 1998. A maximum-flow formulation of the n-camera stereo correspondence problem. In Proceedings of the 6th International Conference on Computer Vision.
31. WOODS, J. W. 1972. Two-dimensional discrete Markovian fields. IEEE Trans. Inf. Theory 18.