FAST corner detector

Implementation of the FAST corner detection algorithm.

The code here is an implementation of the FAST corner detection algorithm. A pixel is defined as a corner if (in a circle surrounding the pixel), N or more contiguous pixels are all significantly brighter then or all significantly darker than the centre pixel. The ordering of questions used to classify a pixel is learned using the ID3 algorithm. This detector has been shown to exibit a high degree of repeatability.
This is detailed in the following paper:

Machine learning for high-speed corner detection. E. Rosten, T. Drummond, ECCV 2006.

And on the website at:

http://mi.eng.cam.ac.uk/~er258/work/fast.html

Instructions for use are included in example.m as well as matlab HELP descriptions.