GPU accelerated image processing for everyone

This reference contains all methods currently available in CLIJ, CLIJ2 and CLIJx for processing graphs.. Read more about CLIJs release cycle

**Please note:** CLIJ is deprecated. Make the transition to CLIJ2.

Method is available in CLIJ (deprecated release)

Method is available in CLIJ2 (stable release)

Method is available in CLIJx (experimental release)

**Categories:** Binary, Filter, Graphs, Labels, Math, Matrices, Measurements, Projections, Transformations

[A], B, C,[D], E, F,[G], H, I, J, K,[L],[M],[N], O,[P], Q, R,[S],[T], U, V, W, X, Y, Z

Converts a adjacency matrix in a touch matrix

Takes a label map, determines distances between all centroids and replaces every label with the average distance to the n closest neighboring labels.

Determines the average of the n closest points for every point in a distance matrix.

Determines the average of the n far off (most distant) points for every point in a distance matrix.

Takes a touch matrix and a distance matrix to determine the average distance of touching neighbors for every object.

Takes a label map, determines which labels touch and replaces every label with the average distance to their neighboring labels.

Generates a mesh from a distance matric and a list of point coordinates.

Starting from a label map, draw lines between touching neighbors resulting in a mesh.

Starting from a label map, draw lines between touching neighbors resulting in a mesh.

Starting from a label map, draw lines between touching neighbors resulting in a mesh.

Takes two labelmaps with n and m labels and generates a (n+1)*(m+1) matrix where all pixels are set to 0 exept those where labels overlap between the label maps.

Takes two images containing coordinates and builds up a matrix containing distance between the points.

Takes two labelmaps with n and m labels_2 and generates a (n+1)*(m+1) matrix where all labels_1 are set to 0 exept those where labels_2 overlap between the label maps.

Takes a label map with n labels and generates a (n+1)*(n+1) matrix where all pixels are set the number of pixels where labels touch (diamond neighborhood).

Takes a labelmap with n labels and generates a (n+1)*(n+1) matrix where all pixels are set to 0 exept those where labels are touching.

Takes a label map, determines distances between all centroids, the mean distance of the n closest points for every point and replaces every label with the maximum distance of touching labels.

Takes a label map, determines which labels touch, the distance between their centroids and the maximum distancebetween touching neighbors. It then replaces every label with the that value.

Takes a label map, determines which labels touch, determines for every label with the number of touching neighboring labels and replaces the label index with the local maximum of this count.

Takes a label map, determines distances between all centroids, the mean distance of the n closest points for every point and replaces every label with the mean distance of touching labels.

Takes a label map, determines which labels touch, the distance between their centroids and the mean distancebetween touching neighbors. It then replaces every label with the that value.

Takes a label map, determines which labels touch and how much, relatively taking the whole outline of each label into account, and determines for every label with the mean of this value and replaces the label index with that value.

Takes a label map, determines which labels touch, determines for every label with the number of touching neighboring labels and replaces the label index with the local mean of this count.

Takes a label map, determines distances between all centroids, the mean distance of the n closest points for every point and replaces every label with the median distance of touching labels.

Takes a label map, determines which labels touch, the distance between their centroids and the median distancebetween touching neighbors. It then replaces every label with the that value.

Takes a label map, determines which labels touch, determines for every label with the number of touching neighboring labels and replaces the label index with the local median of this count.

Takes a label map, determines distances between all centroids, the mean distance of the n closest points for every point and replaces every label with the minimum distance of touching labels.

Takes a label map, determines which labels touch, the distance between their centroids and the minimum distancebetween touching neighbors. It then replaces every label with the that value.

Takes a label map, determines which labels touch, determines for every label with the number of touching neighboring labels and replaces the label index with the local minimum of this count.

Takes a label map, determines distances between all centroids, the mean distance of the n closest points for every point and replaces every label with the standard deviation distance of touching labels.

Takes a label map, determines which labels touch, the distance between their centroids and the standard deviation distancebetween touching neighbors. It then replaces every label with the that value.

Takes a label map, determines which labels touch, determines for every label with the number of touching neighboring labels and replaces the label index with the local standard deviation of this count.

Takes a touch matrix and a vector of values to determine the maximum value among touching neighbors for every object.

Takes a touch matrix and a vector of values to determine the mean value among touching neighbors for every object.

Takes a touch matrix and a vector of values to determine the median value among touching neighbors for every object.

Takes a touch matrix and a distance matrix to determine the shortest distance of touching neighbors for every object.

Determine the n point indices with shortest distance for all points in a distance matrix.

Determine the n point indices with shortest distance for all points in a distance matrix.

Determines neighbors of neigbors from touch matrix and saves the result as a new touch matrix.

Meshes all points in a given point list which are indiced in a corresponding index list.

Determine the shortest distance from a distance matrix.

Takes a touch matrix and a vector of values to determine the standard deviation value among touching neighbors for every object.

Converts a touch matrix in an adjacency matrix

Takes a pointlist with dimensions n*d with n point coordinates in d dimensions and a touch matrix of size n*n to draw lines from all points to points if the corresponding pixel in the touch matrix is 1.

Takes a label map, determines which labels touch and replaces every label with the number of touching neighboring labels.