A new version of Visual tool for estimating the fractal dimension of images

This work presents a new version of a Visual Basic 6.0 application for estimating the fractal dimension of images (Grossu et al., 2009 [1]). The earlier version was limited to bi-dimensional sets of points, stored in bitmap files. The application was extended for working also with comma separated values files and three-dimensional images.

New version program summary

Program title: Fractal Analysis v02Catalogue identifier: AEEG_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEG_v2_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 9999No. of bytes in distributed program, including test data, etc.: 4 366 783Distribution format: tar.gzProgramming language: MS Visual Basic 6.0Computer: PCOperating system: MS Windows 98 or laterRAM: 30 MClassification: 14Catalogue identifier of previous version: AEEG_v1_0Journal reference of previous version: Comput. Phys. Comm. 180 (2009) 1999Does the new version supersede the previous version?: YesNature of problem: Estimating the fractal dimension of 2D and 3D images.Solution method: Optimized implementation of the box-counting algorithm.Reasons for new version:

1.

The previous version was limited to bitmap image files. The new application was extended in order to work with objects stored in comma separated values (csv) files. The main advantages are:

a)

Easier integration with other applications (csv is a widely used, simple text file format);

b)

Less resources consumed and improved performance (only the information of interest, the “black points”, are stored);

c)

Higher resolution (the points coordinates are loaded into Visual Basic double variables [2]);

d)

Possibility of storing three-dimensional objects (e.g. the 3D Sierpinski gasket).

2.

In this version the optimized box-counting algorithm [1] was extended to the three-dimensional case.

Summary of revisions:

1.

The application interface was changed from SDI (single document interface) to MDI (multi-document interface).

2.

One form was added in order to provide a graphical user interface for the new functionalities (fractal analysis of 2D and 3D images stored in csv files).

Additional comments: User friendly graphical interface; Easy deployment mechanism.Running time: In the first approximation, the algorithm is linear.References:

[1] I.V. Grossu, C. Besliu, M.V. Rusu, Al. Jipa, C.C. Bordeianu, D. Felea, Comput. Phys. Comm. 180 (2009)  1999-2001.

[2] F. Balena, Programming Microsoft Visual Basic 6.0, Microsoft Press, US, 1999.

     

Fast distance transformation on irregular two-dimensional grids

In this article, we propose a new fast algorithm to compute the squared Euclidean distance transform (E²DT) on every two-dimensional (2-D) irregular isothetic grids (regular square grids, quadtree based grids, etc.). Our new fast algorithm is an extension of the E²DT method proposed by Breu et al. [3]. It is based on the implicit order of the cells in the grid, and builds a partial Voronoi diagram of the centers of background cells thanks to a data structure of lists. We compare the execution time of our method with the ones of others approaches we developed in previous works. In those experiments, we consider various kinds of classical 2-D grids in imagery to show the interest of our methodology, and to point out its robustness. We also show that our method may be interesting regarding an application where we extract an adaptive medial axis construction based on a quadtree decomposition scheme.     

多层土壤中含有不同电阻率块状媒质时的接地网分析

基于矩量法和边界元法，提出一种用于分析含有电阻率分块均匀材料的水平分层土壤中的接地系统性能的数值计算方法。这种方法以导体上的漏电流和有限体积材料表面的电荷密度为待求变量，与国际上其他方法相比，该方法使用的未知量数显著减少，并且可以分析复杂多层土壤中的接地网性能。通过与小接地网上的测试结果进行对比，也验证了文中方法的有效性。应用文中方法对埋在双层土壤中的大型水电站的接地网进行了计算。     

电网的弹性力学网络拓扑映射

电网拓扑只在二维平面反映地理位置节点的连接情况,无法动态显现状态量之间的关系。将电网映射成三维空间展开布置的纵向受力的弹性网络,既保持了电网原有的拓扑连接状态,又显现了功角之间的物理特性。将广域测量系统（wide area measurement system,WAMS）实测状态量放入该映射模型,通过弹性网络形变直观地显现电网功角状态变化,摆脱对元件参数精确性的依赖,提高对电网状态变化的预判能力。算例和分析都证明了该映射的合理性。映射的弹性网络适用于功角特性突出的电网状态分析,如静态功角稳定分析、功角可靠性分析和低频振荡机制分析等。该研究对实现电网可视化智能分析与控制具有实际意义。     

电网继电保护综合自动化系统的研究

针对电网运行综合现状,阐述了综合利用整个电网的一、二次设备信息,提出电网继电保护综合自动化系统的概念,介绍了电网继电保护综合自动化系统的系统结构、功能及实现方法,最后对系统的管理、安全性以及规约问题提出建议。     

分形理论在火焰稳定性诊断中的应用

该文将分形理论运用于火焰稳定性的研究，提出一种基于分形特征的图像分割方法，把火焰从背景中分离出来。此方法适应性比较好，并具有良好的抗噪性能。同时通过实验表明，除了传统常用的反映火焰燃烧状态的特征参量外，分形维数也可作为一个反映火焰稳定性的图像指标，运用到火焰稳定性诊断中去。     

国外电网发展的回顾和展望

回顾了国外主要大电网发展的历程,展望了国外各大电网近些年的发展动向,并分析了未来电网发展面临的挑战,经济发展对未来电网的要求以及未来电网的发展趋势,期望国外的经验为我国全国联网工程的推进提供一定的参考和启发。     

油气田分布的分形分析初探

该文将分形、分维数概念引入到油气田分布规律的研究中来,通过利用网格覆盖法对辽河断陷部分油气田分维数的计算分析,初步证实了辽河油田对分形分布规律的遵从,且它们的大小也可用分维数表示,如果进一步深入研究,还将可以为油气田潜力的预测提供依据。     

Characterization of floc size, strength and structure under various coagulation mechanisms

Flocs generated by various coagulation mechanisms exhibit different size, strength and structure. The properties and fractal dimensions of flocs formed under three common coagulation mechanisms, i.e. charge neutralization, sweep and bridging, were investigated at various hydraulic conditions. The results showed that the floc size decreased with the increasing average velocity gradient G and the stable floc size exponent γ was of the following hierarchy: charge neutralization (0.6107) > sweep (0.5618) > bridging (0.3674). Furthermore, fractal dimensions of flocs were the highest when formed by sweep and the lowest when generated by bridging flocculation. The mass fractal dimensions measured by light scattering were between 2.0 and 3.0 and the floc strength was between 0.01 and 0.58 N m^− 2. An intrinsic unity of the relationship among floc size, fractal dimensions, floc strength under the three coagulation mechanisms was demonstrated.     

Image based rendering of iterated function systems

A fast method to generate fractal imagery is presented. Iterated function systems (IFS) are based on repeatedly copying transformed images. We show that this can be directly translated into standard graphics operations: Each image is generated by texture mapping and blending copies of the previous image. Animations of dynamic IFS codes are generated at 50 frames/s on a notebook PC, using commodity graphics hardware. Various extensions and variations are presented.