mlsanityData to 7 Oct 2026

Multiview Sensing With Unknown Permutations: An Optimal Transport Approach

arXiv 2103.07458 ↗First posted 12 Mar 2021cs.IT cs.CV cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 25 references that are in the map. First posted on arXiv 12 Mar 2021.

Builds on

10 of 25 references.

References · 10

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Computational Optimal Transportcited by 765
  3. 2013Fast Computation of Wasserstein Barycenterscited by 216
  4. 2014Continuum limit of total variation on point cloudscited by 24
  5. 2017Linear regression without correspondencecited by 16
  6. 2016A Transportation Lp Distance for Signal Analysiscited by 11
  7. 2017Denoising Linear Models with Permuted Datacited by 11
  8. 2017Signal Recovery from Unlabeled Samplescited by 8
  9. 2018Permutations Unlabeled beyond Sampling Unknowncited by 7
  10. 2018Machine Learning Methods for Data Association in Multi-Object Trackingcited by 4

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.