A review of multimodal image matching: Methods and applications
Multimodal image matching, which refers to identifying and then corresponding the same or
similar structure/content from two or more images that are of significant modalities or …
similar structure/content from two or more images that are of significant modalities or …
A short survey of recent advances in graph matching
Graph matching, which refers to a class of computational problems of finding an optimal
correspondence between the vertices of graphs to minimize (maximize) their node and edge …
correspondence between the vertices of graphs to minimize (maximize) their node and edge …
Image matching from handcrafted to deep features: A survey
As a fundamental and critical task in various visual applications, image matching can identify
then correspond the same or similar structure/content from two or more images. Over the …
then correspond the same or similar structure/content from two or more images. Over the …
Learning combinatorial embedding networks for deep graph matching
Graph matching refers to finding node correspondence between graphs, such that the
corresponding node and edge's affinity can be maximized. In addition with its NP …
corresponding node and edge's affinity can be maximized. In addition with its NP …
Deep learning of graph matching
A Zanfir, C Sminchisescu - Proceedings of the IEEE …, 2018 - openaccess.thecvf.com
The problem of graph matching under node and pair-wise constraints is fundamental in
areas as diverse as combinatorial optimization, machine learning or computer vision, where …
areas as diverse as combinatorial optimization, machine learning or computer vision, where …
An efficient and robust line segment matching approach based on LBD descriptor and pairwise geometric consistency
L Zhang, R Koch - Journal of visual communication and image …, 2013 - Elsevier
We present a line matching algorithm which utilizes both the local appearance of lines and
their geometric attributes. To overcome the problem of segment fragmentation and …
their geometric attributes. To overcome the problem of segment fragmentation and …
Factorized graph matching
F Zhou, F De la Torre - IEEE transactions on pattern analysis …, 2015 - ieeexplore.ieee.org
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 …
role to solve correspondence problems in computer vision. GM problems that incorporate …
Neural graph matching network: Learning lawler's quadratic assignment problem with extension to hypergraph and multiple-graph matching
Graph matching involves combinatorial optimization based on edge-to-edge affinity matrix,
which can be generally formulated as Lawler's quadratic assignment problem (QAP). This …
which can be generally formulated as Lawler's quadratic assignment problem (QAP). This …
Graph matching and learning in pattern recognition in the last 10 years
In this paper, we examine the main advances registered in the last ten years in Pattern
Recognition methodologies based on graph matching and related techniques, analyzing …
Recognition methodologies based on graph matching and related techniques, analyzing …
Dynamic label graph matching for unsupervised video re-identification
Label estimation is an important component in an unsupervised person re-identification (re-
ID) system. This paper focuses on cross-camera label estimation, which can be …
ID) system. This paper focuses on cross-camera label estimation, which can be …