Correspondence & Mapping

Tuesday, 26 July, 3:45 pm - 5:35 pm, Anaheim Convention Center, Ballroom C
Session Chair: Mark Meyer, Pixar Animation Studios

Wasserstein Barycentric Coordinates: Histogram Regression Using Optimal Transport

Introducing a notion of barycentric coordinates for histograms via optimal transport and a fast numerical scheme to solve this problem. This scheme relies on a backward algorithmic differentiation of entropy-regularized Wasserstein barycenters. The paper showcases applications in computer graphics: shape approximation, BRDF acquisition, and color editing of movies.

Nicolas Bonneel
Laboratoire d'InfoRmatique en Image et Systèmes d'information

Gabriel Peyré
Centre national de la recherche scientifique

Marco Cuturi
Kyoto University

Entropic Metric Alignment for Correspondence Problems

Many shape and image-processing tools rely on correspondences between geometric domains. Methods that extract "soft" matches in the presence of diverse geometric structures are valuable for shape retrieval and transfer of semantic information.This paper presents an algorithm for correspondence that optimizes an entropy-regularized Gromov-Wasserstein objective.

Justin Solomon
Massachusetts Institute of Technology

Gabriel Peyre
Université Paris-Dauphine

Vladimir Kim
Adobe Research

Suvrit Sra
Massachusetts Institute of Technology

Point Registration via Efficient Convex Relaxation

This paper proposes an efficient SDP relaxation of the point-cloud registration problem, provides theoretical justification for the relaxation, presents state-of-the-art results on non-rigid shape matching benchmarks, and demonstrates applications to shape collection alignment and anatomical surface classification.

Haggai Maron
Weizmann Institute of Science

Nadav Dym
Weizmann Institute of Science

Itay Kezurer
Weizmann Institute of Science

Shahar Kovalsky
Weizmann Institute of Science

Yaron Lipman
Weizmann Institute of Science

Bijective Maps From Simplicial Foliations

In this method for generation of bijective maps in 2D and 3D, the key concept is the discrete foliation of triangle or tetrahedral meshes into disjoint submanifolds of lower dimension that are easy to parameterize.

Marcel Campen
New York University

Claudio T. Silva
New York University

Denis Zorin
New York University

Globally Optimal Toon Tracking

This paper proposes an optimization-based method to resolve the region correspondence throughout the whole cartoon sequence. It overcomes the complicated scenarios including complete/partial occlusion, multiple identical/similar objects, and even region splitting and merging. With the computed correspondences, propagation of modification over the sequence becomes easy.

Haichao Zhu
The Chinese University of Hong Kong

Xueting Liu
The Chinese University of Hong Kong

Tien-Tsin Wong
The Chinese University of Hong Kong

Pheng-Ann Heng
The Chinese University of Hong Kong