An Extended Path Following Algorithm for Graph-Matching Problem

The path following algorithm was proposed recently to approximately solve the matching problems on undirected graph models and exhibited a state-of-the-art performance on matching accuracy. In this paper, we extend the path following algorithm to the matching problems on directed graph models by pro...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence Vol. 34; no. 7; pp. 1451 - 1456
Main Authors: Liu, Zhi-Yong, Qiao, Hong, Xu, Lei
Format: Journal Article
Language:English
Published: Los Alamitos, CA IEEE 01.07.2012
IEEE Computer Society
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Accuracy
Algorithm design and analysis
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Complexity theory
Computer science; control theory; systems
concave relaxation
convex relaxation
directed graph
Exact sciences and technology
Graph matching
Graph theory
Graphs
Information retrieval. Graph
Intelligence
Matching
Mathematical models
PATH following algorithm
Pattern analysis
Pattern matching
State of the art
Stochastic processes
Symmetric matrices
Theoretical computing
Transmission line matrix methods
Direct problem
concave relaxation
Path following
Graph theory
Objective function
PATH following algorithm
Digraph
convex relaxation
Directed graph
Graph matching
Non directed graph
ISSN:0162-8828, 1939-3539, 2160-9292, 1939-3539
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The path following algorithm was proposed recently to approximately solve the matching problems on undirected graph models and exhibited a state-of-the-art performance on matching accuracy. In this paper, we extend the path following algorithm to the matching problems on directed graph models by proposing a concave relaxation for the problem. Based on the concave and convex relaxations, a series of objective functions are constructed, and the Frank-Wolfe algorithm is then utilized to minimize them. Several experiments on synthetic and real data witness the validity of the extended path following algorithm.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0162-8828
1939-3539
2160-9292
1939-3539
DOI:10.1109/TPAMI.2012.45