FREAK: Fast Retina Keypoint

Alexandre Alahi, Pierre Vandergheynst

2012 · 1.8K citations · 25 references

DOIFull text

Open access

Concepts

TL;DR

Vision applications rely on matching keypoints, and over the last decade an arms race has produced faster, more robust descriptors such as SIFT, SURF, and BRISK, yet deployment on smartphones and embedded devices demands even faster, more compact yet robust descriptors. The authors propose Fast Retina Keypoint (FREAK), a novel keypoint descriptor inspired by the human retina, to meet these requirements. FREAK computes a cascade of binary strings by efficiently comparing image intensities over a retinal sampling pattern. Experiments show that FREAK is faster to compute, uses less memory, and is more robust than SIFT, SURF, or BRISK, making it a competitive alternative for embedded applications.

Abstract

A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algorithms: Scale Invariant Feature Transform (SIFT)[17], Speed-up Robust Feature (SURF)[4], and more recently Binary Robust Invariant Scalable Keypoints (BRISK)[I6] to name a few. These days, the deployment of vision algorithms on smart phones and embedded devices with low memory and computation complexity has even upped the ante: the goal is to make descriptors faster to compute, more compact while remaining robust to scale, rotation and noise. To best address the current requirements, we propose a novel keypoint descriptor inspired by the human visual system and more precisely the retina, coined Fast Retina Keypoint (FREAK). A cascade of binary strings is computed by efficiently comparing image intensities over a retinal sampling pattern. Our experiments show that FREAKs are in general faster to compute with lower memory load and also more robust than SIFT, SURF or BRISK. They are thus competitive alternatives to existing keypoints in particular for embedded applications.

References

25