Skip to content

Latest commit

 

History

History
419 lines (277 loc) · 51.8 KB

reference__filter.md

File metadata and controls

419 lines (277 loc) · 51.8 KB

CLIJ 1/2/x reference in category 'filter'

This reference contains all methods currently available in CLIJ, CLIJ2 and CLIJx for filtering images.. 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

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

B

Applies a bilateral filter using a box neighborhood with sigma weights for space and intensity to the input image.

Determines pixels/voxels which are on the surface of binary objects and sets only them to 1 in the destination image. All other pixels are set to 0.

Fills holes (pixels with value 0 surrounded by pixels with value 1) in a binary image.

Fills holes (pixels with value 0 surrounded by pixels with value 1) in a binary image stack slice by slice.

Computes a binary image (containing pixel values 0 and 1) from an image X by negating its pixel values x using the binary NOT operator !

Computes the Gaussian blurred image of an image given two sigma values in X and Y.

Computes the Gaussian blurred image of an image given two sigma values in X, Y and Z.

Computes the Gaussian blurred image of an image given two sigma values in X and Y. Thus, the filterkernel can have non-isotropic shape.

Apply a bottom-hat filter for background subtraction to the input image.

Applies a bottom-hat filter for background subtraction to the input image.

C

Apply a binary closing to the input image by calling n dilations and n erosions subsequenntly.

Apply a binary closing to the input image by calling n dilations and n erosions subsequently.

Convolve the image with a given kernel image.

Determines the number of all pixels in a given image which are not equal to 0.

Counts non-zero pixels in a sphere around every pixel.

Counts non-zero pixels in a sphere around every pixel slice by slice in a stack.

Counts non-zero voxels in a sphere around every voxel.

Performs cross correlation analysis between two images.

D

Takes a labelmap and returns an image where all pixels on label edges are set to 1 and all other pixels to 0.

Applies Gaussian blur to the input image twice with different sigma values resulting in two images which are then subtracted from each other.

Applies Gaussian blur to the input image twice with different sigma values resulting in two images which are then subtracted from each other.

Computes a binary image with pixel values 0 and 1 containing the binary dilation of a given input image.

Computes a binary image with pixel values 0 and 1 containing the binary dilation of a given input image.

Computes a binary image with pixel values 0 and 1 containing the binary dilation of a given input image.

Computes a binary image with pixel values 0 and 1 containing the binary dilation of a given input image.

Generates a distance map from a binary image.

Applies Gaussian blur to the input image and divides the original by the result.

E

Determines the local entropy in a box with a given radius around every pixel.

Determines correction factors for each z-slice so that the average intensity in all slices can be made the same and multiplies these factors with the slices.

Computes a binary image with pixel values 0 and 1 containing the binary erosion of a given input image.

Computes a binary image with pixel values 0 and 1 containing the binary erosion of a given input image.

Computes a binary image with pixel values 0 and 1 containing the binary erosion of a given input image.

Computes a binary image with pixel values 0 and 1 containing the binary erosion of a given input image.

This operation removes labels from a labelmap and renumbers the remaining labels.

Removes all labels from a label map which touch the edges of the image (in X, Y and Z if the image is 3D).

This operation follows a ray from a given position towards a label (or opposite direction) and checks if there is another label between the label an the image border.

Removes labels from a label map which are not within a certain size range.

This operation follows a ray from a given position towards a label (or opposite direction) and checks if there is another label between the label an the image border.

This operation removes labels from a labelmap and renumbers the remaining labels.

This operation removes labels from a labelmap and renumbers the remaining labels.

Computes base exponential of all pixels values.

Takes a label map image and dilates the regions using a octagon shape until they touch.

Extend labels with a given radius.

F

Replaces recursively all pixels of value a with value b if the pixels have a neighbor with value b.

G

Applies a gamma correction to an image.

Computes the Gaussian blurred image of an image given two sigma values in X and Y.

Computes the Gaussian blurred image of an image given two sigma values in X, Y and Z.

Generates a feature stack for Trainable Weka Segmentation.

Computes the gradient of gray values along X.

Computes the gradient of gray values along Y.

Computes the gradient of gray values along Z.

Inspired by Grayscale attribute filtering from MorpholibJ library by David Legland & Ignacio Arganda-Carreras.

I

