The DOI matches its Crossref record; 29 of the 30 references it cites were found in a registry or an index.
ORB: An efficient alternative to SIFT or SURF
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Additionally, it is dimensionally and rotationally invariant [101].”
From Vehicle Detection and Classification via YOLOv8 and Deep Belief Network over Aerial Image Sequences (2023) · cites this paper as [101]
In the citing paper
“Geometry-based Visual Odometry has shown dominating performance in the last few decades, while they are only reliable and accurate under a restrictive setup, such as when static scenes comprising well-textured Lambertian surfaces are captured with sufficient uniform illumination enabling to establish good correspondences (Bian et al. 2019a; Lowe 2004; Rublee et al. 2011).”
From DF-VO: What Should Be Learnt for Visual Odometry? (2021) · cites this paper as Rublee et al. 2011
In the citing paper
“ORB can obtain better extraction feature points at a significantly higher speed than SIFT.”
From Vision-based vehicle detection and counting system using deep learning in highway scenes (2019) · cites this paper as [29]
In the citing paper
“pixel-level feature extraction in vSLAM (e.g., the ORB algorithm [15]) is more sensitive to data distortion than object detection.”
From Orchestrating Joint Offloading and Scheduling for Low-Latency Edge SLAM (2025) · cites this paper as [15]
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
SURF: Speeded Up Robust Features
Bay, H., Tuytelaars, T., & Van Gool, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_32 · Cited by 14,955
A Combined Corner and Edge Detector
Harris, C., & Stephens, M. (1988) · Procedings of the Alvey Vision Conference 1988 · doi:10.5244/c.2.23 · Cited by 12,901 · cited 1×
“schemes for scale [ 14], and in our case, a Harris corner filter [11] to reject edges and provide a reasonable score.”
MethodVideo Google: a text retrieval approach to object matching in videos
Sivic, & Zisserman (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238663 · Cited by 6,367
Machine Learning for High-Speed Corner Detection
Rosten, E., & Drummond, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_34 · Cited by 4,555
Parallel Tracking and Mapping for Small AR Workspaces
Klein, G., & Murray, D. (2007) · 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality · doi:10.1109/ismar.2007.4538852 · Cited by 4,346
BRIEF: Binary Robust Independent Elementary Features
Calonder, M., Lepetit, V., Strecha, C., & Fua, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_56 · Cited by 3,597
Scalable Recognition with a Vocabulary Tree
Nister, D., & Stewenius, H. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.264 · Cited by 3,579
EPnP: An Accurate O(n) Solution to the PnP Problem
Lepetit, V., Moreno-Noguer, F., & Fua, P. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0152-6 · Cited by 3,298
PCA-SIFT: a more distinctive representation for local image descriptors
Ke, Y., & Sukthankar, R. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315206 · Cited by 3,237
Research works printed but not linked: 3
- klein, 2008, Improving the agility of keyframebased SLAM, European Conference on Computer Vision, 2
- rosten, 2006, Machine learning for highspeed corner detection, European Conference on Computer Vision, 1
- calonder, 2009, High-speed keypoint description and matching using dense signatures, Under Review
Cited by
Deformable Convolutional Networks
Dai, J., Qi, H., Xiong, Y., Li, Y., Zhang, G., Hu, H., & Wei, Y. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.89 · Cited by 7,513
“Notable examples include scale invariant feature transform (SIFT) [38] and ORB [44] (O for orientation).”
BackgroundORB-SLAM2: An Open-Source SLAM System for Monocular, Stereo, and RGB-D Cameras
Mur-Artal, R., & Tardos, J. D. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2017.2705103 · Cited by 6,898
“The system uses the same ORB features [17] for tracking, mapping, and place recognition tasks.”
Methodscikit-image: image processing in Python
van der Walt, S., Schönberger, J. L., Nunez-Iglesias, J., Boulogne, F., Warner, J. D., Yager, N., Gouillart, E., & Yu, T. (2014) · PeerJ · doi:10.7717/peerj.453 · Cited by 6,794
ORB-SLAM: A Versatile and Accurate Monocular SLAM System
Mur-Artal, R., Montiel, J. M. M., & Tardos, J. D. (2015) · IEEE Transactions on Robotics · doi:10.1109/tro.2015.2463671 · Cited by 6,778
“We chose ORB [9], which are oriented multiscale FAST corners with a 256-bit descriptor associated.”
BackgroundMethodSuperPoint: Self-Supervised Interest Point Detection and Description
DeTone, D., Malisiewicz, T., & Rabinovich, A. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2018.00060 · Cited by 3,355
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: ORB: An efficient alternative to SIFT or SURF. https://app.cochat.ai/papers/10.1109/iccv.2011.6126544
- The paper
- Rublee, E., Rabaud, V., Konolige, K., & Bradski, G. (2011). ORB: An efficient alternative to SIFT or SURF. 2011 International Conference on Computer Vision. https://doi.org/10.1109/iccv.2011.6126544
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.