The Community for Technology Leaders
Green Image
Issue No. 12 - December (2011 vol. 33)
ISSN: 0162-8828
pp: 2538-2544
Yu-Shen Liu , Tsinghua University, Beijing
Karthik Ramani , Purdue University, West Lafayette
Min Liu , Tsinghua University, Beijing
ABSTRACT
A new visibility graph-based algorithm is presented for computing the inner distances of a 3D shape represented by a volumetric model. The inner distance is defined as the length of the shortest path between landmark points within the shape. The inner distance is robust to articulation and can reflect the deformation of a shape structure well without an explicit decomposition. Our method is based on the visibility graph approach. To check the visibility between pairwise points, we propose a novel, fast, and robust visibility checking algorithm based on a clustering technique which operates directly on the volumetric model without any surface reconstruction procedure, where an octree is used for accelerating the computation. The inner distance can be used as a replacement for other distance measures to build a more accurate description for complex shapes, especially for those with articulated parts. The binary executable program for the Windows platform is available from https://engineering.purdue.edu/PRECISE/VMID.
INDEX TERMS
Inner distance, visibility graph, articulated shape descriptor, volumetric models.
CITATION
Yu-Shen Liu, Karthik Ramani, Min Liu, "Computing the Inner Distances of Volumetric Models for Articulated Shape Description with a Visibility Graph", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 33, no. , pp. 2538-2544, December 2011, doi:10.1109/TPAMI.2011.116
97 ms
(Ver )