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 …

Seeking reliable correspondences between two feature sets is a fundamental and important
task in computer vision. This paper attempts to remove mismatches from given putative …

Feature matching, which refers to establishing reliable correspondences between two sets
of feature points, is a critical prerequisite in feature-based image registration. This paper …

Graph matching aims to establish node correspondence between two graphs, which has
been a fundamental problem for its NP-hard nature. One practical consideration is the …

Finding robust and correct keypoints in images remains a challenge, especially when
repetitive patterns are present. In this article, we propose a universal two-step filtering …

Jigsaw puzzle solving has recently become an emerging research area. The developed
techniques have been widely used in applications beyond puzzle solving. This paper …

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 …

Learning-based approaches to graph matching have been developed and explored for
more than a decade, have grown rapidly in scope and popularity in recent years. However …

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 …