2011 · 10.4K citations · 22 references
ComputingComputer ScienceComputer VisionFeature EngineeringMachine VisionFeature DescriptionFeature DetectionObject DetectionObject RecognitionPattern RecognitionVisual TrackingDescriptor MatchingFeature MatchingInvariant Feature DescriptorsKeypoint DescriptorsLocal Feature DescriptorsRotation-invariant Matching
Feature matching underpins many computer vision tasks, yet existing descriptors are computationally expensive. The authors propose ORB, a fast binary descriptor derived from BRIEF that is rotation invariant and robust to noise. ORB is implemented as a binary descriptor built on BRIEF and evaluated on real‑world tasks such as object detection and smartphone patch tracking. Experiments show ORB is two orders of magnitude faster than SIFT while matching its performance in many scenarios.
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.
22
A Combined Corner and Edge Detector
Chris Harris, Matthew J. Stephens · 1988 · 12.5K citations
Video Google: a text retrieval approach to object matching in videos
Parallel Tracking and Mapping for Small AR Workspaces
Georg Klein, David W. Murray · 2007 · 4.2K citations
Scalable Recognition with a Vocabulary Tree
D. Nistér, Henrik Stewénius · 2006 · 3.6K citations