This Article 
 Bibliographic References 
 Add to: 
Suboptimal Minimum Cluster Volume Cover-Based Method for Measuring Fractal Dimension
January 2003 (vol. 25 no. 1)
pp. 32-41

Abstract—A new method for calculating fractal dimension is developed in this paper. The method is based on the box dimension concept; however, it involves direct estimation of a suboptimal covering of the data set of interest. By finding a suboptimal cover, this method is better able to estimate the required number of covering elements for a given cover size than is the standard box counting algorithm. Moreover, any decrease in the error of the covering element count directly increases the accuracy of the fractal dimension estimation. In general, our method represents a mathematical dual to the standard box counting algorithm by not solving for the number of boxes used to cover a data set given the size of the box. Instead, the method chooses the number of covering elements and then proceeds to find the placement of smallest hyperellipsoids that fully covers the data set. This method involves a variant of the Fuzzy-C Means clustering algorithm, as well as the use of the Minimum Cluster Volume clustering algorithm. A variety of fractal dimension estimators using this suboptimal covering method are discussed. Finally, these methods are compared to the standard box counting algorithm and wavelet-decomposition methods for calculating fractal dimension by using one-dimensional cantor dust sets and a set of standard Brownian random fractal images.

[1] C.R. Tolle and D. Gorsich, “Sub-Optimal Covers for Measuring Fractal Dimension,” Proc. Rocky Mountain NASA Space G. Consortium Conf., 1996.
[2] D. Gorsich, C.R. Tolle, R. Karlsen, and G. Gerhart, “Wavelet and Fractal Analysis of Ground Vehicle Signatures,” Proc. Seventh Ann. Ground Vehicle Survivability Symp., Mar. 1996.
[3] D. Gorsich, C.R. Tolle, R. Karlsen, and G. Gerhart, “Wavelet and Fractal Analysis of Ground Vehicle Images,” Proc. SPIE Symp., Aug. 1996.
[4] L.F. Jardine, “Fractal-Based Analysis and Synthesis of Multispectral Visual Texture for Camouflage,” Applications of Fractals and Choas, pp. 101-116, New York: Springer-Verlag, 1993.
[5] D.E. Kreithen, S.D. Halversen, and G.J. Owirka, “Discriminating Targets from Clutter,” MIT Lincoln Laboratory J., vol. 6, no. 1,Spring, pp. 25-52, 1993.
[6] B.B. Mandelbrot, The Fractal Geometry of Nature: Updated and Augmented. New York: W.H. Freeman and Company, 1983.
[7] C.R. Tolle, T.R. McJunkin, D.T. Rohrbaugh, and R.A. LaViolette, “Optimal Cover-Based Definitions of Lacunarity for Ramified Data Sets,” Physica D, submitted for publication Dec. 2000.
[8] B. Dubuc and S. Dubuc, “Error Bounds on the Estimation of Fractal Dimension,” Siam J. Numerical Analysis, vol. 33, no. 2, pp. 602-626, Apr. 1996.
[9] B. Dubuc, “Evaluating the Fractal Dimension of Profiles,” Physics Rev. A, vol. 39, no. 3, pp. 1500-1512, 1989.
[10] X.C. Jin, S.H. Ong, and Jayasooriah, “A Practical Method for Estimating Fractal Dimension,” Pattern Recognition Letters, vol. 16, no. 5, pp. 457-464, May 1995.
[11] R.M. Summers, L.M. Pusanik, J.D. Malley, and J.M. Hoeg, “Fractal Analysis of Virtual Endoscopy Reconstructions,” Proc. SPIE Medical Imaging: Physiology and Function from Multidemensional Images, C.-T. Chen and A.V. Clough, eds., vol. 3660, pp. 258-269, 1999.
[12] X. Jeng, L. Koehl, and C. Vasseur, “Design and Implementation of an Estimator of Fractal Dimension Using Fuzzy Techniques,” Pattern Recognition, vol. 34, no. 1, pp. 151-169, Jan. 2001.
[13] K. Forotan-pour, P. Dutilleul, and D.L. Smith, “Advances in the Implementation of the Box-Counting Method of Fractal Dimension Estimation,” Applied Math. and Computation, vol. 105, nos. 2-3, pp. 195-210, Nov. 1999.
[14] S.G. Mallat,“A theory for multiresolution signal decomposition: The wavelet representation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 7, pp. 674-693, 1989.
[15] Texturing and Modeling: A Procedural Approach. D.S. Ebert, ed., pp. 256-260, Cambridge, Mass.: Academic Press Professional, 1994.
[16] H.-O. Peitgen, H. Jürgens, and D. Saupe, Chaos and Fractals: New Frontiers of Science. New York: Springer-Verlag, 1992.
[17] J.B. Bassingthwaighte, L.S. Liebovitch, and B.J. West, Fractal Physiology. New York: Am. Physiological Soc., 1994.
[18] R. Krishnapuram and J. Kim, “Clustering Algorithms on Volume Criteria,” IEEE Trans. Fuzzy Systems, vol. 8, no. 2, pp. 228-236, Apr. 2000.
[19] R. Cannon, J. Dave, and J. Bezdek, “Efficient Implementation of the Fuzzyc-means Clustering Algorithms,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, pp. 248-255, 1986.
[20] P.V. O'Neil, Advanced Engineering Mathematics, pp. 57-61. Belmont, Calif.: Wadsworth Publishing, 1987.
[21] P. Hartman, Ordinary Differential Equations. New York: John Wiley&Sons, 1964.
[22] R.D. Blumofe et al., "Cilk: An Efficient Multithreaded Runtime System," J. Parallel and Distributed Computing, vol. 37, no. 1, Aug. 1996, pp. 55-69; .
[23] M. Frigo, K.H. Randall, and C.E. Leiserson, “The Implementation of the Cilk-5 Multithreaded Language,” Proc. ACM SIGPLAN '98 Conf. Programming Language Design and Implementation (PLDI), June 1998.

Index Terms:
Fractal dimension, Fuzzy-C means, suboptimal cover, box counting, clustering, texture analysis.
Charles R. Tolle, Timothy R. McJunkin, David J. Gorisch, "Suboptimal Minimum Cluster Volume Cover-Based Method for Measuring Fractal Dimension," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 1, pp. 32-41, Jan. 2003, doi:10.1109/TPAMI.2003.1159944
Usage of this product signifies your acceptance of the Terms of Use.