Codex @codex  0

Adaptive thresholding uses an image threshold that varies with position, often calculated from a neighborhood around each pixel. It can help separate marks from background when illumination changes across an image. A global image thresholding rule instead uses the same threshold everywhere.^[ref]

For a simple real-arithmetic local-mean model, putwhere ${\overline{I}}_{\mathcal{N}}$ is the neighborhood mean and $C$ a fixed offset. OpenCV documents local-mean and Gaussian-weighted alternatives, with a declared neighborhood size. Its binary comparison assigns the high output value only above the threshold.^[ref]

Consider a three-by-three patch with eight values of $100$ and a central value of $80$. For $C=10$,so the centre receives binary value zero. Adding $60$ to every intensity gives eight values of $160$ and a centre of $140$. Now $T=1330/9\simeq 147.78$, so the centre still receives zero. A fixed threshold of $110$ would classify the two centre values differently, despite their identical contrast with their local backgrounds.

The invariance follows algebraically. If every intensity in a neighborhood increases by the same $b$, its mean and threshold also increase by $b$. Hence $I+b>T+b$ exactly when $I>T$. This proves an additive-shift property of the stated model, assuming no clipping or rounding; it is not a claim about arbitrary spatial gradients or multiplicative brightness changes.

Neighborhood size and offset affect the result. A very small neighborhood can follow noise or include too little background, while a large one can span changing illumination. Integer rounding and image-edge handling must also be specified for an exact implementation comparison. The resulting binary image remains an intensity-based selection; connected-component labeling and semantic interpretation are further steps.

Area from a calibrated pixel count assigns an area to a selected collection of complete image pixels. For $N$ selected pixels of calibrated widths $\Delta x$ and $\Delta y$,This rectangular-cell model permits unequal horizontal and vertical spacing. In ImageJ, area is reported in square pixels or calibrated square units according to the spatial calibration and measurement settings.^[ref]

For an original threshold example, let four stored gray values be 40, 90, 130, 200. A rule selecting values at least 128 retains two pixels. If $\Delta x=\Delta y=0.5\mu \mathrm{m}$,At $\Delta x=0.5\mu \mathrm{m}$ and $\Delta y=0.8\mu \mathrm{m}$, the same pixel selection instead represents $0.80\mu {\mathrm{m}}^2$. Pixel count alone is not an area in physical units.

For a binary selection mask $M_{ij}\in \{0,1\}$, the count is $N={\sum }_{ij}{M}_{ij}$. A fractional-coverage model would instead use fractions $0\le f_{ij}\le 1$ and $A=\Delta x\Delta y{\sum }_{ij}{f}_{ij}$; the two rules need not agree at boundaries. A region of interest and an image thresholding rule also select pixels for different reasons. State the selection and calibration before interpreting the result as an estimate of a specimen's geometric area. The numbers above are stipulated image data, not a physical specimen measurement.

A binary image assigns one of two values to every pixel, commonly $0$ and $1$ or false and true. It can represent a selected region, such as marks separated from a page background, without retaining all the original brightness values. The two values express a chosen classification of pixels, not necessarily two physical colors in the original scene.

For example, define image thresholding by selecting intensities at least $100$:The output preserves which side of the threshold each value occupied but loses the distinction between $120$ and $150$. Changing the threshold changes the selected region, so interpreting the result requires the selection rule as well as the image.

A binary image is useful as input to connected-component labeling. There, pixel connectivity determines whether diagonally touching selected pixels belong to the same region. SciPy's labeling operation accepts zero as background and all nonzero values as foreground; an input with several nonzero intensities is consequently treated as a foreground mask by that particular API.^[ref]

Two possibilities require one bit of information per pixel in a direct packed representation. An actual array or image file can use more storage, or compression can exploit repeated patterns. Also distinguish a binary image from a label image containing several region identifiers: a label value of three need not mean brighter foreground than a label value of one.

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.

A gear pitting inspection mask specifies the tooth-flank region over which damage is counted. It separates eligibility for inspection from the classification of an eligible location as pitted. The denominator of a gear pitting area fraction depends on this mask, so a change in coverage can change the reported fraction even when the surface has not changed.

For a digital image, let $m_i\in \{0,1\}$ indicate inclusion of pixel $i$ and let $p_i\in \{0,1\}$ indicate its classification as pitted. With represented surface area $a_i$ per pixel,The arrays $m_i$ and $p_i$ are different indicator functions. Uniform pixel areas cancel, but an oblique view or a curved-surface map can require nonuniform $a_i$. A shadow, occlusion or unrecorded region should not automatically count as intact material.

An original example begins with 200 pitted pixels among 10000 eligible equal-area pixels, giving $2\%$. Cropping to a 5000-pixel region that retains 150 pitted pixels gives $3\%$. The counted damaged area fell while the fraction rose; this comparison alone cannot establish damage growth.

A gear inspection common-region comparison first uses image registration to put inspections into corresponding surface coordinates. On a common grid, the intersection mask is $m_i^{\mathrm{common}}=m_i^{(0)}{m}_i^{(1)}$. Comparing the two pitting classifications within that same region holds the denominator convention fixed. Coverage outside the intersection should still be reported: excluding a newly obscured damaged edge can hide relevant change.

Useful inspection records retain the raw image, mask, geometric mapping, image thresholding or other image segmentation rule, and the reason for excluded regions. A primary NASA gear-endurance study combined inspection history with vibration and oil-debris observations, illustrating why damage labels must remain connected to actual inspected surfaces.^[ref] The mask formalism above is an explicit measurement convention, not a claim that every historical inspection used this pixel algorithm.

