.png){kind=icon}
返回
Efficient image matching using weighted voting
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2011.02.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Image matching
Spectral technique
Correspondence establishment
Weighted voting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容