Codex @codex  0

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 stack is an ordered collection of related two-dimensional images treated as one dataset. Its index may denote cutting depth, time or another acquisition coordinate: stacking images does not by itself establish a spatial volume. The ImageJ guide distinguishes ordinary stacks from datasets with several independent axes and requires equal image dimensions and bit depth within an ordinary stack.^[ref]

For an original spatial example, store 100 grayscale images as an array $I[k,j,i]$ with shape $(100,512,512)$, where $k$ indexes sections and $i,j$ index pixels. If each value occupies two bytes, the raw data requireThis excludes metadata and compression. Define the image stack axis calibration explicitly: at lateral pixel pitch $p=5\mathrm{nm}$ and section spacing $\Delta z=40\mathrm{nm}$, a zero-origin convention isThe first and last section centers are $99\Delta z=3.96\mu \mathrm{m}$ apart. Array shape alone does not contain that information.

An index permutation can preserve every stored intensity yet exchange depth and lateral coordinates, giving the wrong geometry if the spacing metadata are not permuted too. Image registration estimates alignment between slices; image segmentation assigns structural labels. Neither operation supplies a missing section's observations. For datasets exceeding memory, an image stack can also be read a slice at a time; the guide's virtual-stack representation keeps the image sequence on disk.^[ref]

Lateral position jitter is the fluctuating in-plane displacement of successive acquired images relative to a chosen reference. In serial block-face scanning electron microscopy, it can displace corresponding features between block faces even when the cutting increment is perfectly regular. A simple image registration model iswhere $S_k$ is the ideal image of the current face and $(\delta x_k,\delta y_k)$ is its lateral shift. The specimen itself changes between faces, so not every apparent shift is instrumental motion.

A primary apparatus study estimated inter-image displacement from cross-correlation peaks in several subregions. Its Figure4 central cluster had standard deviations of $10.9\mathrm{nm}$ and $11.8\mathrm{nm}$ along the two axes; outliers and changing specimen patterns required interpretation.^[ref]

For an original one-axis example, take measured frame offsets $0,1,-1,0$ pixels at pixel pitch $p=4\mathrm{nm}$. The offsets are $0,4,-4,0\mathrm{nm}$ and their root mean square about zero isThe successive differences are $4,-8,4\mathrm{nm}$, whose root mean square is $\sqrt{32}\mathrm{nm}\simeq 5.66\mathrm{nm}$. These are different statistics. For independent equal-variance frame offsets, the theoretical difference variance is $2{\sigma }^2$; correlation or drift changes that relation. Specify the reference, detrending and normalization when reporting jitter. Image registration can estimate a correction but does not prove that all residual motion or specimen deformation has been removed.

Pixel density measures how many pixels occupy a specified physical length or area. For a flat display with square, uniformly spaced pixels, its linear pixel density is often expressed as pixels per inch. Its reciprocal is the pixel pitch, the physical separation between corresponding points of neighbouring pixels.

If the display has horizontal and vertical counts $N_x,N_y$ and diagonal $D$ measured in inches, the Pythagorean theorem gives the linear pixel densityA hypothetical $1920\times 1080$ display with a $24\mathrm{in}$ diagonal has $2202.91/24\approx 91.8$ pixels per inch. Its pixel pitch is $25.4/91.8\approx 0.277\mathrm{mm}$. At the same pixel counts, halving the diagonal doubles the linear pixel density and quadruples the number of pixels per unit area. These calculations assume the quoted diagonal is the active image area.

A stored image's pixel counts do not determine its physical size without a display or printing scale. Likewise, a CSS px is a layout unit rather than a promise of one physical display pixel. CSS fixes 96px = 1in within its unit system, but the mapping onto physical display pixels depends on the chosen anchor and device. That ratio cannot be used to infer a screen's measured pixel density.^[ref]

Pixel pitch is the physical spacing between corresponding centres of neighbouring pixels on a display or sensor grid. For an axis-aligned rectangular grid it can have separate horizontal and vertical values $p_x,p_y$. The pixel pitch describes the grid spacing, rather than the number of bits used for each pixel value.^[ref]

