Dual-Space Decomposition of 2D Complex Shapes

While techniques that segment shapes into visually meaningful parts have generated impressive results, these techniques also have only focused on relatively simple shapes, such as those composed of a single object either without holes or with few simple holes. In many applications, shapes created from images can contain many overlapping objects and holes. These holes may come from sensor noise, may have important parts of the shape or may be arbitrarily complex. These complexities that appear in real-world 2D shapes can pose grand challenges to the existing part segmentation methods. In this paper, we propose a new decomposition method, called Dual-space Decomposition that handles complex 2D shapes by recognizing the importance of holes and classifying holes as either topological noise or structurally important features. Our method creates a nearly convex decomposition of a given shape by segmenting both the polygon itself and its complementary. We compare our results to segmentation produced by nonexpert human subjects. Based on two evaluation methods, we show that this new decomposition method creates statistically similar to those produced by human subjects.

[1]  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,.

[2]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

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

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

[5]  Nancy M. Amato,et al.  alpha-Decomposition of polygons , 2012, Comput. Graph..

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

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

[8]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

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

[10]  Junsong Yuan,et al.  Minimum Near-Convex Shape Decomposition , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[12]  B. Chazelle,et al.  Optimal Convex Decompositions , 1985 .

[13]  Thomas A. Funkhouser,et al.  A benchmark for 3D mesh segmentation , 2009, ACM Trans. Graph..

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

[15]  J. Hershberger,et al.  Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .

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

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

[18]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.

[19]  Larry S. Davis,et al.  Recognition of head gestures using hidden Markov models , 1996, Proceedings of 13th International Conference on Pattern Recognition.

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

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

[22]  Nancy M. Amato,et al.  α-Decompositionα-Decomposition of polygons ☆ , 2012 .

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

[24]  Jack Snoeyink,et al.  On the time bound for convex decomposition of simple polygons , 1998, CCCG.

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

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

[27]  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).

[28]  Kaleem Siddiqi,et al.  Parts of visual form: computational aspects , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[29]  Nancy M. Amato,et al.  Approximate convex decomposition of polygons , 2004, SCG '04.

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

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

[32]  Jyh-Ming Lien,et al.  Dynamic Minkowski sums under scaling , 2013, Comput. Aided Des..

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

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