 Binary selection mask

A binary selection mask records which pixels belong to a chosen subset of an image. On a finite pixel grid $\Omega$, it is the indicator functionIt can represent an area region of interest, the result of image thresholding or a combination of selection rules. The mask describes membership; its entries need not equal the underlying image intensities.

For a selected pixel count $N>0$, the count and selected arithmetic mean areConsider the original arraysThe selected values are 0, 20 and 40, so $N=3$ and ${\bar{I}}_M=20$. The selected zero-valued pixel still contributes to the denominator. Replacing excluded pixels by zeros and averaging all six entries would instead give $60/6=10$: that asks a different question. An empty mask has $N=0$, so this selected-mean formula is undefined.

For rectangular pixels with calibrated dimensions $\Delta x=0.5\mathrm{mm}$ and $\Delta y=0.2\mathrm{mm}$, the complete-pixel area from a calibrated pixel count is $A=N\Delta x\Delta y=0.30\mathrm{m}{\mathrm{m}}^2$. These are stipulated array values and cell dimensions, not a measurement of an object.

A stored mask can use another two-value encoding. ImageJ's Create Mask command stores 255 inside an area selection and 0 outside, corresponding to $B_{ij}=255M_{ij}$ in this model.^[ref] Summing $B$ gives 765 in the example, rather than the selected count 3. Convert the encoding or count selected entries before interpreting a sum as an area.

Two normalized masks $M$ and $Q$ combine by set intersection through $M_{ij}{Q}_{ij}$. Their complement within the specified grid is $1-M_{ij}$. Record the foreground-background polarity, coordinate alignment and grid extent when transferring a mask between images.