Dynamical programming for off-the-grid dynamic inverse problems
From MaRDI portal
Abstract: In this work we consider algorithms for reconstructing time-varying data into a finite sum of discrete trajectories, alternatively, an off-the-grid sparse-spikes decomposition which is continuous in time. Recent work showed that this decomposition was possible by minimising a convex variational model which combined a quadratic data fidelity with dynamical Optimal Transport. We generalise this framework and propose new numerical methods which leverage efficient classical algorithms for computing shortest paths on directed acyclic graphs. Our theoretical analysis confirms that these methods converge to globally optimal reconstructions which represent a finite number of discrete trajectories. Numerically, we show new examples for unbalanced Optimal Transport penalties, and for balanced examples we are 100 times faster in comparison to the previously known method.
Recommendations
- Towards off-the-grid algorithms for total variation regularized inverse problems
- Joint reconstruction and low-rank decomposition for dynamic inverse problems
- Efficient algorithms for the regularization of dynamic inverse problems: II. Applications
- Efficient algorithms for the regularization of dynamic inverse problems: I. Theory
Cites work
- scientific article; zbMATH DE number 3678487 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 1351867 (Why is no real title available?)
- scientific article; zbMATH DE number 3345848 (Why is no real title available?)
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- An interpolating distance between optimal transport and Fisher-Rao metrics
- An optimal transport approach for solving dynamic inverse problems in spaces of measures
- Dynamic spike superresolution and applications to ultrafast ultrasound imaging
- Exact support recovery for sparse spikes deconvolution
- Gradient flows in metric spaces and in the space of probability measures
- Introduction to algorithms.
- Inverse problems in spaces of measures
- Measurable selections of extrema
- Measure theory. Vol. I and II
- On extreme points of convex sets
- On representer theorems and convex regularization
- On the extremal points of the ball of the Benamou-Brenier energy
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Sparsity of solutions for variational inverse problems with finite-dimensional data
- Spike detection from inaccurate samplings
- Splines are universal solutions of linear inverse problems with generalized TV regularization
- The alternating descent conditional gradient method for sparse inverse problems
- Unbalanced optimal transport: dynamic and Kantorovich formulations
Cited in
(3)
This page was built for publication: Dynamical programming for off-the-grid dynamic inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122167)
