public class BoxCount<B extends BooleanType<B>> extends AbstractUnaryFunctionOp<RandomAccessibleInterval<B>,List<ValuePair<DoubleType,DoubleType>>> implements Ops.Topology.BoxCount
The 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
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.
|Constructor and Description|
|Modifier and Type||Method and Description|
Counts the number of foreground sections in the interval repeatedly with different size sections
in, out, run, setInput
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
calculate, getIndependentInstance, run
public List<ValuePair<DoubleType,DoubleType>> calculate(RandomAccessibleInterval<B> input)
Copyright © 2014–2017 ImageJ. All rights reserved.