Dynamic discrete tomography
From MaRDI portal
Publication:4634750
DOI10.1088/1361-6420/aaa202zbMath1478.68392arXiv1712.04217OpenAlexW3105107389MaRDI QIDQ4634750
Peter Gritzmann, Andreas Alpers
Publication date: 11 April 2018
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.04217
computational complexityefficient algorithmsmulti-target trackingparticle trackingdiscrete inverse problemsdynamic discrete tomographymulti-assignments
Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45) Inverse problems in optimal control (49N45)
Related Items
Weighted microscopic image reconstruction, The first 100 years of the Radon transform, On Double-Resolution Imaging and Discrete Tomography, The generalized microscopic image reconstruction problem, Weighted microscopic image reconstruction, Relaxed and approximate graph realizations
Cites Work
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Approximating the multi-level bottleneck assignment problem
- A theorem on flows in networks
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Stability results for uniquely determined sets from two directions in discrete tomography
- Geometric three-dimensional assignment problems
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- Binary vectors partially determined by linear equation systems
- An LP-based algorithm for the data association problem in multitarget tracking.
- Discrete tomography. Foundations, algorithms, and applications
- Geometric versions of the three-dimensional assignment problem under general norms
- A Monge property for the \(d\)-dimensional transportation problem
- Tracking elementary particles near their primary vertex: A combinatorial approach
- Perspectives of Monge properties in optimization
- Integer programming models for the multidimensional assignment problem with star costs
- Some assignment problems arising from multiple target tracking
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
- Uniqueness in Discrete Tomography: Three Remarks and a Corollary
- Combinatorial Properties of Matrices of Zeros and Ones
- Assignment Problems
- Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums
- Online Multi-Target Tracking With Unified Handling of Complex Scenarios
- Reducibility among Combinatorial Problems
- On Stability, Error Correction, and Noise Compensation in Discrete Tomography
- Experimental and Efficient Algorithms
- Compressed Motion Sensing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
