- java.lang.Object
-
- org.scijava.ops.image.topology.BoxCount
-
public final class BoxCount extends Object
An N-dimensional box counting that can be used to estimate the fractal dimension of an intervalThe algorithm repeatedly lays a fixed grid on the interval, and counts the number of sections that contain foreground. After each step the grid is made finer by a factor of
scaling. If the objects in the interval are fractal, the proportion of foreground sections should increase as the grid gets finer.Produces a set of points (log(foreground count), -log(section size)) for curve fitting. The slope of the function gives the fractal dimension of the interval.
- Author:
- Richard Domander (Royal Veterinary College, London), Per Christian Henden, Jens Bache-Wiig
-
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static <B extends BooleanType<B>>
List<ValuePair<DoubleType,DoubleType>>apply(RandomAccessibleInterval<B> input, Long maxSize, Long minSize, Double scaling, Long gridMoves)Counts the number of foreground sections in the interval repeatedly with different size sections
-
-
-
Method Detail
-
apply
public static <B extends BooleanType<B>> List<ValuePair<DoubleType,DoubleType>> apply(RandomAccessibleInterval<B> input, Long maxSize, Long minSize, Double scaling, Long gridMoves)
Counts the number of foreground sections in the interval repeatedly with different size sections- Parameters:
input- an n-dimensional binary interval- Returns:
- A list of (log(foreground count), -log(section size))
ValuePairobjects for curve fitting
-
-