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 …

Unsupervised visible-infrared person re-identification is a challenging task due to the large
modality gap and the unavailability of cross-modality correspondences. Cross-modality …

Despite the fact that Second Order Similarity (SOS) has been used with significant success
in tasks such as graph matching and clustering, it has not been exploited for learning local …

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 …

In this paper, we propose an efficient algorithm, called vector field consensus, for
establishing robust point correspondences between two sets of points. Our algorithm starts …

Feature matching, which refers to establishing reliable correspondence between two sets of
features, is a critical prerequisite in a wide spectrum of vision-based tasks. Existing attempts …

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 …

Despite advances in feature representation, leveraging geometric relations is crucial for
establishing reliable visual correspondences under large variations of images. In this work …