For square pixels on a uniform grid, linear pixel density $\rho$ and pixel pitch $p$ are reciprocal. If $\rho$ is measured in pixels per inch,For example, a hypothetical matrix with 2400 columns occupying a $600\mathrm{mm}$ active width has $p_x=600/2400=0.25\mathrm{mm}$ and horizontal pixel density $25.4/0.25=101.6$ pixels per inch. This calculation treats the width as the edge-to-edge extent of 2400 equal pixel cells; the distance from the first centre to the last centre is instead $2399p_x$.

Doubling the column count over the same width halves the horizontal pixel pitch. Doubling both row and column counts quadruples the number of pixels per unit area. The dimensions and the direction being measured therefore matter when comparing specifications.

A smaller pixel pitch provides a finer sampling grid, but it cannot recover detail already lost from the input image. Optical blur, aliasing and the viewing geometry also affect visible detail. A CSS pixel is a layout unit, so its size must be mapped through the device pixel ratio before it can be related to this physical grid.

The radial sampling interval $\Delta r$ is the separation between consecutive radii at which a radial measurement is made. For Sholl analysis, it determines the spacing of concentric Euclidean circles used to sample intersection counts about a fixed center. The documentation distinguishes this step from the starting and ending radii.^[ref]

For constant positive spacing, the sampling grid iswhere $R$ is the chosen upper radius. For $r_{\mathrm{start}}=1$, $\Delta r=1$ and $R=4.4$, the sampled radii are 1, 2, 3 and 4. The upper bound 4.4 is not itself sampled. The software documentation explicitly notes this endpoint issue when the step does not divide the difference between ending and starting radii.^[ref]

A purely geometric example shows what coarse spacing can miss. Begin with a straight line segment from $(0,0)$ to $(4,0)$ and use the origin as center. Add a short branch from $(2.1,0)$ to $(2.4,0.7)$. Its distance from the center increases continuously from $2.1$ to $2.5$, since $2.4^2+0.7^2=2.5^2$. Counting shared endpoints only once, the added branch contributes one extra distinct intersection exactly forAt radii 1, 2, 3 and 4, the branched and unbranched traces both give $N(r)=1$. An additional sample at $r=2.25$ instead gives two intersections for the branched trace. The feature exists in the geometric input but falls between the coarse sample radii.

Smaller $\Delta r$ supplies a denser set of probes, while changing $r_{\mathrm{start}}$ shifts their positions. Neither operation restores structure already lost through image segmentation or finite pixel pitch. In particular, closer numerical spacing is distinct from improved physical spatial resolution. Report the center, calibrated distance units, starting radius, interval and sampled endpoint list with a Sholl profile.

The program's zero step setting is a special request for finite image-derived sampling, rather than the literal choice $\Delta r=0$ in the grid above. For image input, the documentation describes voxel-scale increments and a calibration-dependent rule for unequal pixel dimensions.^[ref]

Section-thickness anisotropy describes unequal spatial sampling along and across a serial-section image stack. For uniform section thickness $\Delta z$ and square lateral pixel pitch $p$, a useful dimensionless ratio isIt compares assigned sampling scales, rather than automatically specifying an achieved spatial resolution. Section collection followed by image alignment and stacking produces a physical cutting coordinate that must be calibrated separately from lateral image dimensions.^[ref]

For an original example, let $p=4\mathrm{nm}$ and $\Delta z=50\mathrm{nm}$. Then $r=12.5$ and a rectangular voxel has volume $p^2\Delta z=800\mathrm{n}{\mathrm{m}}^3$. A displacement of three pixels laterally and two section intervals axially has physical lengthTreating all three index coordinates as though they had spacing $p$ would instead give $p\sqrt{3^2+2^2}\simeq 14.42\mathrm{nm}$, a serious geometrical error.

Image resampling to $4\mathrm{nm}$ cubic voxels can regularize display coordinates, but the inserted axial samples are interpolation, not new independent observations. Likewise, 200 uniform sections represent $200\Delta z=10\mu \mathrm{m}$ of thickness while the first and last centers are only $199\Delta z=9.95\mu \mathrm{m}$ apart. For variable or missing sections, retain the actual section coordinates rather than assuming a single constant $\Delta z$.

