Wide baseline spectral matching

Authors:
S. H. Srinivasan;M. Kankanhalli
Affiliations:
Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore;Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore
Venue:
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Year:
2003

Citing 4
Cited 2

Evaluation of Interest Point Detectors

International Journal of Computer Vision - Special issue on a special section on visual surveillance
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
On clusterings-good, bad and spectral

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Spectral matching of bipartite graphs

Design and application of hybrid intelligent systems
Versatile spectral methods for point set matching

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wide baseline matching of images is an important problem in multimedia and computer vision. Recently a class of spectral methods have been proposed for tasks like segmentation. In this paper we propose a spectral algorithm for wide baseline matching.