Abstract: A method and apparatus determine an antialiased intensity of a component of a pixel. A set of objects is represented by a set of two-dimensional distance fields. For each distance field, a corresponding set of sample points is associated with the component and a corresponding distance is determined using the corresponding set of sample points. The corresponding distances are combined to determine a combined distance that is mapped to the antialiased intensity of the component of the pixel.

Abstract: An approach for incrementally updating graphical images when using anti-aliasing techniques is disclosed. Data for an original color is stored, and an image is filtered based on the original color. A new color for an image portion less than the entire image is identified. The new color is used with the old color to re-filter the image portion. The re-filtering may be performed by a two-step approach in which the image portion is filtered using the negative of the original color and then the image portion is filtered using the new color. The re-filtering may be performed by a one-step approach in which the portion of the image is filtered using the difference between the new color and the old color. The appearance of a halo around the portion of the image that would otherwise occur when filtering based on only the new color is thereby avoided.

Abstract: A method generates a synthetic textured data signal by first acquiring a time-invariant input textured data signal. The input textured data signal is sampled to construct an observation matrix. The observation matrix is eigen-coding and factoring to identify a linear dynamic system modeling the input textured data signal. Then, the linear dynamic system can be run forward from an initial state using a quadratic regulator and a random noise signal to generate the synthetic textured data signal.

Abstract: A dither matrix generator defines a three-dimensional array of pixels referred to as the “cluster array” in which each pixel is designated based on its value as a “cluster pixel” or a “void pixel”. The dither matrix generator also defines a three-dimensional array referred to as the “dither matrix,” and assigns rank values to the dither matrix in two stages. In the first stage, the dither matrix generator identifies the largest cluster in the cluster array, identifies a cluster pixel located in the largest cluster, assigns a rank value to the element in the dither matrix corresponding to the cluster pixel and removes the cluster pixel from the cluster array. The process is repeated until the cluster array contains no cluster pixels.