BRIEF: Binary Robust Independent Elementary Features | VitaVision
PaperLecture notes in computer science · 2010

BRIEF: Binary Robust Independent Elementary Features

Michael CalonderVincent LepetitChristoph StrechaPascal Fua
DOIView in graph
1page built on it
3more pages cite it
3narratives
1registry paper cites it

In the Atlas

AlgorithmPrimary source of
BRIEF: Binary Robust Independent Elementary Features

Encodes a Gaussian-smoothed image patch around a detected keypoint as a 128/256/512-bit binary string by running a fixed table of pairwise pixel-intensity tests; matched between images by Hamming distance via bitwise XOR + popcount.

Cited as a reference by 3 pages, grouped by domain

Features 3
Feature DescriptorsIntegral ImageORB: Oriented FAST and Rotated BRIEF

Appears in 3 narratives

NarrativeDetection, Removing the MachineryNarrativeThe Geometry Pipeline CollapsesNarrativeVision Under a Latency Budget

Lineage

Papers in the Atlas registry only · one dot per paper
Built upon by · 1
’04’05’06’07’08’09’10’11ORB: An efficient alternative to SIFT or SURF (2011)Distinctive Image Features from Scale-Invariant Keypoints (2004)SURF: Speeded Up Robust Features (2006)Machine Learning for High-Speed Corner Detection (2006)