Determines the mean intensity of the image stack and multiplies it with a factor so that the mean intensity becomes equal to a given value.

Determines the mean intensity of all pixel the image stack which are above a determined Threshold (Otsu et al. 1979) and multiplies it with a factor so that the mean intensity becomes equal to a given value.

L

Transforms a binary image with single pixles set to 1 to a labelled spots image.

Takes a labelled image and dilates the labels using a octagon shape until they touch.

Applies the Laplace operator (Box neighborhood) to an image.

Applies the Laplace operator (Diamond neighborhood) to an image.

Applies a local minimum and maximum filter.

Computes a binary image with pixel values 0 and 1 depending on if a pixel value x in image X was above of equal to the pixel value m in mask image M.

M

Computes a masked image by applying a binary mask to an image.

Computes a masked image by applying a label mask to an image.

Computes a masked image by applying a binary 2D mask to an image stack.

Computes the local maximum of a pixels rectangular neighborhood.

Computes the local maximum of a pixels ellipsoidal neighborhood.

Computes the local maximum of a pixels cube neighborhood.

Computes the local maximum of a pixels spherical neighborhood.

Applies a maximum filter with kernel size 3x3 n times to an image iteratively.

Computes the local mean average of a pixels rectangular neighborhood.

Computes the local mean average of a pixels ellipsoidal neighborhood.

Computes the local mean average of a pixels cube neighborhood.

Computes the local mean average of a pixels spherical neighborhood.

Computes the local mean average of a pixels ellipsoidal 2D neighborhood in an image stack slice by slice.

Computes the local median of a pixels rectangular neighborhood.

Computes the local median of a pixels ellipsoidal neighborhood.

Computes the local median of a pixels cuboid neighborhood.

Computes the local median of a pixels spherical neighborhood.

Computes the local minimum of a pixels rectangular neighborhood.

Computes the local minimum of a pixels ellipsoidal neighborhood.

Computes the local minimum of a pixels cube neighborhood.

Computes the local minimum of a pixels spherical neighborhood.

Applies a minimum filter with kernel size 3x3 n times to an image iteratively.

N

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

Applies a non-local means filter using a box neighborhood with a Gaussian weight specified with sigma to the input image.

Apply a maximum filter (box shape) to the input image.

Apply a maximum filter (diamond shape) to the input image.

Apply a minimum filter (box shape) to the input image.

Apply a minimum filter (diamond shape) to the input image.

O

Apply a local maximum filter to an image which only overwrites pixels with value 0.

Apply a local maximum filter to an image which only overwrites pixels with value 0.

Apply a binary opening to the input image by calling n erosions and n dilations subsequenntly.

Apply a binary opening to the input image by calling n erosions and n dilations subsequenntly.

P

Apply a binary watershed to a binary image and introduce black pixels between objects.

R

Replaces integer intensities specified in a vector image.

Replaces a specific intensity in an image with a given new value.

Replaces pixel values x with y in case x is zero.

S

Takes a label map (seeds) and an input image with gray values to apply the watershed algorithm and split the image above a given threshold in labels.

Erodes a binary image until just its skeleton is left.

Convolve the image with the Sobel kernel.

Convolve the image with the Sobel kernel slice by slice.

Determines the squared difference pixel by pixel between two images.

Computes the local standard deviation of a pixels box neighborhood.

Computes the local standard deviation of a pixels spherical neighborhood.

Applies Gaussian blur to the input image and subtracts the result from the original image.

T

Convolve the image with the Tenengrad kernel slice by slice.

Convolve the image with the Tenengrad kernel slice by slice.

Applies a Difference-of-Gaussian filter to an image and thresholds it with given sigma and threshold values.

Applies a top-hat filter for background subtraction to the input image.

Applies a minimum filter with kernel size 3x3 n times to an image iteratively.

Applies a minimum filter with kernel size 3x3 n times to an image iteratively.

Applies a top-hat filter for background subtraction to the input image.

V

Computes the local variance of a pixels box neighborhood.

Computes the local variance of a pixels spherical neighborhood.

Takes a binary image, labels connected components and dilates the regions using a octagon shape until they touch.

Takes a binary image and dilates the regions using a octagon shape until they touch.

W

Apply a binary watershed to a binary image and introduces black pixels between objects.

127 methods listed.