Opened Access An entropy-based persistence barcode

Show item statistics
Export to
Author: Chintakunta, Harish
Gentimis, Thanos
González Díaz, Rocío
Jiménez Rodríguez, María José
Krim, Hamid
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I
Date: 2015
Published in: Pattern Recognition, 48 (2), 391-401.
Document type: Article
Abstract: In persistent homology, the persistence barcode encodes pairs of simplices meaning birth and death of homology classes. Persistence barcodes depend on the ordering of the simplices (called a filter) of the given simplicial complex. In this paper, we define the notion of “minimal” barcodes in terms of entropy. Starting from a given filtration of a simplicial complex K, an algorithm for computing a “proper” filter (a total ordering of the simplices preserving the partial ordering imposed by the filtration as well as achieving a persistence barcode with small entropy) is detailed, by way of computation, and subsequent modification, of maximum matchings on subgraphs of the Hasse diagram associated to K. Examples demonstrating the utility of computing such a proper ordering on the simplices are given.
Size: 1.029Mb
Format: PDF



This work is under a Creative Commons License: 
Atribución-NoComercial-CompartirIgual 4.0 Internacional

This item appears in the following Collection(s)