27 February 1996 Maximum-weight bipartite matching technique and its application in image feature matching
Author Affiliations +
Proceedings Volume 2727, Visual Communications and Image Processing '96; (1996) https://doi.org/10.1117/12.233261
Event: Visual Communications and Image Processing '96, 1996, Orlando, FL, United States
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.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yong-Qing Cheng, Yong-Qing Cheng, Victor Wu, Victor Wu, Robert Collins, Robert Collins, Allen R. Hanson, Allen R. Hanson, Edward M. Riseman, Edward M. Riseman, } "Maximum-weight bipartite matching technique and its application in image feature matching", Proc. SPIE 2727, Visual Communications and Image Processing '96, (27 February 1996); doi: 10.1117/12.233261; https://doi.org/10.1117/12.233261
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Adaptive adjacency graphs
Proceedings of SPIE (June 22 1993)
Matching 3 D smooth surfaces with their 2 D projections...
Proceedings of SPIE (August 31 1991)
Shape from contour methods using object-based heuristics
Proceedings of SPIE (April 08 1993)
Two and three view geometry based on noisy data ...
Proceedings of SPIE (October 24 2005)
3D model matching for fine pose determination
Proceedings of SPIE (October 02 1995)

Back to Top