3D shape recursive decomposition by Poisson equation

This paper proposes a novel algorithm that decomposes the 3D shape into meaningful parts based on Poisson equation. The whole algorithm is divided into three steps. Firstly, shape signature is defined with Poisson equation. Secondly, the binary decomposition based on shape signature is recursively performed to get a coarse decomposition result. Finally, the graph-based minimum cut is used to refine the jaggy boundaries in the initial result. The proposed algorithm not only obtains a set of meaningful parts, but also is robust in the case of deformation, rotation and other transformations. Furthermore, it can process large 3D shapes in an efficient way.

[1]  Lakshman Prasad.  Rectification of the chordal axis transform skeleton and criteria for shape decomposition , 2007, Image Vis. Comput..

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

[3]  Lijun Chen,et al.  An efficient and robust algorithm for 3D mesh segmentation , 2006, Multimedia Tools and Applications.

[4]  Tiow Seng Tan,et al.  Decomposing polygon meshes for interactive applications , 2001, I3D '01.

[5]  Jianning Xu.  Efficient morphological shape representation with overlapping disk components , 2001, IEEE Trans. Image Process..

[6]  Gabriella Sanniti di Baja,et al.  Using distance transforms to decompose 3D discrete objects , 2002, Image Vis. Comput..

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

[8]  Martin D. Levine,et al.  3D Part Segmentation Using Simulated Electrical Charge Distributions , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Sang Uk Lee,et al.  A new shape decomposition scheme for graph-based representation , 2005, Pattern Recognit..

[10]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[11]  Jianning Xu.  Hierarchical representation of 2-D shapes using convex polygons: A morphological approach , 1997, Pattern Recognit. Lett..

[12]  Mongi A. Abidi,et al.  Perception-based 3D triangle mesh segmentation using fast marching watersheds , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[13]  Donald D. Hoffman,et al.  Parsing silhouettes: The short-cut rule , 1999, Perception & psychophysics.

[14]  Ayellet Tal,et al.  Mesh segmentation using feature point and core extraction , 2005, The Visual Computer.

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

[16]  Ariel Shamir,et al.  A formulation of boundary mesh segmentation , 2004 .

[17]  Donald D. Hoffman,et al.  Parts of recognition , 1984, Cognition.

[18]  Marco Attene,et al.  Mesh Segmentation - A Comparative Study , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[19]  Robert M. Haralick,et al.  Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Mohamed S. Kamel,et al.  Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach , 2005, Pattern Recognit. Lett..

[21]  Georgios Papaioannou,et al.  A Fast Depth-Buffer-Based Voxelization Algorithm , 1999, J. Graphics, GPU, & Game Tools.

[22]  R. Basri,et al.  Shape representation and classification using the Poisson equation , 2004, CVPR 2004.