暂无分享,去创建一个
[1] C. Zach. Fast and High Quality Fusion of Depth Maps , 2008 .
[2] Sven Oesau,et al. Indoor Scene Reconstruction using Primitive-driven Space Partitioning and Graph-cut , 2013, UDMV.
[3] L. R. Dice. Measures of the Amount of Ecologic Association Between Species , 1945 .
[4] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[5] Thomas K. Peucker,et al. 2. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature , 2011 .
[6] VekslerOlga,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001 .
[7] Steven M. Seitz,et al. Schematic surface reconstruction , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[8] Dorin Comaniciu,et al. Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[9] Noah Snavely. Photo Tourism : Exploring image collections in 3D , 2006 .
[10] Jianxiong Xiao,et al. Reconstructing the World’s Museums , 2012, International Journal of Computer Vision.
[11] Jean Ponce,et al. Accurate, Dense, and Robust Multiview Stereopsis , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Michael M. Kazhdan,et al. Poisson surface reconstruction , 2006, SGP '06.
[13] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .