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 …

A comprehensive survey on point cloud registration

X Huang, G Mei, J Zhang, R Abbas - arXiv preprint arXiv:2103.02690, 2021 - arxiv.org
Registration is a transformation estimation problem between two point clouds, which has a
unique and critical role in numerous computer vision applications. The developments of …

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 …

Gromov-wasserstein averaging of kernel and distance matrices

G Peyré, M Cuturi, J Solomon - International conference on …, 2016 - proceedings.mlr.press
This paper presents a new technique for computing the barycenter of a set of distance or
kernel matrices. These matrices, which define the inter-relationships between points …

Continuous and orientation-preserving correspondences via functional maps

J Ren, A Poulenard, P Wonka… - ACM Transactions on …, 2018 - dl.acm.org
We propose a method for efficiently computing orientation-preserving and approximately
continuous correspondences between non-rigid shapes, using the functional maps …

Entropic metric alignment for correspondence problems

J Solomon, G Peyré, VG Kim, S Sra - ACM Transactions on Graphics …, 2016 - dl.acm.org
Many shape and image processing tools rely on computation of correspondences between
geometric domains. Efficient methods that stably extract" soft" matches in the presence of …

Point registration via efficient convex relaxation

H Maron, N Dym, I Kezurer, S Kovalsky… - ACM Transactions on …, 2016 - dl.acm.org
Point cloud registration is a fundamental task in computer graphics, and more specifically, in
rigid and non-rigid shape matching. The rigid shape matching problem can be formulated as …

Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space

M Vestner, R Litman, E Rodola… - Proceedings of the …, 2017 - openaccess.thecvf.com
Many algorithms for the computation of correspondences between deformable shapes rely
on some variant of nearest neighbor matching in a descriptor space. Such are, for example …

SDRSAC: Semidefinite-based randomized approach for robust point cloud registration without correspondences

HM Le, TT Do, T Hoang… - Proceedings of the IEEE …, 2019 - openaccess.thecvf.com
This paper presents a novel randomized algorithm for robust point cloud registration without
correspondences. Most existing registration approaches require a set of putative …

Efficient random graph matching via degree profiles

J Ding, Z Ma, Y Wu, J Xu - Probability Theory and Related Fields, 2021 - Springer
Random graph matching refers to recovering the underlying vertex correspondence
between two random graphs with correlated edges; a prominent example is when the two …