Fast algorithm for geometrical coding of digital images

In this paper fast algorithm for geometrical coding is presented. It allows to perform image analysis by methods of differential geometry rather than gradient or Hessian-based methods commonly used today for this purpose. One of the most important points in image analysis is speed of calculations. Fast algorithm for geometrical coding is comparable or faster than traditional algorithms of image analysis. In the paper several examples of contour detection are presented.