Connectivity Analysis

This algorithm generates a connected component analysis of an image.

Input

A single image or volume or a set containing any combination thereof.

Output

A label map with the same size of the input, representing the largest connected components of the image, ordered by size.

Description

This algorithms detects all connected components of an image that have a higher intensity than Threshold. The neighborhood connectivity is defined with the parameter Connectivity. If Minimum Component Size (resp. Maximum Component Size) is positive, all components with a number of pixels lower (resp. higher) than this number are discarded. If Number of Components is positive, only the first Number of Components are kept.