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 standard iteratively reweighted least squares procedure. In view of these limitations, we suggest a novel and more reliable iterative reweighting strategy that incorporates information from higher-order neighborhoods by exploiting the graph connection Laplacian. We demonstrate the superior performance of our procedure over state-of-the-art methods using both synthetic and real datasets.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
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 clustered structure of the grap…
DFedReweighting: A Unified Framework for Objective-Oriented Reweighting in Decentralized Federated Learning
Decentralized federated learning (DFL) has emerged as a promising paradigm that enables multiple clients to collaboratively train machine learning models through iterative rounds of local training, communication, and agg…
Federated LearningGeMPO: Generalized Measure Matching for Online Diffusion Reinforcement Learning
A commonly used family of RL algorithms for diffusion policies conducts softmax reweighting over samples from the behavior policy, which often induces an overgreedy policy and fails to utilize feedback from negative samp…
Reinforcement LearningTransferring between sparse and dense matching via probabilistic reweighting
Detector-based and detector-free matchers are only applicable within their respective sparsity ranges. To improve adaptability of existing matchers, this paper introduces a novel probabilistic reweighting method. Our met…
Robust Multiview Point Cloud Registration with Reliable Pose Graph Initialization and History Reweighting
In this paper, we present a new method for the multiview registration of point cloud. Previous multiview registration methods rely on exhaustive pairwise registration to construct a densely-connected pose graph and apply…
Point Cloud Registration