Parallel Imaging Problem
暂无分享,去创建一个
[1] Robert Krauthgamer,et al. Approximate classification via earthmover metrics , 2004, SODA '04.
[2] 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).
[3] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[4] Éva Tardos,et al. A constant factor approximation algorithm for a class of classification problems , 2000, STOC '00.
[5] Joseph Naor,et al. The hardness of metric labeling , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[6] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[7] Joseph Naor,et al. A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem , 2005, SIAM J. Discret. Math..
[8] Éva Tardos,et al. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 2002, JACM.
[9] Gurmeet Singh,et al. MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts , 2006, CVPR.
[10] Stan Z. Li,et al. Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.
[11] Davi Geiger,et al. Segmentation by grouping junctions , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).
[12] VekslerOlga,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001 .