Lacunarity of a binary image

Lacunarity of a binary image based on the gloding box algorithm.

Description

The gliding box algorithm proposed by Tolle et al., Physica D, 237, 306-315, 2008 is used to calculate the lacunarity of a binary image.

• MATLAB release: MATLAB 7.1.0 (R14SP3)

[gijo augustin]

The loop in the program is not going upto the number of Columns. A modification like this would be more accurate,

for i=1:rnn
    for j=1:cnn
        sums = sum(sum(a(i:i+nn,j:j+nn)));
        sigma(index) = sigma(index) + sums;
        sigma2(index) = sigma2(index) + power(sums,2);
        [n,i,j]

    end
end

where, cnn = cols - nn;

[Tegy Vadakkan]

thanks gijo,
i should have said..., it is assumed that the image is a square image like 64x64, 128x128, 256x256, ...

[gijo augustin]

 

[hamza hamza]

Hi all,

Please, i want to understand this program. Because i have made a one with probabilities and masses, but it´s very slow, and i saw that yours is more fast and accurate. i would appreciate a short explanation. Thanks in advance

[Tegy Vadakkan]

Hamza,
A box of edge size n is glided over the entire image in steps of one pixel. At each pixel position, the program enumerates the total number of 1's in the box (variable sigma in the program) as well as the square of the number of 1's in the box (variable sigma2 in the program). Lacunarity at an edge size n is defined as (sigma2/sigma^2)*(N(n)). N(n) is the variable count in the program.