SMI 2012: Full α-Decomposition of polygons

Decomposing a shape into visually meaningful parts comes naturally to humans, but recreating this fundamental operation in computers has been shown to be difficult. Similar challenges have puzzled researchers in shape reconstruction for decades. In this paper, we recognize the strong connection between shape reconstruction and shape decomposition at a fundamental level and propose a method called @a-decomposition. The @a-decomposition generates a space of decompositions parameterized by @a, the diameter of a circle convolved with the input polygon. As we vary the value of @a, some structural features appear and disappear quickly while others persist. Therefore, by analyzing the persistence of the features, we can determine better decompositions that are more robust to both geometrical and topological noises.

[1]  Carlo H. Séquin,et al.  2D Shape Decomposition and the Automatic Generation of Hierarchical Representations , 1998, Int. J. Shape Model..

[2]  I. Biederman.  Recognition-by-components: a theory of human image understanding. , 1987, Psychological review.

[3]  Jyh-Ming Lien,et al.  Dynamic Minkowski sum of convex shapes , 2011, 2011 IEEE International Conference on Robotics and Automation.

[4]  Alan Brunton,et al.  Segmenting animated objects into near-rigid components , 2010, The Visual Computer.

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

[6]  Meng Liu,et al.  Fast hierarchical animated object decomposition using approximately invariant signature , 2012, The Visual Computer.

[7]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[8]  Dominique Attali,et al.  Using polyballs to approximate shapes and skeletons , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[9]  Ron Wein.  Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method , 2006, ESA.

[10]  Marco Attene,et al.  Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection , 2008, Comput. Graph. Forum.

[11]  Melanie Mitchell,et al.  Combinatorial Shape Decomposition , 2007, ISVC.

[12]  Wenyu Liu,et al.  Convex shape decomposition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[14]  Nancy M. Amato,et al.  Approximate convex decomposition of polyhedra and its applications , 2008, Comput. Aided Geom. Des..

[15]  Sunghee Choi,et al.  The power crust, unions of balls, and the medial axis transform , 2001, Comput. Geom..

[16]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[17]  Nancy M. Amato,et al.  Approximate convex decomposition of polygons , 2006, Comput. Geom..

[18]  Tamal K. Dey,et al.  Shape Segmentation and Matching with Flow Discretization , 2003, WADS.

[19]  Xiaofeng Mi,et al.  Separating Parts from 2D Shapes using Relatability , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[20]  Gabriella Sanniti di Baja,et al.  Analyzing Nonconvex 2D and 3D Patterns , 1996, Comput. Vis. Image Underst..

[21]  Remco C. Veltkamp,et al.  Polygon decomposition based on the straight line skeleton , 2003, SCG '03.

[22]  J. Mark Keil,et al.  Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..

[23]  Gabriella Sanniti di Baja,et al.  Methods for hierarchical analysis of concavities , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[24]  Lili Wan.  Parts-based 2D shape decomposition by convex hull , 2009, 2009 IEEE International Conference on Shape Modeling and Applications.

[25]  Kaleem Siddiqi,et al.  Parts of Visual Form: Computational Aspects , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[26]  Mohamed S. Kamel,et al.  Shape representation using concavity graphs , 2002, Object recognition supported by user interaction for service robots.

[27]  Junsong Yuan,et al.  Minimum near-convex decomposition for robust shape representation , 2011, 2011 International Conference on Computer Vision.

[28]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[29]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[30]  Ulrich Eckhardt,et al.  Shape descriptors for non-rigid shapes with a single closed contour , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[31]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[32]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1994, ACM Trans. Graph..

[33]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[34]  Donald D. Hoffman,et al.  Salience of visual parts , 1997, Cognition.

[35]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.