Image Segmentation Using Iterated Graph Cuts Based on Multi-scale Smoothing
暂无分享,去创建一个
Takeo Kanade | Hironobu Fujiyoshi | Tomoyuki Nagahashi | T. Kanade | H. Fujiyoshi | Tomoyuki Nagahashi
[1] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Marie-Pierre Jolly,et al. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[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] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[5] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[6] W. Eric L. Grimson,et al. Adaptive background mixture models for real-time tracking , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).
[7] Gareth Funka-Lea,et al. Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.
[8] S. Osher,et al. A level set approach for computing solutions to incompressible two-phase flow , 1994 .
[9] Demetri Terzopoulos,et al. Snakes: Active contour models , 2004, International Journal of Computer Vision.