An introduction to an algorithm of persistent homology groups

TSUJI Shotaro

doi:10.11188/seisankenkyu.72.111

Bibliographic Information

Other Title

パーシステント・ホモロジー群の算法の紹介
パーシステント・ホモロジーグンノサンポウノショウカイ

Search this article

Description

<p>Persistent homology computes the change of the homology groups of a shape growing as a parameter increases. Persistent homology groups are defined for filtrations, which are increasing sequence of simplicial complexes. Vietoris-Rips complexes are filtrations constructed from point clouds. Persistent homology groups are computed with a variation of a reduction algorithm in linear algebra. An example of the computation is given in this article.</p>

Journal

SEISAN KENKYU

SEISAN KENKYU 72 (2), 111-116, 2020-03-01

Institute of Industrial Science The University of Tokyo