Abstract: Aim to the practical problem of high-resolution imagery automatic matching, the paper proposes a reliable matching algorithm based on the rational function model bundle adjustment, the basic ...

Graph matching remains a core challenge in computer vision, where establishing correspondences between features is crucial for tasks such as object recognition, 3D reconstruction and scene ...

Abstract: Recently, Physically Unclonable Functions (PUFs) received considerable attention in order to developing security mechanisms for applications such as Internet of Things (IoT) by exploiting ...

ABSTRACT: The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision ...

We propose a new approach to solve graph isomorphism using parameterized matching. To find isomorphism between two graphs, one graph is linearized, i.e., represented as a graph walk that covers all ...

We present an Oe(m + n 1.5 )-time randomized algorithm for maximum cardinality bipartite matching and related problems (e.g. transshipment, negative-weight shortest paths, and optimal transport) on ...

`grma`` is a package for finding HLA matches using graphs approach. The matching is based on grim's imputation. The donors' graph is a graph which contains all the donors (the search space). It ...