Computing Optimal Assignments in Linear Time for Approximate Graph Matching

Finding an optimal assignment between two sets of objects is a fundamental problem arising in many applications, including the matching of `bag-of-words' representations in natural language processing and computer vision. Solving the assignment problem typically requires cubic time and its pair...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-09
Main Authors: Kriege, Nils M, Pierre-Louis Giscard, Bause, Franka, Wilson, Richard C
Format: Article
Language:English
Subjects:
Apexes
Computer vision
Computing time
Datasets
Graph matching
Natural language processing
Operations research
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Finding an optimal assignment between two sets of objects is a fundamental problem arising in many applications, including the matching of `bag-of-words' representations in natural language processing and computer vision. Solving the assignment problem typically requires cubic time and its pairwise computation is expensive on large datasets. In this paper, we develop an algorithm which can find an optimal assignment in linear time when the cost function between objects is represented by a tree distance. We employ the method to approximate the edit distance between two graphs by matching their vertices in linear time. To this end, we propose two tree distances, the first of which reflects discrete and structural differences between vertices, and the second of which can be used to compare continuous labels. We verify the effectiveness and efficiency of our methods using synthetic and real-world datasets.
ISSN:2331-8422