Fast algorithm for iris detection

The paper presents a fast algorithm for iris detection. The idea behind the algorithm comes from well-known Daugman's circular edge detector based on smoothed integro-differential operators. We use binning instead of convolution which is a bit more suitable for new generation of application processors (e.g. AP7000 from Atmel)and new CMOS imagers offering binning on demand. We also reformulated the inner function of the operator. These two steps allow for finding geometrical parameters of iris somewhat faster and with, we believe, comparable robustness offered by Daugman's solution. In the paper the idea, the implementation and some results of rough tests of the code running on AP7000 application processor are presented. Also, possible improvements are discussed.