Image segmentation with minimum mean cut
暂无分享,去创建一个
[1] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[2] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[3] Richard M. Karp,et al. A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..
[4] Ramesh C. Jain,et al. Using Dynamic Programming for Solving Variational Problems in Vision , 1990, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Richard M. Leahy,et al. An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[6] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[7] Alok Gupta,et al. Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Ingemar J. Cox,et al. "Ratio regions": a technique for image segmentation , 1996, Proceedings of 13th International Conference on Pattern Recognition.
[9] Fan Chung,et al. Spectral Graph Theory , 1996 .
[10] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[11] Ian H. Jermyn,et al. Globally optimal regions and boundaries , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[12] William J. Cook,et al. Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..
[13] Olga Veksler,et al. Image segmentation by nested cuts , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).