Maximum-Weight Bipartite Matching Technique and Its Application in Image Feature Matching
Conference Paper, Proceedings of SPIE Visual Communications and Image Processing, Vol. 2727, pp. 453 - 463, March, 1996
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.
BibTeX
@conference{Cheng-1996-16270,author = {Y. Cheng and V. Wu and Robert Collins and A. Hanson and E. Riseman},
title = {Maximum-Weight Bipartite Matching Technique and Its Application in Image Feature Matching},
booktitle = {Proceedings of SPIE Visual Communications and Image Processing},
year = {1996},
month = {March},
volume = {2727},
pages = {453 - 463},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.