2008
DOI: 10.1016/j.physd.2007.09.017
|View full text |Cite
|
Sign up to set email alerts
|

An efficient implementation of the gliding box lacunarity algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
44
0
2

Year Published

2011
2011
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 67 publications
(46 citation statements)
references
References 7 publications
0
44
0
2
Order By: Relevance
“…The final dimension in the 2D space is between 1 and 2 (1 ≤ D ≤ 2) [23]. Lacunarity was estimated using the gliding-box algorithm, for different grid orientations [28]. A unit box of size r is chosen randomly and the number of set points p are counted i.e.…”
Section: Lacunaritymentioning
confidence: 99%
“…The final dimension in the 2D space is between 1 and 2 (1 ≤ D ≤ 2) [23]. Lacunarity was estimated using the gliding-box algorithm, for different grid orientations [28]. A unit box of size r is chosen randomly and the number of set points p are counted i.e.…”
Section: Lacunaritymentioning
confidence: 99%
“…First, the record was shifted such that there were no negative values in the time record, the gliding box was centered on each point in the data set, and the (velocity) values within the box were summed. The gliding box lacunarity is defined as (Tolle et al 2008): (6) where: (7) (8) and N was the sample size of the velocity time record.Lacunarity was calculated and plotted as a function of the size of the box, r, in units of seconds (see Fig. 3c,d).…”
mentioning
confidence: 99%
“…The former can give us a measure of complexity of a structure, as long as it can be considered a fractal, just like the retinal network [44]. The latter is a measure of heterogeneity of a fractal structure [45].…”
Section: Fractal Dimension and Lacunaritymentioning
confidence: 99%