pith. sign in

arxiv: 1710.02726 · v1 · pith:YZBQRGSNnew · submitted 2017-10-07 · 💻 cs.CV

Image Matching Using SIFT, SURF, BRIEF and ORB: Performance Comparison for Distorted Images

classification 💻 cs.CV
keywords matchingrobustbriefdifferentimageimagessiftsurf
0
0 comments X
read the original abstract

Fast and robust image matching is a very important task with various applications in computer vision and robotics. In this paper, we compare the performance of three different image matching techniques, i.e., SIFT, SURF, and ORB, against different kinds of transformations and deformations such as scaling, rotation, noise, fish eye distortion, and shearing. For this purpose, we manually apply different types of transformations on original images and compute the matching evaluation parameters such as the number of key points in images, the matching rate, and the execution time required for each algorithm and we will show that which algorithm is the best more robust against each kind of distortion. Index Terms-Image matching, scale invariant feature transform (SIFT), speed up robust feature (SURF), robust independent elementary features (BRIEF), oriented FAST, rotated BRIEF (ORB).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. DeepDetect: Learning All-in-One Dense Keypoints

    cs.CV 2025-10 unverdicted novelty 4.0

    DeepDetect trains ESPNet on fused classical detector masks to produce dense, repeatable keypoints that outperform prior methods on Oxford, HPatches, and Middlebury benchmarks.