Fast Graph Sampling for Short Video Summarization using Gershgorin Disc Alignment

no code implementations • 21 Oct 2021 • Sadid Sahami, Gene Cheung, Chia-Wen Lin

We prove that, after partitioning $\mathcal{G}$ into $Q$ sub-graphs $\{\mathcal{G}^q\}^Q_{q=1}$, the smallest Gershgorin circle theorem (GCT) lower bound of $Q$ corresponding coefficient matrices -- $\min_q \lambda^-_{\min}(\mathbf{B}^q)$ -- is a lower bound for $\lambda_{\min}(\mathbf{B})$.

Graph Sampling Video Summarization