Image matching by fast random sample consensus

Authors:
Ye Zhao;Richang Hong;Jianguo Jiang;Jing Wen;Hengheng Zhang
Affiliations:
Hefei University of Technology, Hefei, Anhui, China;Hefei University of Technology, Hefei, Anhui, China;Hefei University of Technology, Hefei, Anhui, China;Hefei University of Technology, Hefei, Anhui, China;Hefei University of Technology, Hefei, Anhui, China
Venue:
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Year:
2013

Citing 8
Cited 0

MLESAC: a new robust estimator with application to estimating image geometry

Computer Vision and Image Understanding - Special issue on robusst statistical techniques in image understanding
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
A Performance Evaluation of Local Descriptors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Randomized RANSAC with Sequential Probability Ratio Test

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Towards a Relevant and Diverse Search of Social Images

IEEE Transactions on Multimedia
Assistive tagging: A survey of multimedia tagging with human-computer joint exploration

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traditional Random Sample Consensus (RANSAC) algorithm tends to exhibit deficiencies when faced with large amounts of data. In this paper, we present an algorithm called fast Random Sample Consensus (abbr. F-RANSAC) which is able to improve computation efficiency and robustness. We first use the nearest neighbor algorithm to retrieve candidate match points with ranked matching scores. We then construct representative data sets by using a minimal number of optimal matches. Finally, the target homographic matrix is fitted based on the representative data set. Experiments on affine covariant region datasets demonstrate that F-RANSAC significantly enhances computation efficiency(3 times to 10 times) and slightly improves accuracy.