Persistent homology and partial matching of shapes
The ability to perform not only global matching but also partial matching is in-vestigated in computer vision and computer graphics in order to evaluate the performance of shape descriptors. In my talk I will consider the persistent homology shape descriptor, and Iwill illustrate some results about...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/26180 |
| Acceso en línea: | http://hdl.handle.net/11441/26180 |
| Access Level: | acceso abierto |
| Palabra clave: | Mayer-Vietoris formula ersistence diagrams shape occlusions sub-part detection |
| Sumario: | The ability to perform not only global matching but also partial matching is in-vestigated in computer vision and computer graphics in order to evaluate the performance of shape descriptors. In my talk I will consider the persistent homology shape descriptor, and Iwill illustrate some results about persistence diagrams of occluded shapes and partial shapes. The main tool is a Mayer-Vietoris formula for persistent homology. Theoretical results indicate that persistence diagrams are able to detect a partial matching between shapes by showing a common subset of points both in the one-dimensional and the multi-dimensionalsetting. Experiments will be presented which outline the potential of the proposed approach in recognition tasks in the presence of partial information |
|---|