Threshold Topologies and Separation Polynomials of Digital Images

A digital image is modelled as a finite metric space by equipping its pixel set with a colour distance induced by a norm on \( R^3 \). For a threshold \( δ \), we study the threshold topology \( T_δ \), generated by \( δ \)-chain connectedness, and the separation polynomial \( C_Ψ(z;δ) \), which enumerates \( δ \)-separated pixel sets. We prove that each T_δ is a partition topology and classify these spaces up to homeomorphism by component cardinalities. The filtration \( T_δ \) is shown to be equivalent to the maximal subdominant pseudo-ultrametric of the colour metric, with \( δ \)-components precisely its closed balls. Its change points coincide with the distinct nonzero weights of a minimum spanning tree. We establish a sharp Lipschitz stability estimate and derive filtration interleavings under uniform colour perturbations, together with exact invariance under suitable margin conditions. Algebraically, \( C_Ψ(z;δ) \) is identified with the independence polynomial of the similarity graph and the face enumerator of its independence complex. A packing bound yields an efficient computation method. Finally, explicit greyscale examples establish the logical independence of the topological and algebraic invariants. The framework is illustrated on a \( 4×4 \) digital image through exact computations of filtrations, entropy, separation polynomials, and Euler characteristics.