A spectral technique for correspondence problems using pairwise constraints
Citations Over TimeTop 1% of 2005 papers
Abstract
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the potential correspondences and the weights on the links represent pairwise agreements between potential correspondences. Correct assignments are likely to establish links among each other and thus form a strongly connected cluster. Incorrect correspondences establish links with the other correspondences only accidentally, so they are unlikely to belong to strongly connected clusters. We recover the correct assignments based on how strongly they belong to the main cluster of M, by using the principal eigenvector of M and imposing the mapping constraints required by the overall correspondence mapping (one-to-one or one-to-many). The experimental evaluation shows that our method is robust to outliers, accurate in terms of matching rate, while being much faster than existing methods
Related Papers
- → Compressed Adjacency Matrices: Untangling Gene Regulatory Networks(2012)53 cited
- → Adjacency Maps and Efficient Graph Algorithms(2022)3 cited
- → A general method for finding principal resonance structures for conjugated systems by semi-random searching of an adjacency matrix(1985)5 cited
- Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship(2005)
- → Scheme Partitioning by Means of Evolutional Procedures Using Symbolic Solution Representation(2017)