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 …

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 …

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 …

Graph matching is an essential problem in computer vision and machine learning. In this
paper, we introduce a random walk view on the problem and propose a robust graph …

Establishing correspondences between two feature sets is a fundamental issue in computer
vision, pattern recognition, and machine learning. This problem can be well formulated as …

This survey gives a selective review of recent development of machine learning (ML) for
combinatorial optimization (CO), especially for graph matching. The synergy of these two …

This paper addresses the problem of hypergraph matching using higher-order affinity
information. We propose a solver that iteratively updates the solution in the discrete domain …

Graph matching has received persistent attention over decades, which can be formulated as
a quadratic assignment problem (QAP). We show that a large family of functions, which we …

The estimation of correspondences between two images resp. point sets is a core problem
in computer vision. One way to formulate the problem is graph matching leading to the …

We study the quadratic assignment problem, in computer vision also known as graph
matching. Two leading solvers for this problem optimize the Lagrange decomposition duals …