An efficient implementation of the gliding box lacunarity algorithm

Lacunarity is a measure of how data fills space. It complements fractal dimension, which measures how much space is filled. Many researchers use the gliding box algorithm to calculate lacunarity. This paper introduces a fast algorithm for making this calculation. This algorithm is akin to fast box-c...

Full description

Saved in:
Bibliographic Details
Published inPhysica. D Vol. 237; no. 3; pp. 306 - 315
Main Authors Tolle, Charles R., McJunkin, Timothy R., Gorsich, David J.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.03.2008
Elsevier
Subjects
Exact sciences and technology
Fractals
Mathematical methods in physics
Pattern recognition
Physics
Mathematical methods in physics
Fractals
Pattern recognition
Algorithms
Fractal
Fractal dimension
Non linear phenomenon
Mathematical physics
Online AccessGet full text

Cover

More Information
Summary:Lacunarity is a measure of how data fills space. It complements fractal dimension, which measures how much space is filled. Many researchers use the gliding box algorithm to calculate lacunarity. This paper introduces a fast algorithm for making this calculation. This algorithm is akin to fast box-counting algorithms used by some researchers to estimate fractal dimension. A simplified gliding box measure equation, along with key pseudo code implementations for the algorithm, are presented. Applications for the gliding box lacunarity measure have ranged from biological community modelling to target detection.
ISSN:0167-2789
1872-8022
DOI:10.1016/j.physd.2007.09.017