Continuous Visibility Feature

In this work, we propose a new type of visibility measurement named Continuous Visibility Feature (CVF). We say that a point q on the mesh is continuously visible from another point p if there exists a geodesic path connecting p and q that is entirely visible by p. In order to efficiently estimate the continuous visibility for all the vertices in a model, we propose two approaches that use specific CVF properties to avoid exhaustive visibility tests. CVF is then measured as the area of the continuously visible region. With this stronger visibility measure, we show that CVF better encodes the surface and part information of mesh than the tradition line-of-sight based visibility. For example, we show that existing segmentation algorithms can generate better segmentation results using CVF and its variants than using other visibility-based shape descriptors, such as shape diameter function. Similar to visibility and other mesh surface features, continuous visibility would have many applications.

[1]  Daniel Cohen-Or,et al.  Shape Segmentation by Approximate Convexity Analysis , 2014, ACM Trans. Graph..

[2]  A. Ben Hamza,et al.  A multiresolution descriptor for deformable 3D shape retrieval , 2013, The Visual Computer.

[3]  Daniel Cohen-Or,et al.  Weak Convex Decomposition by Lines‐of‐sight , 2013, SGP '13.

[4]  Leonidas J. Guibas,et al.  A concise and provably informative multi-scale signature based on heat diffusion , 2009 .

[5]  Daniel Cohen-Or,et al.  A Part‐aware Surface Metric for Shape Analysis , 2009, Comput. Graph. Forum.

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

[7]  KleimanYanir,et al.  Shape Segmentation by Approximate Convexity Analysis , 2014 .

[8]  Raif M. Rustamov,et al.  Laplace-Beltrami eigenfunctions for deformation invariant shape representation , 2007 .

[9]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[10]  Ron Kimmel,et al.  On Bending Invariant Signatures for Surfaces , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Zhonghua Xi,et al.  Dual-Space Decomposition of 2D Complex Shapes , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[12]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

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

[14]  Vladlen Koltun,et al.  Joint shape segmentation with linear programming , 2011, ACM Trans. Graph..

[15]  Aaron Hertzmann,et al.  Learning 3D mesh segmentation and labeling , 2010, ACM Trans. Graph..

[16]  Stéphane Lafon,et al.  Diffusion maps , 2006 .

[17]  Andrew E. Johnson,et al.  Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Bernard Chazelle,et al.  Shape distributions , 2002, TOGS.

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

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

[21]  Bill Triggs,et al.  Histograms of oriented gradients for human detection , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[22]  Hao Zhang,et al.  Non-Rigid Spectral Correspondence of Triangle Meshes , 2007, Int. J. Shape Model..