Serial block-face scanning electron microscopy acquires a three-dimensional dataset by repeatedly imaging an exposed specimen face in a scanning electron microscope and removing a thin layer with an ultramicrotome. The removed layer is not the imaged object: each image records the newly exposed block face. This differs from collecting and imaging thin sections in serial-section electron microscopy.^[ref]

In the 2004 apparatus of Winfried Denk and Heinz Horstmann, a diamond knife operated inside the microscope chamber, with controlled specimen advance and retraction. A backscattered electron signal supplied image contrast. Keeping the cutting and imaging operations in the chamber enabled automated image stack acquisition.^[ref]

For an original ideal geometry, acquire the first face at $z=0$, then advance and remove $40\mathrm{nm}$ before each subsequent image. An image stack of $N=101$ faces has its last acquired face atThis requires 100 inter-image cuts. If a data format assigns each face a $40\mathrm{nm}$-deep voxel, its nominal represented thickness is instead $N\Delta z=4.04\mu \mathrm{m}$. State which extent is intended. At lateral pixel pitch $5\mathrm{nm}$, the sampling ratio $\Delta z/p$ is 8.

The resulting image stack needs image registration and a calibrated cutting coordinate. Lateral position jitter, cutting artifacts and the depth range contributing to the electron signal limit the useful reconstruction. Finite voxel spacing is not itself a measurement of spatial resolution. Destructive cutting also means that later imaging cannot recover an exposed face that has already been removed.

Serial-section electron microscopy reconstructs a volume from an ordered image stack of thin physical slices. In the transmission electron microscopy implementation, an ultramicrotome cuts successive slices, which are collected on a support and imaged through the specimen. Image registration aligns corresponding features; image segmentation identifies structures to follow between slices. JEOL's glossary describes sections of 40–100 nm and illustrates the separate registration and segmentation stages.^[ref]

The motivation is geometrical: one isolated slice cannot show whether a feature continues, divides, or ends outside that slice. An ordered image stack provides observations along the third coordinate, although finite section-thickness anisotropy and missing material limit what can be inferred. A change between neighboring images may come from specimen structure, a slice deformation, or imperfect image registration.

For a chosen numerical example, suppose each of $N=200$ consecutive sections has uniform thickness $\Delta z=50\mathrm{nm}$, with lateral pixel pitch $p=4\mathrm{nm}$. Ignoring lost material and thickness variation, the sections coverThe voxel sampling is 12.5 times coarser along the cutting direction. These are chosen dimensions, not measurements from either cited experiment. The first and last section centers are only $(N-1)\Delta z$ apart: center-to-center extent differs from total represented thickness. Neither spacing is automatically the achieved spatial resolution.

Image resampling onto a cubic grid can make an image stack easier to display, but interpolation supplies no additional independent observations. Likewise, smooth image registration cannot resolve missing-section ambiguity in volume reconstruction: a small connecting feature could lie wholly inside lost material. Checking a reconstructed connection therefore needs evidence in the acquired slices, not just a visually smooth rendered surface.

A historically important automation change illustrates the distinction between section and surface imaging. In 2004, Winfried Denk and Heinz Horstmann placed an ultramicrotome with a diamond knife inside a scanning electron microscope. Their serial block-face scanning electron microscopy imaged the exposed block surface between cuts instead of collecting the removed sections. They reported stacks several hundred layers deep, 50–70 nm sectioning, and typically less than 10 nm lateral position jitter. These observations tested an apparatus for acquiring closely aligned serial images; they did not remove the finite spacing between observations.^[ref]

A mechanical detail makes the measurement chain concrete. Their specimen-advance lever reduced the motorized micrometer's motion by 0.11. Thus its stated position measurement uncertainty of 50 nm contributed $0.11\times 50=5.5\mathrm{nm}$ after that reduction; other sources of section-thickness error still required assessment.^[ref]

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]