Computing the Inner Distances of Volumetric Models for Articulated Shape Description with a Visibility Graph
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 refle...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 33(2011), 12 vom: 13. Dez., Seite 2538-44 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2011
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Journal Article Research Support, N.I.H., Extramural Research Support, Non-U.S. Gov't |
| Online verfügbar |
Volltext |