Unseeded low-rank graph matching by transform-based unsupervised point registration

07/12/2018
by   Yuan Zhang, et al.
0

The problem of learning a correspondence relationship between nodes of two networks has drawn much attention of the computer science community and recently that of statisticians. The unseeded version of this problem, in which we do not know any part of the true correspondence, is a long-standing challenge. For low-rank networks, the problem can be translated into an unsupervised point registration problem, in which two point sets generated from the same distribution are matchable by an unknown orthonormal transformation. Conventional methods generally lack consistency guarantee and are usually computationally costly. In this paper, we propose a novel approach to this problem. Instead of simultaneously estimating the unknown correspondence and orthonormal transformation to match up the two point sets, we match their distributions via minimizing our designed loss function capturing the discrepancy between their Laplace transforms, thus avoiding the optimization over all possible correspondences. This dramatically reduces the dimension of the optimization problem from Ω(n^2) parameters to O(d^2) parameters, where d is the fixed rank, and enables convenient theoretical analysis. In this paper, we provide arguably the first consistency guarantee and explicit error rate for general low-rank models. Our method provides control over the computational complexity ranging from ω(n) (any growth rate faster than n) to O(n^2) while pertaining consistency. We demonstrate the effectiveness of our method through several numerical examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2020

Correspondence Matrices are Underrated

Point-cloud registration (PCR) is an important task in various applicati...
research
01/24/2019

Semantic Matching by Weakly Supervised 2D Point Set Registration

In this paper we address the problem of establishing correspondences bet...
research
05/20/2021

A low-rank representation for unsupervised registration of medical images

Registration networks have shown great application potentials in medical...
research
06/20/2018

Metric-Driven Learning of Correspondence Weighting for 2-D/3-D Image Registration

Registration for pre-operative 3-D images to intra-operative 2-D fluoros...
research
10/15/2021

Low-rank Matrix Recovery With Unknown Correspondence

We study a matrix recovery problem with unknown correspondence: given th...
research
10/07/2013

Learning Non-Parametric Basis Independent Models from Point Queries via Low-Rank Methods

We consider the problem of learning multi-ridge functions of the form f(...
research
01/22/2023

Learning to Reject with a Fixed Predictor: Application to Decontextualization

We study the problem of classification with a reject option for a fixed ...

Please sign up or login with your details

Forgot password? Click here to reset