A review of multimodal image matching: Methods and applications

X Jiang, J Ma, G Xiao, Z Shao, X Guo - Information Fusion, 2021 - Elsevier
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 …

Deep graph similarity learning: A survey

G Ma, NK Ahmed, TL Willke, PS Yu - Data Mining and Knowledge …, 2021 - Springer
In many domains where data are represented as graphs, learning a similarity metric among
graphs is considered a key problem, which can further facilitate various learning tasks, such …

Graph neural networks: foundation, frontiers and applications

L Wu, P Cui, J Pei, L Zhao, X Guo - … of the 28th ACM SIGKDD Conference …, 2022 - dl.acm.org
The field of graph neural networks (GNNs) has seen rapid and incredible strides over the
recent years. Graph neural networks, also known as deep learning on graphs, graph …

Image matching from handcrafted to deep features: A survey

J Ma, X Jiang, A Fan, J Jiang, J Yan - International Journal of Computer …, 2021 - Springer
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 …

High-order information matters: Learning relation and topology for occluded person re-identification

G Wang, S Yang, H Liu, Z Wang… - Proceedings of the …, 2020 - openaccess.thecvf.com
Occluded person re-identification (ReID) aims to match occluded person images to holistic
ones across dis-joint cameras. In this paper, we propose a novel framework by learning high …

Robust point cloud registration framework based on deep graph matching

K Fu, S Liu, X Luo, M Wang - Proceedings of the IEEE/CVF …, 2021 - openaccess.thecvf.com
Abstract 3D point cloud registration is a fundamental problem in computer vision and
robotics. Recently, learning-based point cloud registration methods have made great …

Weisfeiler and leman go machine learning: The story so far

C Morris, Y Lipman, H Maron, B Rieck… - The Journal of Machine …, 2023 - dl.acm.org
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman
algorithm, a well-known heuristic for the graph isomorphism problem, have emerged as a …

Deep graph matching consensus

M Fey, JE Lenssen, C Morris, J Masci… - arXiv preprint arXiv …, 2020 - arxiv.org
This work presents a two-stage neural architecture for learning and refining structural
correspondences between graphs. First, we use localized node embeddings computed by a …

Learnable graph matching: Incorporating graph partitioning with deep feature learning for multiple object tracking

J He, Z Huang, N Wang… - Proceedings of the IEEE …, 2021 - openaccess.thecvf.com
Data association across frames is at the core of Multiple Object Tracking (MOT) task. This
problem is usually solved by a traditional graph-based optimization or directly learned via …

Famnet: Joint learning of feature, affinity and multi-dimensional assignment for online multiple object tracking

P Chu, H Ling - Proceedings of the IEEE/CVF International …, 2019 - openaccess.thecvf.com
Data association-based multiple object tracking (MOT) involves multiple separated modules
processed or optimized differently, which results in complex method design and requires …