Paper Info
Title
Dynamic Discrete Tomography
Abstract
We consider the problem of reconstructing the paths of a set of points over time, where, at each of a finite set of moments in time the current positions of points in space are only accessible through some small number of their x-rays. This particular particle tracking problem, with applications, e.g. in plasma physics, is the basic problem in dynamic discrete tomography. We introduce and analyze various different algorithmic models. In particular, we determine the computational complexity of the problem (and various of its relatives) and derive algorithms that can be used in practice. As a byproduct we provide new results on constrained variants of min-cost flow and matching problems.
Year
DOI
Venue
2017
10.1088/1361-6420/aaa202
INVERSE PROBLEMS
Keywords
DocType
Volume
dynamic discrete tomography, particle tracking, multi-target tracking, multi-assignments, discrete inverse problems, efficient algorithms, computational complexity
Journal
34
Issue
ISSN
Citations 
3
0266-5611
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Andreas Alpers100.34
Peter Gritzmann241246.93