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.
Computing and Visualizing Time-Varying Merge Trees for High-Dimensional Data
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
MS-COOT uses co-optimal transport on hypergraph representations of Morse-Smale complexes to enable explicit region-to-region matching for identifying structural events such as splitting and merging.
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.
-
MS-COOT: Comparing Morse-Smale Complexes with Co-Optimal Transport
MS-COOT uses co-optimal transport on hypergraph representations of Morse-Smale complexes to enable explicit region-to-region matching for identifying structural events such as splitting and merging.