Utilization of Ward's method for clustering of pixels of color image

The approaching of an image by a dichotomous sequence of piecewise constant approximations with incrementing number of colors is considered. The hierarchy of approximations is calculated so that the colors are ordered by decrease of approximating errors accompanying with division into two of the cluster of pixels of a given color. The network data structure for high-speed computing based on Sleator-Tarjan dynamic trees is provided.