A Novel Approach to Object/Background Segmentation Based on the Probabilistic Graphical Model
暂无分享,去创建一个
[1] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[2] Zoltan Kato,et al. A Markov random field image segmentation model for color textured images , 2006, Image Vis. Comput..
[3] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[5] Stan Z. Li,et al. Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.
[6] Fred S. Roberts,et al. Applied Combinatorics , 1984 .
[7] Richard Szeliski,et al. A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[8] Noel Cressie,et al. Conditional-mean least-squares fitting of Gaussian Markov random fields to Gaussian fields , 2008, Comput. Stat. Data Anal..
[9] S. Hyakin,et al. Neural Networks: A Comprehensive Foundation , 1994 .
[10] Charles E. Heckler,et al. Applied Multivariate Statistical Analysis , 2005, Technometrics.
[11] Azriel Rosenfeld,et al. Computer Vision , 1988, Adv. Comput..
[12] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[13] Shankar M. Krishnan,et al. Image segmentation using finite mixtures and spatial information , 2004, Image Vis. Comput..
[14] Jean Ponce,et al. Computer Vision: A Modern Approach , 2002 .
[15] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Linda G. Shapiro,et al. Computer Vision , 2001 .
[17] Gareth Funka-Lea,et al. Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.
[18] David Alcaide López de Pablo,et al. A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows , 2009, Eur. J. Oper. Res..
[19] Geoffrey J. McLachlan,et al. Maximum likelihood clustering via normal mixture models , 1996, Signal Process. Image Commun..
[20] Vladimir Kolmogorov,et al. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..
[21] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .