Replace each pixel with the maximum value in each 3×3 neighborhood:

Use a rule that effectively finds isolated foreground pixels:

Use a sequence of operations to create a morphological opening:

Find the upper horizontal boundaries:

Use a named rule:

Iterate a transformation until convergence:

Endpoints of a skeleton object:

Branch points of a skeleton object:

Fill one-pixel-wide gaps in images:

Delete isolated foreground pixels:

Delete isolated background pixels:

Flip the background and foreground pixel values while preserving the boundaries:

Find the perimeter of the objects:

Remove the 8-connectivity of the background:

Fill corners:

Fill corners until convergence:

Find nonoverlapping bounding diamonds of objects:

Break the H-like features of the image:

Smooth boundaries and remove noise:

Translate objects by two pixels along the specified direction:

Straighten ragged boundaries:

Find branch points in a numeric array:

Replace the center pixels with the most common pixel value of the neighbors:

Compute the rule number that corresponds to a general transformation:

Rule number for a set of replacement rules that remove isolated foreground pixels:

Rule number corresponding to the Min function:

Find external boundaries of an image:

Negate an image:

Game of Life: