Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields
暂无分享,去创建一个
[1] R. B. Potts. Some generalized order-disorder transformations , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] John W. Woods,et al. Two-dimensional discrete Markovian fields , 1972, IEEE Trans. Inf. Theory.
[3] J. Besag. Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .
[4] J. Laurie Snell,et al. Markov Random Fields and Their Applications , 1980 .
[5] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6] J. Besag. On the Statistical Analysis of Dirty Pictures , 1986 .
[7] M. Queyranne. Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems , 1986 .
[8] Fernand S. Cohen,et al. Markov random fields for image modelling and analysis , 1986 .
[9] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[10] Anil K. Jain,et al. Random field models in image analysis , 1989 .
[11] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .
[12] P. Erdös,et al. Evolutionary trees: An integer multicommodity max-flow-min-cut theorem , 1992 .
[13] Mihalis Yannakakis,et al. The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..
[14] Panos M. Pardalos,et al. Quadratic Assignment and Related Problems , 1994 .
[15] Stan Z. Li,et al. Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.
[16] A. Frigessi,et al. Fast Approximate Maximum a Posteriori Restoration of Multicolour Images , 1995 .
[17] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[18] Thomas G. Dietterich. Machine-Learning Research Four Current Directions , 1997 .
[19] John D. Lafferty,et al. Inducing Features of Random Fields , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[20] Ingemar J. Cox,et al. A maximum-flow formulation of the N-camera stereo correspondence problem , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).
[21] Yuval Rabani,et al. An improved approximation algorithm for multiway cut , 1998, STOC '98.
[22] Piotr Indyk,et al. Enhanced hypertext categorization using hyperlinks , 1998, SIGMOD '98.
[23] Davi Geiger,et al. Segmentation by grouping junctions , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).
[24] Alexander V. Karzanov,et al. Minimum 0-Extensions of Graph Metrics , 1998, Eur. J. Comb..
[25] Olga Veksler,et al. Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).
[26] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[27] Mikkel Thorup,et al. Rounding algorithms for a geometric embedding of minimum multiway cut , 1999, STOC '99.
[28] C. Stein,et al. Better Rounding Algorithms for a Geometric Embedding Relaxation of Minimum Multiway Cut , 1999, Symposium on the Theory of Computing.
[29] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[30] William H. Cunningham,et al. Optimal 3-Terminal Cuts and Linear Programming , 1999, IPCO.
[31] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[32] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.