From Frames to Features: Scalable Zigzag Persistence for Binary Video

Zigzag persistence tracks topological features in spatio-temporal data through combinatorial invariants called barcodes.

For binary videos, existing methods are bottlenecked by the construction of prohibitively large cubical complexes and performing Gaussian elimination on large boundary matrices, rendering high-resolution videos out of reach.

We show that the $H_0$ and $H_1$ barcodes can be extracted directly from connected-component dynamics.

By encoding these dynamics in a graph, we bypass cubical complexes entirely and are able to leverage the near-linear time barcode decomposition algorithm by Dey and Hou, leading to significant speedups.

The total runtime of our pipeline is dominated by the construction of the underlying graph structures, which scales linearly with pixel count and is embarrassingly parallel across frames, ensuring excellent scalability.

We demonstrate how this approach enables zigzag persistence on 4k video at real-time rates on consumer hardware.