Constructor Detail

• ConnectedComponentAnalysis

  public ConnectedComponentAnalysis()

Method Detail

• idFromIntervalIndexer

  public static <T> ToLongBiFunction<Localizable,T> idFromIntervalIndexer(Interval interval)

• connectedComponents

  public static <B extends BooleanType<B>,L extends IntegerType<L>> void connectedComponents(RandomAccessibleInterval<B> mask,
                                                                                             RandomAccessibleInterval<L> labeling)

  Implementation of connected component analysis that uses IntArrayRankedUnionFind to find sets of pixels that are connected with respect to a 4-neighborhood (DiamondShape) or the generalization for higher dimenions over a binary mask. mask and labeling are expected to have equal min and max.

  Parameters:

  mask - Boolean mask to distinguish foreground (true) from background (false).

  labeling - Output parameter to store labeling: background pixels are labeled zero, foreground pixels are greater than zero: 1, 2, ..., N. Note that initially all pixels are expected to be zero as background values will not be written.

• connectedComponents

  public static <B extends BooleanType<B>,L extends IntegerType<L>> void connectedComponents(RandomAccessibleInterval<B> mask,
                                                                                             RandomAccessibleInterval<L> labeling,
                                                                                             Shape shape)

  Implementation of connected component analysis that uses IntArrayRankedUnionFind to find sets of pixels that are connected with respect to a neighborhood (shape) over a binary mask. mask and labeling are expected to have equal min and max.

  Parameters:

  mask - Boolean mask to distinguish foreground (true) from background (false).

  labeling - Output parameter to store labeling: background pixels are labeled zero, foreground pixels are greater than zero: 1, 2, ..., N. Note that initially all pixels are expected to be zero as background values will not be written.

  shape - Connectivity of connected components, e.g. 4-neighborhood (DiamondShape), 8-neighborhood (RectangleNeighborhood) and their generalisations for higher dimensions.

• connectedComponents

  public static <B extends BooleanType<B>,L extends IntegerType<L>> void connectedComponents(RandomAccessibleInterval<B> mask,
                                                                                             RandomAccessibleInterval<L> labeling,
                                                                                             Shape shape,
                                                                                             LongFunction<UnionFind> unionFindFactory,
                                                                                             ToLongBiFunction<Localizable,L> idForPixel,
                                                                                             LongUnaryOperator idForSet)

  Implementation of connected component analysis that uses UnionFind to find sets of pixels that are connected with respect to a neighborhood (shape) over a binary mask. mask and labeling are expected to have equal min and max.

  Parameters:

  mask - Boolean mask to distinguish foreground (true) from background (false).

  labeling - Output parameter to store labeling: background pixels are labeled zero, foreground pixels are greater than zero: 1, 2, ..., N. Note that this is expected to be zero as background values will not be written.

  shape - Connectivity of connected components, e.g. 4-neighborhood (DiamondShape), 8-neighborhood (RectangleNeighborhood) and their generalisations for higher dimensions.

  unionFindFactory - Creates appropriate UnionFind data structure for size of labeling, e.g. IntArrayRankedUnionFind of appropriate size.

  idForPixel - Create id from pixel location and value. Multiple calls with the same argument should always return the same result.

  idForSet - Create id for a set from the root id of a set. Multiple calls with the same argument should always return the same result.

• connectedComponentsOnAffinities

  public static <B extends BooleanType<B>,C extends RealComposite<B>,L extends IntegerType<L>> void connectedComponentsOnAffinities(RandomAccessible<C> affinities,
                                                                                                                                    long[][] affinityOffsets,
                                                                                                                                    RandomAccessibleInterval<L> labeling,
                                                                                                                                    UnionFind uf,
                                                                                                                                    ToLongBiFunction<Localizable,L> id,
                                                                                                                                    LongUnaryOperator idForSet)

  Connected components on a regular arbitrary boolean affinity graph.

  Type Parameters:

  B - boolean type used for affinity scalars

  C - affinity vector

  L - label output must fit number of components

  Parameters:

  affinities - affinity vector for each pixel

  affinityOffsets - offset vector for each affinity index

  labeling - output

  uf - union find

  id - id generator for pixels/ locations

  idForSet - id generator for components

• connectedComponentsOnAffinities

  public static <B extends BooleanType<B>,C extends RealComposite<B>,L extends IntegerType<L>> void connectedComponentsOnAffinities(RandomAccessible<C> affinities,
                                                                                                                                    long[][] affinityOffsets,
                                                                                                                                    RandomAccessibleInterval<L> labeling,
                                                                                                                                    UnionFind uf,
                                                                                                                                    long firstIndex)

  Connected components on a regular arbitrary boolean affinity graph. Each component gets the id of the first pixel (in flat iteration order) inside the component increased by firstIndex.

  Type Parameters:

  B - boolean type used for affinity scalars

  C - affinity vector

  L - label output must fit number of components

  Parameters:

  affinities - affinity vector for each pixel

  affinityOffsets - offset vector for each affinity index

  labeling - output

  firstIndex -