Multiview Sensing With Unknown Permutations: An Optimal Transport Approach

03/12/2021
by   Yanting Ma, et al.
0

In several applications, including imaging of deformable objects while in motion, simultaneous localization and mapping, and unlabeled sensing, we encounter the problem of recovering a signal that is measured subject to unknown permutations. In this paper we take a fresh look at this problem through the lens of optimal transport (OT). In particular, we recognize that in most practical applications the unknown permutations are not arbitrary but some are more likely to occur than others. We exploit this by introducing a regularization function that promotes the more likely permutations in the solution. We show that, even though the general problem is not convex, an appropriate relaxation of the resulting regularized problem allows us to exploit the well-developed machinery of OT and develop a tractable algorithm.

READ FULL TEXT
research
02/15/2021

Relaxation of optimal transport problem via strictly convex functions

An optimal transport problem on finite spaces is a linear program. Recen...
research
05/29/2023

Bringing regularized optimal transport to lightspeed: a splitting method adapted for GPUs

We present an efficient algorithm for regularized optimal transport. In ...
research
05/29/2021

Optimal transport with f-divergence regularization and generalized Sinkhorn algorithm

Entropic regularization provides a generalization of the original optima...
research
10/04/2022

Tikhonov Regularization is Optimal Transport Robust under Martingale Constraints

Distributionally robust optimization has been shown to offer a principle...
research
07/02/2022

Exponential Convergence of Sinkhorn Under Regularization Scheduling

The optimal transport (OT) problem or earth mover's distance has wide ap...

Please sign up or login with your details

Forgot password? Click here to reset