会议专题

Study on Eliminating Wrong Match Pairs of SIFT

To eliminate or reduce wrong pairs in SIFT(Scale Invariant Feature Transform)feature matching, this paper proposes an error canceling algorithm through computing match-base. First finding three match point pairs by considering minimal Euclidean distance; second take three match point pairs as match-base if these pairs satisfy with criterion, or finding another three match pairs. Finally checking all other match pairs and eliminating wrong match pairs. Experimental results show that the proposed algorithm consumes lower time than RANSAC with inheriting rotation invariance of SIFT. At the same time, it does not exclude the right match pairs, with strong robustness. As a result, precision of image mosaic has been improved.

SIFT eliminating worng match image mosaic RANSAC

Ren Jiayuan Wang Yigang Deng Yun

Dept.of Information, Ningbo Institute of Technology, Zhejiang University,No.1 Qianhu South Road, Nin Dept.of Information, Ningbo Institute of Technology, Zhejiang University,No.1 Qianhu South Road, Nin

国际会议

2010 IEEE 10th International Conference on Signal Processing(第十届信号处理国际会议 ICSP 2010)

北京

英文

992-995

2010-08-24(万方平台首次上网日期,不代表论文的发表时间)