A corner dectector: examines whether 12 consecutive points out of 16 points are brighter or dimmer than the reference pixel. More details. Since this feature often aggregates locally, non-maximal suppression is applied. In the original paper, the summation of intensity difference between reference point and query point is used. Wheares in the ORB, harris corner filter is applied to reject edges.
It’s desired that sum squared difference is large in all directions i.e. eigenvalue lambda 1 is roughly the same as lambda 2 for SSD distribution function. In the below equation, large R value is desirable rather than small (flat) or negative (edge).
BRIEF is a probablistic descriptor of a local patch, which randomly samples N pairs of (xi, yi) and (xj, yj) to compute a N bit descriptor with 1 indicates the former has larger intensity. Two descriptors are compared using hamming distance, which is the minimum steps needed to transform from 1 string to the other. For non-matching sequences, the distribution would look like a gaussian center at 128 (random guess).
BREIF has no rotational nor multi-scale invariance, to resolve this, orientation is computed from intensity centroid, and an image pyramid is applied. It’s interesting that orienting the feature to same direction actually damage the performance a lot – obviously the performance depends on random orientation of a feature. To recover this performance drop, a learning-based approach is adopted on pascal test patches to obtain good samples that could generate uncorrelated, high-variance descriptors i.e. descriptor of high discriminating power.