将原始图象分成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

大量领域应用了计算几何的问题,包括欧几里得巡回售货员问题,最小生成树问题,隐藏线问题和线性规划问题-A large number of field applications of computational geometry problems, including Euclid roving salesman problem, minimum spanning tree problem, hidden line problem and linear programming problems, a

针对复杂背景及目标的分形特性差异, 提取图像四个方向的灰度梯度, 选择最小梯度大于阈值的区域进行平滑滤波, 最后对分维参数进行分段线性拉伸-Extraction of image in four directions of the gray gradient, minimum gradient is greater than the threshold area smoothing filter, the last on the fractal dimension parameters of p

分层聚类算法,类内采用最大距离，类间采用最小距离实现-Hierarchical clustering algorithm, the largest category within the distance, the minimum distance to achieve between classes

求故障树的 1）对偶树； 2）最小割级和最小路集； 3）假定底事件的故障概率已知，求顶事件发生的概率； 4）求底事件的结构重要度、概率重要度和关键重要度。-Seeking Fault Tree 1) dual tree 2) minimum cut level and minimal path sets 3) It is assumed that the end of the event of the failure probability known, find the p