Min-cut based segmentation of point clouds

We present a min-cut based method of segmenting objects in point clouds. Given an object location, our method builds a k-nearest neighbors graph, assumes a background prior, adds hard foreground (and optionally background) constraints, and finds the min-cut to compute a foreground-background segmentation. Our method can be run fully automatically, or interactively with a user interface. We test our system on an outdoor urban scan, quantitatively evaluate our algorithm on a test set of about 1000 objects, and compare to several alternative approaches.

[1]  Martial Hebert,et al.  Robust extraction of multiple structures from non-uniformly sampled data , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[2]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.

[3]  B. Schiele,et al.  Combined Object Categorization and Segmentation With an Implicit Shape Model , 2004 .

[4]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[5]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Bernard Chazelle,et al.  Strategies for polyhedral surface decomposition: an experimental study , 1995, SCG '95.

[7]  Ross T. Whitaker,et al.  Partitioning 3D Surface Meshes Using Watershed Segmentation , 1999, IEEE Trans. Vis. Comput. Graph..

[8]  Ayellet Tal,et al.  Metamorphosis of Polyhedral Surfaces using Decomposition , 2002, Comput. Graph. Forum.

[9]  Ayellet Tal,et al.  Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003, ACM Trans. Graph..

[10]  Hao Zhang,et al.  Segmentation of 3D meshes through spectral clustering , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[11]  T. Rabbani,et al.  SEGMENTATION OF POINT CLOUDS USING SMOOTHNESS CONSTRAINT , 2006 .

[12]  Ayellet Tal,et al.  Polyhedral surface decomposition with applications , 2002, Comput. Graph..

[13]  Vladimir G. Kim,et al.  Shape-based recognition of 3D point clouds in urban environments , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[14]  Leonidas J. Guibas,et al.  Shape segmentation using local slippage analysis , 2004, SGP '04.

[15]  George Vosselman,et al.  Segmentation of point clouds using smoothness constraints , 2006 .

[16]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[17]  Daniel Cohen-Or,et al.  Consistent mesh partitioning and skeletonisation using the shape diameter function , 2008, The Visual Computer.

[18]  Ariel Shamir,et al.  Segmentation and Shape Extraction of 3D Boundary Meshes , 2006, Eurographics.

[19]  Frank Van Reeth,et al.  Hierarchical PCA Decomposition of Point Clouds , 2006, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06).

[20]  Ligang Liu,et al.  Easy Mesh Cutting , 2006, Comput. Graph. Forum.