Spectral matching of bipartite graphs

Authors:
S. H. Srinivasan
Affiliations:
Applied Research Group, Satyam Computer Services, Bangalore, India
Venue:
Design and application of hybrid intelligent systems
Year:
2003

Citing 6
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Estimating an Eigenvector by the Power Method with a Random Start

SIAM Journal on Matrix Analysis and Applications
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Exact scheduling strategies based on bipartite graph matching

EDTC '95 Proceedings of the 1995 European conference on Design and Test
Wide baseline spectral matching

ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bipartite graph matching arises in several applications including computer vision. This step is computationally expensive. Fast algorithms for this task are desirable. In this paper, we provide a random walk interpretation of bipartiate graph matching and propose three spectral algorithms for matching. The simulation results show that special algorithms provide approximate solutions fast.