Fast algorithm for geometrical coding of digital images

Abstract

A fast algorithm for geometrical coding is presented in the paper. It allows one to perform the image analysis by methods of differential geometry rather than widespread methods based on gradient and Hessian calculations. Nowadays, one of the most important aspects in image analysis is the speed of computations. The algorithm for geometrical coding is comparable or faster than traditional algorithms of image analysis and in many cases it gives better results. Several examples of algorithm working results for contour detection are presented.