Scheduling trains with delayed departures
Abstract
A number of image transformations may be expressed as shortes paths algorithms in various algebras We introduce a general framework where a graph is considered as a railway network on which the trains follow shortest paths. Given a fixed traveling time on each edge and an arbitrary distribution of departure times, one searches the first arrival time of a train at each node. This formulation leads to interesting filters and image decomposition in the (min,+) algebra and sheds new light on flooding and razing algorithms in the algebras (min,max) and (max,min).
Origin : Files produced by the author(s)
Loading...