Extracting curve-skeletons from digital shapes using occluding contours

Curve-skeletons are compact and semantically relevant shape descriptors, able to summarise both topology and pose of a wide range of digital objects. Most of the state-of-the-art algorithms for their computation rely on the type of geometric primitives used and sampling frequency. In this paper, we introduce a formally sound and intuitive definition of a curve-skeleton, then we propose a novel method for skeleton extraction that relies on the visual appearance of the shapes. To achieve this result, we inspect the properties of occluding contours, showing how information about the symmetry axes of a 3D shape can be inferred from a small set of its planar projections. The proposed method is fast, insensitive to noise and resolution, capable of working with different shape representations, and easy to implement.

[1]  D. Cohen-Or,et al.  Curve skeleton extraction from incomplete point cloud , 2009, SIGGRAPH 2009.

[2]  Tamal K. Dey,et al.  Defining and computing curve-skeletons with medial geodesic function , 2006, SGP '06.

[3]  In-Kwon Lee,et al.  Curve reconstruction from unorganized points , 2000, Comput. Aided Geom. Des..

[4]  Andrea Tagliasacchi,et al.  Mean Curvature Skeletons , 2012, Comput. Graph. Forum.

[5]  D. Marr,et al.  Representation and recognition of the spatial organization of three-dimensional shapes , 1978, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[6]  S. Pizer,et al.  Three-dimensional reconstruction of curves from pairs of projection views in the presence of error. I. Algorithms. , 1997, Medical physics.

[7]  Martial Hebert,et al.  A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[8]  Erin W. Chambers,et al.  A simple and robust thinning algorithm on cell complexes , 2010, Comput. Graph. Forum.

[9]  Aly A. Farag,et al.  Robust centerline extraction framework using level sets , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[11]  Adam Finkelstein,et al.  Perceptual models of viewpoint preference , 2011, TOGS.

[12]  Ariel Shamir,et al.  On‐the‐fly Curve‐skeleton Computation for 3D Shapes , 2007, Comput. Graph. Forum.

[13]  M. Brady,et al.  Smoothed Local Symmetries and Their Implementation , 1984 .

[14]  David A. Forsyth,et al.  Generalizing motion edits with Gaussian processes , 2009, ACM Trans. Graph..

[15]  Aldo Laurentini.  How Many 2D Silhouettes Does It Take to Reconstruct a 3D Object? , 1997, Comput. Vis. Image Underst..

[16]  Tong-Yee Lee,et al.  Curve-Skeleton Extraction Using Iterative Least Squares Optimization , 2008, IEEE Transactions on Visualization and Computer Graphics.

[17]  Tong-Yee Lee,et al.  Skeleton extraction by mesh contraction , 2008, SIGGRAPH 2008.

[18]  Deborah Silver,et al.  Curve-skeleton applications , 2005, VIS 05. IEEE Visualization, 2005..

[19]  Junjie Cao,et al.  Point Cloud Skeletons via Laplacian Based Contraction , 2010, 2010 Shape Modeling International Conference.

[20]  S M Pizer,et al.  Three-dimensional reconstruction of curves from pairs of projection views in the presence of error. II. Analysis of error. , 1997, Medical physics.

[21]  Arun K. Pujari,et al.  Volume intersection with optimal set of directions , 1991, Pattern Recognit. Lett..

[22]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[23]  Riccardo Scateni,et al.  Reconstructing the Curve-Skeletons of 3D Shapes Using the Visual Hull , 2012, IEEE Transactions on Visualization and Computer Graphics.

[24]  Balasubramanian Raman,et al.  Computing hierarchical curve-skeletons of 3D objects , 2005, The Visual Computer.

[25]  M. Pauly,et al.  Discrete scale axis representations for 3D geometry , 2010, SIGGRAPH 2010.

[26]  Michael M. Kazhdan,et al.  Fast Mean‐Curvature Flow via Finite‐Elements Tracking , 2011, Comput. Graph. Forum.

[27]  Gérard G. Medioni,et al.  Useful geometric properties of the generalized cone , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[28]  LaurentiniAldo.  How Far 3D Shapes Can Be Understood from 2D Silhouettes , 1995 .

[29]  D. Marr,et al.  Analysis of occluding contour , 1977, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[30]  Elaine Cohen,et al.  Generalized Swept Mid‐structure for Polygonal Models , 2012, Comput. Graph. Forum.

[31]  Aldo Laurentini,et al.  How Far 3D Shapes Can Be Understood from 2D Silhouettes , 1995, IEEE Trans. Pattern Anal. Mach. Intell..