06/12/2020

Robust Multi-Object Matching via Iterative Reweighting of the Graph Connection Laplacian

Yunpeng Shi, Shaohan Li, Gilad Lerman

Keywords:

Abstract Paper Similar Papers

Abstract: 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.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at NeurIPS 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 15:25 
 0
 0
 0
 0
 15:26 
 0
 0
 0
 0
 19:09 
 0
 0
 0
 0
 5:15 
 0
 0
 0
 0
 16:23 
 0
 0
 0
 0
 12:01 
 0
 1
 0
 2
 3:13 
 0
 0
 0
 0
 3:23 
 0
 1
 0
 0
 3:31 
 0
 0
 0
 0
 7:46 
 0
 0
 0
 0
 14:28 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 1:00 
 0
 0
 0
 0
 6:05 
 0
 0
 0
 0
 14:44 
 0
 0
 0
 0
 3:02 
 0
 0
 0
 0
 16:21 
 0
 0
 0
 0
 2:01 
 0
 0
 0
 0
 3:00 
 0
 0
 0
 0
 8:33 
 0
 0
 0
 0
 5:15 
 0
 0
 0
 0
 10:01 
 0
 0
 0
 0
 15:06 
 0
 0
 0
 0
 5:09 
 0
 0
 0
 0
 4:53 
 0
 0
 0
 0
 2:52 
 0
 0
 0
 0
 1:01 
 0
 0
 0
 0
 11:06 
 0
 0
 0
 0
 18:25 
 0
 0
 0
 0
 9:50 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 17:38 
 0
 0
 0
 0
 12:32 
 0
 0
 0
 0
 2:56 
 0
 0
 0
 0
 3:09 
 0
 0
 0
 0
 14:51 
 0
 0
 0
 0
 13:07 
 0
 0
 0
 0
 14:47 
 0
 0
 0
 0
 5:13 
 0
 0
 0
 0
 14:12