1996•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIERequires access

Maximum-weight bipartite matching technique and its application in image feature matching

Yong-Qing Cheng, Victor Wu, Robert T. Collins, Allen R. Hanson, Edward M. Riseman

Abstract

An important and difficult problem in computer vision is to determine 2D image feature correspondences over a set of images. In this paper, two new affinity measures for image points and lines from different images are presented, and are used to construct unweighted and weighted bipartite graphs. It is shown that the image feature matching problem can be reduced to an unweighted matching problem in the bipartite graphs. It is further shown that the problem can be formulated as the general maximum-weight bipartite matching problem, thus generalizing the above unweighted bipartite matching technique.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 49 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Bipartite graph, 3-dimensional matching, Matching (statistics), Feature (linguistics), Image (mathematics), Combinatorics, Mathematics, Blossom algorithm