Factorized Graph Matching

Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspond...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence 2016-09, Vol.38 (9), p.1774-1789
Main Authors: Feng Zhou, De la Torre, Fernando
Format: Article
Language:English
Subjects:
Algorithms
Approximation algorithms
Approximation methods
Computer vision
feature matching
Graph matching
Iterative closest point algorithm
iterative closet point method
quadratic assignment problem
Symmetric matrices
Transmission line matrix methods
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!