8 citations · 10 across the 2 of their papers we have counts for
Showing math.ATShow all
3 papers · 1 filter
math.AT2019
Field choice problem in persistent homology
Ippei Obayashi, Michio Yoshiwaki
This paper tackles the problem of coefficient field choice in persistent homology. When we compute a persistence diagram, we need to select a coefficient field before computation.…
math.AT2017★ 2 cited
Volume Optimal Cycle: Tightest representative cycle of a generator on persistent homology
Ippei Obayashi
This paper shows a mathematical formalization, algorithms and computation software of volume optimal cycles, which are useful to understand geometric features shown in a persistenc…
math.AT2017★ 8 cited
Persistence Diagrams with Linear Machine Learning Models
Ippei Obayashi, Yasuaki Hiraoka
Persistence diagrams have been widely recognized as a compact descriptor for characterizing multiscale topological features in data. When many datasets are available, statistical f…