| Título |
Approximating lower-star persistence via 2D combinatorial map simplification |
| Autores |
Damiand, Guillaume , PALUZO HIDALGO, EDUARDO, Slechta, Ryan , Gonzalez-Diaz, Rocio |
| Publicación externa |
Si |
| Medio |
PATTERN RECOGNITION LETTERS |
| Alcance |
Article |
| Naturaleza |
Científica |
| Cuartil JCR |
2 |
| Cuartil SJR |
1 |
| Impacto JCR |
3.756 |
| Impacto SJR |
0.669 |
| Fecha de publicacion |
01/03/2020 |
| ISI |
000521971700042 |
| DOI |
10.1016/j.patrec.2020.01.018 |
| 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 by 2D combinatorial maps. Given a lower-star filtration of the mesh, faces are added into contiguous clusters according to a "height" function and a parameter epsilon. 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 epsilon bounds the perturbation in the original persistence diagrams, and we provide experiments demonstrating the computational advantages of the simplification process. (c) 2020 Elsevier B.V. All rights reserved. |
| Palabras clave |
Persistent homology computation; 2D combinatorial map; Mesh simplification |
| Miembros de la Universidad Loyola |
|
Gestionar cookies