Message passing least squares framework and its application to rotation synchronization
We propose an efficient algorithm for solving group synchronization under high levels of
corruption and noise, while we focus on rotation synchronization. We first describe our …
corruption and noise, while we focus on rotation synchronization. We first describe our …
Fast, accurate and memory-efficient partial permutation synchronization
Previous partial permutation synchronization (PPS) algorithms, which are commonly used
for multi-object matching, often involve computation-intensive and memory-demanding …
for multi-object matching, often involve computation-intensive and memory-demanding …
Robust multi-object matching via iterative reweighting of the graph connection Laplacian
We propose an efficient and robust iterative solution to the multi-object matching problem.
We first clarify serious limitations of current methods as well as the inappropriateness of the …
We first clarify serious limitations of current methods as well as the inappropriateness of the …
Scalable cluster-consistency statistics for robust multi-object matching
We develop new statistics for robustly filtering corrupted keypoint matches in the structure
from motion pipeline. The statistics are based on consistency constraints that arise within the …
from motion pipeline. The statistics are based on consistency constraints that arise within the …
Multi-perspective, simultaneous embedding
We describe MPSE: a Multi-Perspective Simultaneous Embedding method for visualizing
high-dimensional data, based on multiple pairwise distances between the data points …
high-dimensional data, based on multiple pairwise distances between the data points …