Mostrar el registro sencillo del ítem
Artículo
Approximating lower-star persistence via 2D combinatorial map simplification
dc.creator | Damiand, Guillaume | es |
dc.creator | Paluzo Hidalgo, Eduardo | es |
dc.creator | Slechta, Ryan | es |
dc.creator | González Díaz, Rocío | es |
dc.date.accessioned | 2020-06-22T15:23:30Z | |
dc.date.available | 2020-06-22T15:23:30Z | |
dc.date.issued | 2020 | |
dc.identifier.citation | Damiand, G., Paluzo Hidalgo, E., Slechta, R. y González Díaz, R. (2020). Approximating lower-star persistence via 2D combinatorial map simplification. Pattern Recognition Letters, 131 (march 2020), 314-321. | |
dc.identifier.issn | 0167-8655 | es |
dc.identifier.uri | https://hdl.handle.net/11441/98111 | |
dc.description.abstract | Filtration simplification consists of simplifying a given filtration while simultaneously controlling the perturbation in the associated persistence diagrams. In this paper, we propose a filtration simplification algorithm for orientable 2-dimensional (2D) manifolds with or without boundary ( meshes ) represented by2D combinatorial maps. Given a lower-star filtration of the mesh, faces are added into contiguous clusters according to a “height” function and a parameter . Faces in the same cluster are merged into a single face, resulting in a lower resolution mesh and a simpler filtration. We prove that the parameter bounds the perturbation in the original persistence diagrams, and we provide experiments demonstrating thecomputational advantages of the simplification process. | es |
dc.format | application/pdf | es |
dc.format.extent | 8 | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Pattern Recognition Letters, 131 (march 2020), 314-321. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Persistent homology computation | es |
dc.subject | 2D combinatorial map | es |
dc.subject | Mesh simplification | es |
dc.title | Approximating lower-star persistence via 2D combinatorial map simplification | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) | es |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/abs/pii/S0167865520300179 | es |
dc.identifier.doi | 10.1016/j.patrec.2020.01.018 | es |
dc.journaltitle | Pattern Recognition Letters | es |
dc.publication.volumen | 131 | es |
dc.publication.issue | march 2020 | es |
dc.publication.initialPage | 314 | es |
dc.publication.endPage | 321 | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
1-s2.0-S0167865520300179-main.pdf | 1.851Mb | ![]() | Ver/ | |