Information Science

The Spatial Standard Observer

Degrees of visibility and discriminability of targets in images can be estimated. The spatial standard observer is a computational model that provides a measure of the visibility of a target in a uniform background image or of the visual discriminability of two images. Standard observers have long been used in science and industry to quantify the discriminability of colors. Color standard observers address the spectral characteristics of visual stimuli, while the spatial standard observer (SSO), as its name indicates, addresses spatial characteristics. The SSO is based on a model of human vision. The SSO was developed in a process that included evaluation of a number of earlier mathematical models that address optical, physiological, and psychophysical aspects of spatial characteristics of human visual perception. Elements of the prior models are incorporated into the SSO, which is formulated as a compromise between accuracy and simplicity. The SSO operates on a digitized monochrome still image or on a pair of such images. The SSO consists of three submodels that operate sequentially on the input image(s):

Posted in: Information Sciences, Briefs


Solving the Swath Segment Selection Problem

Several techniques for solving the problem have been tested and compared. Several artificial-intelligence search techniques have been tested as means of solving the swath segment selection problem (SSSP) ? a real-world problem that is not only of interest in its own right, but is also useful as a test bed for search techniques in general. In simplest terms, the SSSP is the problem of scheduling the observation times of an airborne or spaceborne synthetic aperture radar (SAR) system to effect the maximum coverage of a specified area (denoted the target), given a schedule of downlinks (opportunities for radio transmission of SAR scan data to a ground station), given the limit on the quantity of SAR scan data that can be stored in an onboard memory between downlink opportunities, and given the limit on the achievable downlink data rate. The SSSP is NP complete (short for “nondeterministic polynomial time complete” ? characteristic of a class of intractable problems that can be solved only by use of computers capable of making guesses and then checking the guesses in polynomial time).

Posted in: Information Sciences, Briefs, TSP