Asymmetrical occlusion handling using graph cut for multi-view stereo
暂无分享,去创建一个
[1] Aaron F. Bobick,et al. Large Occlusion Stereo , 1999, International Journal of Computer Vision.
[2] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[3] Vladimir Kolmogorov,et al. Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[4] Long Quan,et al. Match Propagation for Image-Based Modeling and Rendering , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Darius Burschka,et al. Advances in Computational Stereo , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[6] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7] Nanning Zheng,et al. Stereo Matching Using Belief Propagation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Andrew Blake,et al. Gaze manipulation for one-to-one teleconferencing , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[9] Vladimir Kolmogorov,et al. Multi-camera Scene Reconstruction via Graph Cuts , 2002, ECCV.
[10] Changming Sun,et al. Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques , 2002, International Journal of Computer Vision.
[11] Carlo Tomasi,et al. A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling , 1998, IEEE Trans. Pattern Anal. Mach. Intell..
[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.