Robust sift-based feature matching using Kendall's rank correlation measure

Authors:
Georgios Kordelas;Petros Daras
Affiliations:
Informatics and Telematics Institute, Thessaloniki, Greece;Informatics and Telematics Institute, Thessaloniki, Greece
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 5
Cited 0

Affine/ Photometric Invariants for Planar Intensity Patterns

ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
An Affine Invariant Interest Point Detector

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Scale Invariant Feature Transform, SIFT, is one of the most efficient image matching techniques based on local features. It has been applied to various scientific domains such as machine vision, robot navigation, object recognition, etc. In this work, a SIFT improvement is proposed that makes feature matching more robust in the presence of different types of image noise. Thus, Kendall's rank correlation measure is employed to improve the performance of feature matching. Its exploitation reduces the number of erroneous SIFT feature matches without adding significantly to the execution time. The results of the SIFT improvement are validated through matching examples between similar images.