Bourgeois Pursuits

The Birth of Bourgeois Punishment

Probabilistic Pursuits on Graphs

We consider discrete dynamical systems of ”ant-like” agents engaged in a sequence of pursuits on a graph environment. The agents emerge one by one at equal time intervals from a source vertex s and pursue each other by greedily attempting to close the distance to their immediate predecessor, the agent that emerged just before them from s, until they arrive at the destination point t. Such pursu...

SNR Scalability with Matching Pursuits

In this paper, SNR scalable representations of video signals are studied. The investigated codecs are well suited for communications applications because they are all based on backward motion-compensated predictive coding, which provides the necessary low-delay property. In a Very-Low Bit Rate context (VLBR), the Matching Pursuits signal representation algorithm is used to represent the Displac...

Low Complexity Separable Matching Pursuits

Methods of reducing the complexity of the matching pursuits algorithm with minimal loss of fidelity when coding displaced frame difference (DFD) images in video compression are investigated. A full search using 2D basis functions is used as a benchmark. The use of separable 1D bases greatly reduces the complexity, and significant further reductions are achieved by using only a 1D inner product ...

Capture time of Brownian pursuits

τn = inf{t > 0 : Bi(t)− bi = B0(t) for some 1 ≤ i ≤ n}, where 0 < bi ≤ 1, 1 ≤ i ≤ n. The τn can be viewed as a capture time in a random pursuit setting. Assume that a Brownian prisoner escapes, running along the path of B0. In his pursuit, there are n independent Brownian policemen. These policemen run along the paths of B1, · · · , Bn, respectively. At the outset, the prisoner is ahead of the ...