ncolor 1.1.1

label matrix coloring algorithm

ncolor

Fast remapping of instance labels 1,2,3,...,M to a smaller set of repeating, disjoint labels, 1,2,...,N. The four-color-theorem guarantees that at most four colors are required for any 2D segmentation/map, but this algorithm will opt for 5 or 6 to give an acceptable result if it fails to find a 4-color mapping quickly. Also works for 3D labels (<8 colors typically required) and perhaps higher dimensions as well.

Usage

If you have an integer array called masks, you may transform it into an N-color representation as follows:

import ncolor.ncolor as ncolor
ncolor_masks = ncolor.label(masks)

The integer array ncolor_masks can then be visualized using any color map you prefer. The example in this README uses the viridis colormap. See example.ipynb for more details.