Generalized Multi-camera Scene Reconstruction Using Graph Cuts
暂无分享,去创建一个
[1] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[2] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] Vladimir Kolmogorov,et al. Multi-camera Scene Reconstruction via Graph Cuts , 2002, ECCV.
[4] Davi Geiger,et al. Occlusions, Discontinuities, and Epipolar Lines in Stereo , 1998, ECCV.
[5] Vladimir Kolmogorov,et al. Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[6] R. Zabih,et al. Exact voxel occupancy with graph cuts , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).
[7] A. Laurentini,et al. The Visual Hull Concept for Silhouette-Based Image Understanding , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Kiriakos N. Kutulakos,et al. A Theory of Shape by Space Carving , 2000, International Journal of Computer Vision.
[9] 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).
[10] Richard Szeliski,et al. Vision Algorithms: Theory and Practice , 2002, Lecture Notes in Computer Science.
[11] 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).
[12] Richard Szeliski,et al. Handling occlusions in dense multi-view stereo , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.
[13] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[14] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[15] Jake K. Aggarwal,et al. TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2008 .
[16] Andrew Blake,et al. Surface shape from the deformation of apparent contours , 1992, International Journal of Computer Vision.
[17] 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.
[18] Stephen T. Barnard,et al. Stochastic stereo matching over scale , 1989, International Journal of Computer Vision.
[19] Richard Szeliski,et al. An Experimental Comparison of Stereo Algorithms , 1999, Workshop on Vision Algorithms.
[20] Richard Szeliski,et al. Rapid octree construction from image sequences , 1993 .
[21] Steven M. Seitz,et al. Photorealistic Scene Reconstruction by Voxel Coloring , 1997, International Journal of Computer Vision.
[22] Richard Szeliski,et al. A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.