Time Surface

Say we have a stream of visual events:

$e v_{i} = {[x_{i}, t_{i}, p_{i}]}^{T}, i \in N$

where $e v_{i}$ is the ith event, and consists of a location $x_{i}$ , time $t_{i}$ and polarity $p_{i} \in {- 1, 1}$ .

Time surface $S_{i}$ of event $e v_{i}$ keeps track of the activity surrounding the spatial location $x_{i}$ .

We define the time-context \mathcal{T}_i(\mathbf{u}, p) around an incoming event $e v_{i}$ as the array of most recent event times at $t_{i}$ for the pixels in the $(2 R + 1) \times (2 R + 1)$ square neighbourhood centered at $x_{i}$ as:

$T_{i} (u, p) = max_{i \leq i} {t_{j} ∣ x_{j} = (x_{i} + u), p_{j} = p}$

where $u_{x, y} \in {- R, \dots, R}$ . Then $S_{i} (u, p)$ is the obtained by applying an exponential decay kernel with time constant $τ$ on $T$ :

$S_{i} (u, p) = e^{- (t_{i} - T_{i} (u, p)) / τ}$

The time surface provides dynamic spatiotemporal context around an event, and the exponential decay expands the activity of passed events and provides information about the history of the activity in the neighbourhood.

Bibliography

Lagorce, Xavier, Garrick Orchard, Francesco Galluppi, Bertram E. Shi, and Ryad B. Benosman. n.d. “HOTS: A Hierarchy of Event-Based Time-Surfaces for Pattern Recognition” 39 (7):1346–59.

Jethro's Braindump

Time Surface

Bibliography

Links to this note