Intuitively, a dialogue sequence has two properties:

1.  Every second shot is similar.

2. Adjacent and third shots are dissimilar.

We define a periodic analysis transform that operates only on the this topological space. Then, we use the Student's t-test of statistical significance to determine if a dialogue is present. The algorithm determines the longest dialogue sequence that is statistically significant. We have a best case result of 100% precision and 91% recall.