资源分类
》 资源 》论文》Solving the multi-way matching problem by permutation synchronization

Solving the multi-way matching problem by permutation synchronization

2020-01-16 | |  99 |   42 |   0

Abstract

The problem of matching not just two, but m different sets of objects to each other arises in many contexts, including finding the correspondence between feature points across multiple images in computer vision. At present it is usually solved by matching the sets pairwise, in series. In contrast, we propose a new method, Permutation Synchronization, which finds all the matchings jointly, in one shot, via a relaxation to eigenvector decomposition. The resulting algorithm is both computationally efficient, and, as we demonstrate with theoretical arguments as well as experimental results, much more stable to noise than previous methods.

上一篇：Neurally Plausible Reinforcement Learning of Working Memory Tasks

下一篇：Sparse Overlapping Sets Lasso for Multitask Learning and its Application to fMRI Analysis

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...