Jump to content Jump to search

Matching

Description:

Matching is the problem of finding correspondences between two or more entities. It appears in computer vision as shape matching, i.e., finding correspondences between two 3D surfaces, as feature matching, i.e., finding correspondences between keypoints of similar but different objects, and as dense matching, i.e., finding dense correspondences of the same scene from different viewpoints. In optimization, this problem has theoretical formulations as the classic linear and quadratic assignment problems. We develop efficient algorithms that quickly and accurately solve correspondence problems and, when embedded in neural networks, deliver high-quality empirical results.

Literatur:

Responsible for the content: Sekretariat SARMATA : Contact by e-mail