Moser Transport Map in Imaging and PDEs
- Moser Transport Map is a constructive method that generates a smooth diffeomorphic flow between strictly positive densities via an elliptic PDE and ODE system.
- It enforces mass conservation by combining a continuity equation with a linear density interpolation and minimizes energy through a variational formulation.
- The method is applied in imaging to create continuous motion between segmented images using a convergent finite-element least-squares algorithm.
Searching arXiv for relevant papers on the Moser transport map and the cited 2012 imaging paper. The Moser transport map, often presented in the Dacorogna–Moser form, is a constructive method for generating a diffeomorphic transport between two strictly positive densities on a bounded domain by coupling a prescribed density interpolation with an elliptic PDE and an ODE flow. In the presentation adopted by Besson et al., the method is formulated for imaging applications, notably the generation of an apparent continuous motion between segmented initial and final images and , while retaining a rigorous PDE and variational structure (Besson et al., 2012).
1. Problem setting and admissible data
Let with be a bounded -domain satisfying the exterior-sphere condition. The prescribed endpoint densities satisfy
The objective is to construct a one-parameter family on and a velocity field , vanishing on , such that
0
and mass is conserved along the flow generated by 1 (Besson et al., 2012).
This formulation is the continuum core of the transport map. The endpoint densities are assumed strictly positive and uniformly bounded away from zero and infinity, and the boundary compatibility 2 is part of the standing hypothesis. These assumptions ensure that the interpolation used in the construction remains positive and that the subsequent elliptic step is well posed under standard elliptic regularity theory.
2. Continuity equation and the Moser divergence constraint
If 3 is the flow associated with 4,
5
then the pull-back density satisfies
6
This is equivalent to the continuity equation
7
Moser’s construction begins by prescribing an explicit Ansatz for the density path, namely the linear interpolation
8
Consequently,
9
and the continuity equation is enforced by requiring, at each 0,
1
Since 2, one may write 3 and impose
4
instead (Besson et al., 2012).
The essential structural point is that the map is not obtained by directly solving a Monge-type optimization problem. Instead, the density path is fixed in advance and the velocity is recovered from a divergence equation that enforces exact mass conservation. This gives the Moser construction its characteristic elliptic-flow form.
3. Variational characterizations
The Moser velocity admits a global least-squares or minimum-energy interpretation. One formulation minimizes the kinetic-energy functional
5
over pairs 6 satisfying
7
Within this framework, the Moser choice
8
is pinned down by the boundary conditions, and the Euler–Lagrange equations in 9 produce the elliptic problem used in the explicit construction (Besson et al., 2012).
An equivalent formulation uses the weighted 0-seminorm
1
The pair 2 with
3
minimizes
4
under
5
In particular, the optimal velocity satisfies 6 and has minimal divergence in the dual 7-norm. In the terminology of the 2012 study, existence results are given for a transport problem with a minimum divergence for a dual norm or a weighted 8-semi norm, for the velocity (Besson et al., 2012).
These variational statements clarify that the map is simultaneously a transport construction and an energy-minimizing procedure. A plausible implication is that the Moser map is best understood as an elliptically regularized mass-preserving flow rather than solely as an explicit interpolation device.
4. Explicit construction of the transport map
The constructive algorithm proceeds in four steps. First, define
9
Second, for each 0, solve the elliptic PDE
1
together with the stated boundary condition
2
and the normalization 3. Third, define the velocity by
4
Fourth, solve the flow ODE
5
and set
6
The resulting map satisfies
7
The same exposition states that, because 8 and 9, one obtains 0 by standard elliptic theory. Since 1, the flow yields a unique 2-diffeomorphism 3 for each 4. The transport map 5 is therefore obtained as the terminal configuration of a time-dependent diffeomorphic flow rather than as a static pointwise rearrangement.
A recurrent source of confusion concerns boundary conditions in the potential formulation. The presentation includes the flux condition 6 on 7, a Neumann-type statement 8, and a normalization written as 9 or 0. This suggests that the central invariant is the boundary behavior required for the transport flux and the elliptic problem’s well-posedness, while the normalization fixes the additive indeterminacy of the potential.
5. Existence, uniqueness, and regularity
Under the hypotheses labeled H1–H2, the linear interpolation 1 never vanishes and 2 is Hölder continuous. The elliptic problem for 3 has a unique solution in 4 up to an additive constant, fixed by the normalization. Hence the velocity field is uniquely defined and belongs to 5. The ODE flow of a Lipschitz field 6 exists for all 7 and defines a unique 8-diffeomorphism 9 (Besson et al., 2012).
These regularity statements are not merely ancillary. They establish that the Moser map is a genuinely diffeomorphic transport under the stated assumptions, with the positivity of the interpolated density playing a decisive role. The construction therefore links elliptic PDE regularity, continuity-equation constraints, and flow-map theory in a single existence-and-uniqueness framework.
6. Computational realization and imaging use
In the 2D implementation described by Besson et al., the construction is embedded in a fixed point formulation and a space-time least-squares finite-element method. The discretization proceeds simultaneously in time and space. A space-time FE space 0 of piecewise polynomials on 1 is chosen, vanishing at 2. At iteration 3, given 4, one solves, for each 5, the discrete elliptic problem in 6 to obtain 7, computes
8
and updates 9 by minimizing
0
in 1 via an 2 least-squares variational form under the endpoint constraints 3 and 4. Positivity is enforced by projection in the convex set
5
and the iteration is continued to convergence in 6 (Besson et al., 2012).
The reported implementation uses a first-order (brick) Lagrange FE in space-time together with preconditioned conjugate-gradients, with incomplete-Cholesky or Gram–Schmidt least-squares preconditioners cited as examples. The stated application domain is cardiac image tracking, where the goal is to generate an apparent continuous motion observable through intensity variation from one starting image to an ending one, both supposed segmented. In this context, the transport introduced in the paper is compared with the transport introduced by Dacorogna–Moser, and the numerical results are presented as showing the efficiency of the proposed strategy.
This computational perspective situates the Moser transport map at the intersection of PDE-constrained imaging, optical-flow-type transport, and diffeomorphic registration. The theoretical construction and the finite-element realization are presented together: theoretically as the unique solution of a divergence-minimizing elliptic-flow problem, and practically via a convergent space-time finite-element least-squares algorithm (Besson et al., 2012).