Molecular dynamics (MD) simulations employing classical force fields constitute the
cornerstone of contemporary atomistic modeling in chemistry, biology, and materials …

Various applications involve assigning discrete label values to a collection of objects based
on some pairwise noisy data. Due to the discrete—and hence nonconvex—structure of the …

This work proposes a multi-image matching method to estimate semantic correspondences
across multiple images. In contrast to the previous methods that optimize all pairwise …

In this work we study convex relaxations of quadratic optimisation problems over
permutation matrices. While existing semidefinite programming approaches can achieve …

We introduce a principled approach for simultaneous mapping and clustering (SMAC) for
establishing consistent maps across heterogeneous object collections (eg, 2D images or 3D …

Multi-graph matching refers to finding correspondences across graphs, which are
traditionally solved by matching all the graphs in a single batch. However in real-world …

In this paper we propose an optimization-based framework to multiple object matching. The
framework takes maps computed between pairs of objects as input, and outputs maps that …

Retinal layer segmentation from optical coherence tomography (OCT) is of fundamental
importance for measuring retinal layer thicknesses. These thickness measurements have …

As two fundamental problems, graph cuts and graph matching have been intensively
investigated over the decades, resulting in vast literature in these two topics respectively …

Most existing techniques in map computation (eg, in the form of feature or dense
correspondences) assume that the underlying map between an object pair is unique. This …