2015-06-292015-06-2920101885-4508http://hdl.handle.net/11441/26180The 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 informationapplication/pdfengAtribución-NoComercial-SinDerivadas 4.0 Españahttp://creativecommons.org/licenses/by-nc-nd/4.0/Mayer-Vietoris formulaersistence diagramsshape occlusionssub-part detectioninfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://idus.us.es/xmlui/handle/11441/26180