Hyperstring Construction of Sub-Pixel Detectors

A mathematical methodology is described that aims to find closed-form approximate solutions to a generalized class of sub-pixel hyperspectral detection problems. Algorithms represented as high-dimensional surfaces are approximated by assembling hyperstrings of one-fewer dimension. The procedure is completed by adjoining to the hyperstring construct clairvoyant detector surfaces corresponding to limiting values of the sub-pixel mixing fraction.