Vincent Duval
Research Subjects
Vincent Duval has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Gabriel Peyré
And ENS CNRS PSL Université
18 shared publications - Antonin Chambolle
Université Paris-Dauphine, France
7 shared publications Gabriel Peyré
3 shared publications- Guillaume Carlier
CEREMADE, UMR CNRS 7534, Université Paris Dauphine, PSL, Paris Cedex 16, France
3 shared publications - Jean-David Benamou
INRIA PARIS MOKAPLAN Team 48 Rue Barrault 75013 Paris France
3 shared publications Jean-François Aujol
3 shared publications
Latest Publications
- Open Access
A variational method for curve extraction with curvature-dependent energies
We introduce a variational approach for extracting curves between a list of possible endpoints, based on the discretization of an energy and Smirnov's decomposition theorem for vector fields. It is used to design a bi-level minimization approach to automatically extract curves and 1D structures from an image, which is mostly unsupervised. We extend then the method to curvature-dependent energies, using a now classical lifting of the curves in the space of positions and orientations equipped with an appropriate sub-Riemanian or Finslerian metric.
Open AccessA variational method for curve extraction with curvature-dependent energies
We introduce a variational approach for extracting curves between a list of possible endpoints, based on the discretization of an energy and Smirnov's decomposition theorem for vector fields. It is used to design a bi-level minimization approach to automatically extract curves and 1D structures from an image, which is mostly unsupervised. We extend then the method to curvature-dependent energies, using a now classical lifting of the curves in the space of positions and orientations equipped with an appropriate sub-Riemanian or Finslerian metric.
- Open Access
- 12 September 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (10) , 105012
Exact recovery of the support of piecewise constant images via total variation regularization
This work is concerned with the recovery of piecewise constant images from noisy linear measurements. We study the noise robustness of a variational reconstruction method, which is based on total (gradient) variation regularization. We show that, if the unknown image is the superposition of a few simple shapes, and if a non-degenerate source condition holds, then, in the low noise regime, the reconstructed images have the same structure: they are the superposition of the same number of shapes, each a smooth deformation of one of the unknown shapes. Moreover, the reconstructed shapes and the associated intensities converge to the unknown ones as the noise goes to zero.
- 12 September 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (10) , 105012
Open AccessExact recovery of the support of piecewise constant images via total variation regularization
This work is concerned with the recovery of piecewise constant images from noisy linear measurements. We study the noise robustness of a variational reconstruction method, which is based on total (gradient) variation regularization. We show that, if the unknown image is the superposition of a few simple shapes, and if a non-degenerate source condition holds, then, in the low noise regime, the reconstructed images have the same structure: they are the superposition of the same number of shapes, each a smooth deformation of one of the unknown shapes. Moreover, the reconstructed shapes and the associated intensities converge to the unknown ones as the noise goes to zero.
- Open Access
- 9 February 2024
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 30, 7
Dynamical programming for off-the-grid dynamic inverse problems
In this work we consider off-the-grid algorithms for the reconstruction of sparse measures from time-varying data. In particular, the reconstruction is a finite collection of Dirac measures whose locations and masses vary continuously 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. 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.
- 9 February 2024
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 30, 7
Open AccessDynamical programming for off-the-grid dynamic inverse problems
In this work we consider off-the-grid algorithms for the reconstruction of sparse measures from time-varying data. In particular, the reconstruction is a finite collection of Dirac measures whose locations and masses vary continuously 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. 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.
- Open Access
1D APPROXIMATION OF MEASURES IN WASSERSTEIN SPACES
We propose a variational approach to approximate measures with measures uniformly distributed over a 1 dimentional set. The problem consists in minimizing a Wasserstein distance as a data term with a regularization given by the length of the support. As it is challenging to prove existence of solutions to this problem, we propose a relaxed formulation, which always admits a solution. In the sequel we show that if the ambient space is $\mathbb{R}^2$ , under techinical assumptions, any solution to the relaxed problem is a solution to the original one. Finally we manage to prove that any optimal solution to the relaxed problem, and hence also to the original, is Ahlfors regular.Open Access1D APPROXIMATION OF MEASURES IN WASSERSTEIN SPACES
We propose a variational approach to approximate measures with measures uniformly distributed over a 1 dimentional set. The problem consists in minimizing a Wasserstein distance as a data term with a regularization given by the length of the support. As it is challenging to prove existence of solutions to this problem, we propose a relaxed formulation, which always admits a solution. In the sequel we show that if the ambient space is $\mathbb{R}^2$ , under techinical assumptions, any solution to the relaxed problem is a solution to the original one. Finally we manage to prove that any optimal solution to the relaxed problem, and hence also to the original, is Ahlfors regular. - Open Access
Dynamical Programming for off-the-grid dynamic Inverse Problems
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.
Open AccessDynamical Programming for off-the-grid dynamic Inverse Problems
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.
- 25 July 2022
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 65 (1) , 53-81
Towards Off-the-Grid Algorithms for Total Variation Regularized Inverse Problems
- 25 July 2022
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 65 (1) , 53-81
Towards Off-the-Grid Algorithms for Total Variation Regularized Inverse Problems
- Open Access
Towards Off-the-grid Algorithms for Total Variation Regularized Inverse Problems
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed mesh, our approach exploits the structure of the solutions and consists in iteratively constructing a linear combination of indicator functions of simple polygons.
Open AccessTowards Off-the-grid Algorithms for Total Variation Regularized Inverse Problems
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed mesh, our approach exploits the structure of the solutions and consists in iteratively constructing a linear combination of indicator functions of simple polygons.
- Open Access
- 1 January 2021
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 28 (3) , 819-836
An Epigraphical Approach to the Representer Theorem
Describing the solutions of inverse problems arising in signal or image processing is an important issue both for theoretical and numerical purposes. We propose a principle which describes the solutions to convex variational problems involving a finite number of measurements. We discuss its optimality on various problems concerning the recovery of Radon measures.
- 1 January 2021
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 28 (3) , 819-836
Open AccessAn Epigraphical Approach to the Representer Theorem
Describing the solutions of inverse problems arising in signal or image processing is an important issue both for theoretical and numerical purposes. We propose a principle which describes the solutions to convex variational problems involving a finite number of measurements. We discuss its optimality on various problems concerning the recovery of Radon measures.
- Top Cited PapersOpen Access
- 3 December 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (1) , 014001
The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy
This paper showcases the theoretical and numerical performance of the Sliding Frank–Wolfe, which is a novel optimization algorithm to solve the BLASSO sparse spikes super-resolution problem. The BLASSO is a continuous (i.e. off-the-grid or grid-less) counterpart to the well-known sparse regularisation method (also known as LASSO or basis pursuit). Our algorithm is a variation on the classical Frank–Wolfe (also known as conditional gradient) which follows a recent trend of interleaving convex optimization updates (corresponding to adding new spikes) with non-convex optimization steps (corresponding to moving the spikes). Our main theoretical result is that this algorithm terminates in a finite number of steps under a mild non-degeneracy hypothesis. We then target applications of this method to several instances of single molecule fluorescence imaging modalities, among which certain approaches rely heavily on the inversion of a Laplace transform. Our second theoretical contribution is the proof of the exact support recovery property of the BLASSO to invert the 1D Laplace transform in the case of positive spikes. On the numerical side, we conclude this paper with an extensive study of the practical performance of the Sliding Frank–Wolfe on different instantiations of single molecule fluorescence imaging, including convolutive and non-convolutive (Laplace-like) operators. This shows the versatility and superiority of this method with respect to alternative sparse recovery technics.
- 3 December 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (1) , 014001
Top Cited PapersOpen AccessThe sliding Frank–Wolfe algorithm and its application to super-resolution microscopy
This paper showcases the theoretical and numerical performance of the Sliding Frank–Wolfe, which is a novel optimization algorithm to solve the BLASSO sparse spikes super-resolution problem. The BLASSO is a continuous (i.e. off-the-grid or grid-less) counterpart to the well-known sparse regularisation method (also known as LASSO or basis pursuit). Our algorithm is a variation on the classical Frank–Wolfe (also known as conditional gradient) which follows a recent trend of interleaving convex optimization updates (corresponding to adding new spikes) with non-convex optimization steps (corresponding to moving the spikes). Our main theoretical result is that this algorithm terminates in a finite number of steps under a mild non-degeneracy hypothesis. We then target applications of this method to several instances of single molecule fluorescence imaging modalities, among which certain approaches rely heavily on the inversion of a Laplace transform. Our second theoretical contribution is the proof of the exact support recovery property of the BLASSO to invert the 1D Laplace transform in the case of positive spikes. On the numerical side, we conclude this paper with an extensive study of the practical performance of the Sliding Frank–Wolfe on different instantiations of single molecule fluorescence imaging, including convolutive and non-convolutive (Laplace-like) operators. This shows the versatility and superiority of this method with respect to alternative sparse recovery technics.