将原始图象分成eXe大小的子块，找出每块中的最大值和最小值，计算差值并量化，再用rXr大小的子块计算分形值-original image will be divided into eXe size of the block to identify every piece of the maximum and minimum, margin calculations and quantified, and then rXr size of the block-value calculation F

在给定的任意一个无向图中，利用反圈算法找出最小支撑树，得到一个图的连通性判断

找出几何图形的形心，并在原图的基础上进行标注-Centroid geometry to identify and mark on the basis of original