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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence Jg. 34; H. 7; S. 1451 - 1456
Hauptverfasser:	Liu, Zhi-Yong, Qiao, Hong, Xu, Lei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Los Alamitos, CA IEEE 01.07.2012 IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!