Abstract: A super-resolution image is generated from a pixel image by first performing an initial image interpolation, creating an interpolated low resolution image. The interpolated low resolution image is then partitioned into overlapping low resolution patches. The low resolution patches are then processed in a raster scan order. For each low-resolution patch, a scaled mid band patch is generated. A search vector is constructed from pixels in the scaled mid band input patch, and pixels in an overlap region of adjacent previously predicted high band patches. A nearest index vector to the search vector is located in a training database, the nearest index vector has an associated high band output patch. The high band output patch is then combined with the interpolated low resolution patch to predict pixel values for the corresponding high resolution patch of the super-resolution image.

Abstract: A method, using a filter function, generates an anti-aliased discrete image from a continuous image including an edge. The method defines a line sample. A progressive convolution is derived from the filter function and the line sample. A pixel at a predetermined location in the discrete image is selected, and the line sample is oriented with respect to the selected pixel. A distance is measured from a point in the continuous image corresponding to the selected pixel to the edge along the oriented the line sample. The progressive convolution is evaluated at the measured distance to produce a weighted coverage value, and the weighted coverage value is associated with the pixel to anti-alias the pixel in the discrete image.

Abstract: A method sculpts an object expressed as a model. A hierarchical distance field is generated from the model according to generation parameters. The hierarchical distance field is edited according to editing parameters, and the hierarchical distance field is rendered while editing. To generate the hierarchical distance field, the object distance field is enclosed with an object bounding box. The enclosed object distance field is partitioned into a plurality of cells. Each cell has a size corresponding to detail of the object distance field and a location with respect to the object bounding box. A set of values of the enclosed object distance field is sampled for each cell. A method for reconstructing the portion of the distance field enclosed by the cell is specified for each cell.

Abstract: A method memoizes a computation as follows. A set of input parameters is provided to the computation. A determination is made to see whether a memo contains results of the computation on sets of memoized parameters near the set of input parameters. If true, the computation for the set of input parameters is reconstructed using the results of the computations on the sets of memoized parameters near the set of input parameters. If false, the computation is performed using the set of input parameters. A result of the computation on the set of input parameters is then memoized, and that result is provided as output of the computation.

Abstract: An image processing system enables the manipulation of individual anonymous laser pointers in interactive visual games. The system includes a display system that displays an image on a display screen. A camera acquires a sequence of images of the display screen. Participants in the game aim individual laser pointers at the screen; the laser pointers form dots on the display screen. A warp module corrects the acquired images for distortion. A registration module registers the corrected sequence of images with the displayed image, and modifies the displayed image in response to a distribution of the laser dots on the display screen.

Abstract: A super-resolution image is generated from a pixel image by first performing an initial image interpolation, creating an interpolated low resolution image. The interpolated low resolution image is then partitioned into overlapping low resolution patches. The low resolution patches are then processed in a raster scan order. For each low-resolution patch, a scaled mid band patch is generated. A search vector is constructed from pixels in the scaled mid band input patch, and pixels in an overlap region of adjacent previously predicted high band patches. A nearest index vector to the search vector is located in a training database, the nearest index vector has an associated high band output patch. The high band output patch is then combined with the interpolated low resolution patch to predict pixel values for the corresponding high resolution patch of the super-resolution image.

Abstract: The invention provides a method for representing a device color gamut as a detail directed hierarchical distance field. A distance field representing the device color gamut is enclosed with a bounding box. The enclosed distance field is partitioned into a plurality of cells. Each cell has a size corresponding to detail of the continuous distance field and a location with respect to the bounding box. A set of values of the enclosed distance field is sampled for each cell. A method for reconstructing the portion of the distance field enclosed by the cell is specified. The size, the location, the set of values, and the method for reconstructing is stored in a memory to enable reconstruction of the device color gamut by applying the reconstruction methods of the cells to the values.

Abstract: A method generates a detail directed hierarchical representation of a distance field that is enclosed by a bounding box. The method begins by partitioning the bounding box enclosing the distance field into cells. Each cell has a size corresponding to detail of the distance field and a location with respect to the bounding box. Next, the distance field is sampled to obtain a set of values of the distance field for each cell. A method for reconstructing the portion of the distance field enclosed by the cell is specified for each cell. The location and size, the set of values, and the method for reconstructing for each cell are stored in a memory to enable reconstruction of the distance field by applying the reconstruction methods of the cells to the values.

Abstract: In a method for rendering an evolving three-dimensional scene description as a series of two-dimensional images (frames), the evolving scene description includes object geometries G and their associated shader procedures S. Each shader procedure S is factored into a static procedure Ss and a dynamic procedure Sd such that S(A,I)=Sd(Ss(A,R),I), where A denotes the appearance parameters required to shade objects, I denotes an instance of the control parameters, and R denotes a range of control parameters which include I. Similarly, the rendering procedure TSI (transform, sample, and interpolate) for object geometry is factored into a static procedure TSIs and a dynamic procedure TSId such that TSI(G,I)=TSId(TSIs(G,R),I). The factorization of both S and TSI is chosen to significantly reduce the overall rendering time for the evolving scene.