Pyramidal Implementation of the Lucas Kanade Feature ...

Let us de ne the pyramid representsation of a generic image Iof size n x n y. Let I0 = Ibe the \zeroth" level image. This image is essentially the highest resolution image (the raw image). The image width and height at that level are de ned as n0 x= n and n0 y = n y. The pyramid representation is then built in a recursive fashion: compute

  Kadena, Alcu, Lucas kanade