.png){kind=icon}
Return
Efficient image matching using weighted voting
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2011.02.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Spectral decomposition subject to pairwise geometric constraints is one of the most successful image matching (correspondence establishment) methods which is widely used in image retrieval, recognition, registration, and stitching. When the number of candidate correspondences is large, the eigen-decomposition of the affinity matrix is time consuming and therefore is not suitable for real-time computer vision. To overcome the drawback, in this letter we propose to treat each candidate correspondence not only as a candidate but also as a voter. As a voter, it gives voting scores to other candidate correspondences. Based on the voting scores, the optimal correspondences are computed by simple addition and ranking operations. Experimental results on real-data demonstrate that the proposed method is more than one hundred times faster than the classical spectral method while does not decrease the matching accuracy. (C) 2011 Published by Elsevier B.V.
Keywords:
Image matching
Spectral technique
Correspondence establishment
Weighted voting
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
ShareSaveShareSave
View more