Separating And Filling
Algorithms that improve segmentation by filling some area or separating connected objects.
- FillHoles2d: Fills the holes inside particles of a two-dimensional binary image.
- FillHoles3d: Fills the holes inside particles of a three-dimensional binary image.
- RegionalExtrema2d: Computes the regional extrema in a grayscale 2D image and marks them in a binary image.
- RegionalExtrema3d: Computes the regional extrema in a grayscale 3D image and marks them in a binary image.
- RemoveSmallHoles: Fills the smallest holes of a binary image.
- FillImageBorder3d: Fills holes of border faces of a three-dimensional binary image.
- ExpandLabelBoundaries: Performs a constrained dilation around objects of a label image.
- SeparateObjects: Separates connected objects in a binary image.
- HExtremaWatershed: Computes the watershed lines of a grayscale image.
- HExtrema2d: Merges the regional extrema in a 2d grayscale image and marks them in 2d a binary image.
- HExtrema3d: Computes the regional extrema in a 3d grayscale image and marks them in a 3d binary image.
- SeparateObjectsByBlock: Separates connected objects in a binary image in a low memory consumption mode.
- HExtremaWatershedByBlock: Computes the watershed lines of a grayscale image in a low memory consumption mode.
- ConvexHull2d: Fills the concavities of particles in a two-dimensional binary image.
The Separating and Filling group contains algorithms helpful for improving a segmentation by filling an object's hollow
areas (enclosed or open) or by separating objects that touch each other.