Tracking a Generator by Persistence

The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute not only the persistent homology for a filtered simplicial complex, but also representative generating cycles for persistent homology groups. However, if there are dynamic changes either in the filtration or in the underlying simplicial complex, the representative generating cycle can change wildly. In this paper, we consider the problem of tracking generating cycles with temporal coherence. Specifically, our goal is to track a chosen essential generating cycle so that the changes in it are “local”. This requires reordering simplices in the filtration. To handle reordering operations, we build upon the matrix framework proposed by Cohen-Steiner et al. [6] to swap two consecutive simplices, so that we can process a reordering directly. We present an application showing how our algorithm can track an ess...

• Type: Conference
• Year: 2010
• Where: COCOON
• Authors: Oleksiy Busaryev, Tamal K. Dey, Yusu Wang
• Keywords: COCOON 2010, Combinatorics, Generating Cycle, Persistent Homology, Representative Generating Cycle