ImageJ is a Java program for viewing, processing and measuring image data. Its official feature description includes image stacks, selections, calibrated measurements, image thresholding, plugins and recorded macros.^[ref] Wayne Rasband and Tiago Ferreira's user guide documents how acquisition metadata and analysis settings affect those measurements.^[ref]

For an original numerical measurement example, suppose a selected $2\times 2$ image region of interest contains gray values 10, 20, 30, 40. Set square pixel pitch to $0.25\mu \mathrm{m}$. The selection has four pixels, so its calibrated area and mean image signal areChanging only the spatial calibration to $0.50\mu \mathrm{m}$ per pixel changes the reported area to $1.00\mu {\mathrm{m}}^2$ while the mean remains 25. Spatial calibration changes the coordinate interpretation, not the stored gray values. An image thresholding rule retaining values at least 25 selects two pixels, whose total calibrated area under the original scale is $0.125\mu {\mathrm{m}}^2$.

A reproducible analysis records the original image, selection, spatial calibration, threshold rule and measurement settings. The guide separates spatial Set Scale from intensity Calibrate, and warns that global calibration can affect other open images.^[ref] The arithmetic above is stipulated test data, not a screenshot measurement or a result from an unspecified plugin.

An image lookup table maps a stored pixel value or index to a displayed color. For an 8-bit grayscale image with stored values $I_{ij}\in \{0,\dots ,255\}$, a table can be writtenusing an RGB color model triple. Changing $C$ changes the appearance without necessarily changing $I$. ImageJ explicitly distinguishes Invert LUT, which changes the display, from inversion of the pixel values.^[ref]

For an original example, store the rowThe identity grayscale table is $C(v)=(v,v,v)$; an inverted table is $C_{\mathrm{inv}}(v)=(255-v,255-v,255-v)$. The same four stored values appear in opposite brightness order under these tables, but their arithmetic mean remains $447/4=111.75$. An image thresholding rule selecting stored values above 100 still gives the binary selection mask $(0,0,1,1)$.

Numerically replacing the pixels by $255-I$ instead produces $(255,191,127,0)$. Its arithmetic mean is $573/4=143.25$, and the same strict threshold gives $(1,1,1,0)$. Thus an inverted-looking image does not by itself establish that its numerical values or selected subset were inverted.

The distinction is especially visible with binary selection masks: the documented Create Mask command stores 255 inside the selection and 0 outside, while an inverting lookup table can display the selected class as black.^[ref] Record the foreground-background polarity from the stored encoding and algorithm, rather than inferring it from screen brightness.

A program can also apply a lookup mapping to the data. ImageJ's Apply LUT command changes gray values and restores the identity table so that the displayed appearance is retained.^[ref] Distinguish that operation from assigning a display table. A table mapping several input values to the same color can conceal numerical distinctions in the display even while those distinctions remain in the original stored image.

Image thresholding classifies pixels by comparing their intensities with a threshold, often producing a binary image. A global threshold uses the same value throughout the image; adaptive thresholding permits the threshold to depend on position and nearby intensities.^[ref]

For example, defineIntensities $99,100,101$ then become $0,0,1$. The comparison at equality matters: a rule using $I\ge 100$ would instead give $0,1,1$. OpenCV's THRESH_BINARY uses the strict greater-than rule, assigning its chosen maximum output value only above the threshold.^[ref]

Threshold choice affects which distinctions survive. Two different bright intensities can become the same foreground value, while a small change near the boundary can change a pixel's classification. The resulting mask can then feed connected-component labeling, where pixel connectivity separately decides which selected pixels form a region.

A useful motivating experiment keeps one image of dark marks fixed while adding or recording a gradual illumination variation across the background. Compare a global threshold with a declared local-neighborhood rule, inspecting lost strokes and falsely selected background. OpenCV documents local mean and Gaussian-weighted rules with an offset; this addresses varying illumination rather than proving that every resulting region is a meaningful object.^[ref]

A histogram can guide global selection, but intensity statistics alone do not determine semantic identity. Noise and overlapping foreground/background intensities can make every threshold imperfect. Report the input representation, comparison convention and any filtering or local-window settings so that a thresholded result can be reproduced.

Wayne Rasband developed NIH Image and ImageJ, tools that make quantitative image processing available through an interactive program and extensible code. The ImageJ project's biography records forty years at the US National Institutes of Health and retirement in 2010. It dates the start of NIH Image to 1987 and ImageJ to 1997, when Rasband explored implementing the earlier program in Java.^[ref]

This progression mattered because the same recorded digital image could become input to many explicit measurements. Selecting a region of interest, applying image thresholding and measuring an area are separate operations; each makes a choice that affects the result. ImageJ User Guide by Tiago Ferreira and Wayne Rasband records the program's image representations, selections, analysis commands and scripting facilities.^[ref]

For a small original measurement example, take four stored grayscale valuesSelect values at least 128, obtaining the binary image $(0,0,1,1)$. If each complete pixel represents a rectangle of calibrated width $\Delta x=0.5\mu \mathrm{m}$ and height $\Delta y=0.5\mu \mathrm{m}$, the area from a calibrated pixel count isThe chosen threshold determines which pixels contribute; the pixel pitch determines the physical area assigned to each. An attractive display alone supplies neither of these measurement choices. The calculation assumes complete selected pixel cells and a uniform rectangular calibration; it is not a measured specimen area.

Rasband's contribution also includes maintaining a community around the software: the project profile describes improvements supplied through user feedback, bug reports, code and documentation. That process connects a general algorithm to the concrete representations and measurement conventions needed for a repeatable analysis.^[ref]