Geometrical coding of colored images

Formal analysis and computer recognition of 2D color images is an important branch of modern computer geometry. However, existing algorithms, although they are highly developed, are not quite satisfactory and seem to be much worse than (unknown) algorithms, which our brain uses to analyze eye information. Almost all existing algorithms omit colors and deal with grayscale transformations only. But in many cases color information is important. In this paper a fundamentally new method of coding and analyzing color digital images is proposed. The main point of this method is that a full-color digital image is represented without dropping colors by a special 2D surface in 3D space, after which it is analyzed by methods of differential geometry rather than traditional gradient-based or Hessian-based methods (like SIFT, GLOH, SURF, Canny operator, and many other algorithms).