Spectral Descriptors for Graph Matching

04/04/2013
by   Nan Hu, et al.
0

In this paper, we consider the weighted graph matching problem. Recently, approaches to this problem based on spectral methods have gained significant attention. We propose two graph spectral descriptors based on the graph Laplacian, namely a Laplacian family signature (LFS) on nodes, and a pairwise heat kernel distance on edges. We show the stability of both our descriptors under small perturbation of edges and nodes. In addition, we show that our pairwise heat kernel distance is a noise-tolerant approximation of the classical adjacency matrix-based second order compatibility function. These nice properties suggest a descriptor-based matching scheme, for which we set up an integer quadratic problem (IQP) and apply an approximate solver to find a near optimal solution. We have tested our matching method on a set of randomly generated graphs, the widely-used CMU house sequence and a set of real images. These experiments show the superior performance of our selected node signatures and edge descriptors for graph matching, as compared with other existing signature-based matchings and adjacency matrix-based matchings.

READ FULL TEXT

page 5

page 8

page 9

research
04/10/2018

Graph Matching with Anchor Nodes: A Learning Approach

In this paper, we consider the weighted graph matching problem with part...
research
10/23/2011

Spectral descriptors for deformable shapes

Informative and discriminative feature descriptors play a fundamental ro...
research
01/19/2016

A Theory of Local Matching: SIFT and Beyond

Why has SIFT been so successful? Why its extension, DSP-SIFT, can furthe...
research
06/26/2023

An Evolution Kernel Method for Graph Classification through Heat Diffusion Dynamics

Autonomous individuals establish a structural complex system through pai...
research
02/28/2021

Criminal Networks Analysis in Missing Data scenarios through Graph Distances

Data collected in criminal investigations may suffer from: (i) incomplet...
research
06/07/2020

Generalized Spectral Clustering via Gromov-Wasserstein Learning

We establish a bridge between spectral clustering and Gromov-Wasserstein...
research
11/08/2022

Graph Summarization via Node Grouping: A Spectral Algorithm

Graph summarization via node grouping is a popular method to build conci...

Please sign up or login with your details

Forgot password? Click here to reset