CoChat

ORB: An efficient alternative to SIFT or SURF

Rublee, Ethan, Rabaud, Vincent, Konolige, Kurt, Bradski, Gary · 2011 · 2011 International Conference on Computer Vision

The DOI matches its Crossref record; 29 of the 30 references it cites were found in a registry or an index.

Abstract

Feature matching is at the base of many computer vision problems, such as object recognition or structure from motion. Current methods rely on costly descriptors for detection and matching. In this paper, we propose a very fast binary descriptor based on BRIEF, called ORB, which is rotation invariant and resistant to noise. We demonstrate through experiments how ORB is at two orders of magnitude faster than SIFT, while performing as well in many situations. The efficiency is tested on several real-world applications, including object detection and patch-tracking on a smart phone.

Overview

Integrity signals

Registry

Crossref · 10.1109/iccv.2011.6126544

Cites

29 of 29 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 3

  1. klein, 2008, Improving the agility of keyframebased SLAM, European Conference on Computer Vision, 2
  2. rosten, 2006, Machine learning for highspeed corner detection, European Conference on Computer Vision, 1
  3. calonder, 2009, High-speed keypoint description and matching using dense signatures, Under Review

Cited by

See all 11,037

Metadata

Authors
Rublee, E., Rabaud, V., Konolige, K., & Bradski, G.
Venue
2011 International Conference on Computer Vision
Publisher
IEEE
Published
2011-11
Pages
2564-2571
OpenAlex
W2117228865
Cited by
11,037
References
30
Citations by year
2026: 519 · 2025: 1023 · 2024: 1148 · 2023: 1169 · 2022: 1098 · 2021: 1060 · 2020: 977 · 2019: 883 · 2018: 807 · 2017: 683 · 2016: 516 · 2015: 489 · 2014: 348 · 2013: 222 · 2012: 91
FWCI
158.21
Type
conference paper
Language
en
Open access
closed
Locations
IEEE/CVF International Conference on Computer Vision (ICCV) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Retrieval and Classification Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Video Surveillance and Tracking Methods
Keywords
ORB, binary descriptors, BRIEF, rotation invariance, feature matching, object detection, patch tracking, noise robustness

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.