An extension of the Felzenszwalb-Huttenlocher segmentation to 3D point clouds
暂无分享,去创建一个
[1] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[2] Andreas Nüchter,et al. Efficient processing of large 3D point clouds , 2011, 2011 XXIII International Symposium on Information, Communication and Automation Technologies.
[3] 智一 吉田,et al. Efficient Graph-Based Image Segmentationを用いた圃場図自動作成手法の検討 , 2014 .
[4] Bertrand Douillard,et al. On the segmentation of 3D LIDAR point clouds , 2011, 2011 IEEE International Conference on Robotics and Automation.
[5] Michel Barlaud,et al. Fast k nearest neighbor search using GPU , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.
[6] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[7] N. Otsu. A threshold selection method from gray level histograms , 1979 .
[8] Andrew W. Fitzgibbon,et al. An Experimental Comparison of Range Image Segmentation Algorithms , 1996, IEEE Trans. Pattern Anal. Mach. Intell..
[9] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[10] Rolf Adams,et al. Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[11] M. Bosse,et al. Automatic segmentation of 3D laser point clouds by ellipsoidal region growing , 2009, ICRA 2009.
[12] Jörg Stückler,et al. Efficient Multi-resolution Plane Segmentation of 3D Point Clouds , 2011, ICIRA.
[13] Leo Grady,et al. Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.