A graph encoding of connected-component dynamics enables direct extraction of H0 and H1 zigzag barcodes for binary video, bypassing cubical complexes and achieving linear-time scaling via Dey-Hou decomposition.
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
From Frames to Features: Scalable Zigzag Persistence for Binary Video
A graph encoding of connected-component dynamics enables direct extraction of H0 and H1 zigzag barcodes for binary video, bypassing cubical complexes and achieving linear-time scaling via Dey-Hou decomposition.