GPU accelerated image processing for everyone

This reference contains all methods currently available in CLIJ, CLIJ2 and CLIJx for working with matrices.. 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)

Method is available in clEsperanto (experimental)

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

[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.

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.

Computes the color deconvolution of an 8bit RGB stack color image with a given 3x3 matrix of color vectors. Note: The input image has to be a stack with three z-slices corresponding to the red, green and blue channel.)

Takes a touch matrix as input and delivers a vector with number of touching neighbors per label as a vector.

Generates a distance map from a binary image.

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

Computes the angle in radians between all point coordinates given in two point lists.

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.

Computes the distance between all point coordinates given in two point lists.

Computes the distance in X, Y or Z (specified with parameter axis) between all point coordinates given in two point lists.

Takes an image and an intensity range to determine a grey value co-occurrence matrix.

Takes an image and assumes its grey values are integers. It builds up a grey-level co-occurrence matrix of neighboring (west, south-west, south, south-east, in 3D 9 pixels on the next plane) pixel intensities.

Takes an image and assumes its grey values are integers. It builds up a grey-level co-occurrence matrix of neighboring (left, bottom, back) pixel intensities.

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.

Produces a touch-matrix where the n nearest neighbors are marked as touching neighbors.

Produces a touch-matrix where the neighbors within a given distance range are marked as touching neighbors.

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.

Checks if all elements of a matrix are different by less than or equal to a given tolerance.

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

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.

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

Takes a touch matrix and a vector of values to determine the most popular integer value among touching neighbors for every object. TODO: This only works for values between 0 and 255 for now.

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.

Takes a list of point indices to generate a touch matrix (a.k.a. adjacency graph matrix) out of it.

Sets all pixel values a of a given image A to a constant value v in case its coordinates x == y.

Sets all pixel values a of a given image A to a constant value v in case its coordinates x > y.

Sets all pixel values a of a given image A to a constant value v in case its coordinates x < y.

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 point list image representing n points (n*2 for 2D points, n*3 for 3D points) and a corresponding touch matrix , sized (n+1)*(n+1), and exports them in VTK format.

40 methods listed.