Abstract: Human body motion is represented by a skeletal model derived from image data of a user. The model represents joints and bones and has a rigid body portion. The sets of body data are scaled to a predetermined number of sets for a number of periodic units. A body-based coordinate 3-D reference system having a frame of reference defined with respect to a position within the rigid body portion of the skeletal model is generated. The body-based coordinate 3-D reference system is independent of the camera's field of view. The scaled data and representation of relative motion within an orthogonal body-based 3-D reference system decreases the data and simplifies the calculations for determining motion thus enhancing real-time performance for multimedia applications controlled by a user's natural movements.

Abstract: A dense guide image or signal is used to inform the reconstruction of a target image from a sparse set of target points. The guide image and the set of target points are assumed to be derived from a same real world subject or scene. Potential discontinuities (e.g., tears, edges, gaps, etc.) are first detected in the guide image. The potential discontinuities may be borders of Voronoi regions, perhaps computed using a distance in data space (e.g., color space). The discontinuities and sparse set of points are used to reconstruct the target image. Specifically, pixels of the target image may be interpolated smoothly between neighboring target points, but where neighboring target points are separated by a discontinuity, the interpolation may jump abruptly (e.g., by adjusting or influencing relaxation) at the discontinuity. The target points may be used to select only a subset of the discontinuities to be used during reconstruction.

Abstract: Human body motion is represented by a skeletal model derived from image data of a user. The model represents joints and bones and has a rigid body portion. The sets of body data are scaled to a predetermined number of sets for a number of periodic units. A body-based coordinate 3-D reference system having a frame of reference defined with respect to a position within the rigid body portion of the skeletal model is generated. The body-based coordinate 3-D reference system is independent of the camera's field of view. The scaled data and representation of relative motion within an orthogonal body-based 3-D reference system decreases the data and simplifies the calculations for determining motion thus enhancing real-time performance for multimedia applications controlled by a user's natural movements.

Abstract: Embodiments are described for a method to generate an image that includes image structure detail captured from a first image and color from a second image. The first image of a defined subject can be obtained from a computer memory. The first image may be a downsampled fine image with image detail. The second image captured of the defined subject in the first image can be obtained from a computer memory. The second image may be a coarse image. A target pixel in the second image can be selected. A target color distribution for a pixel window of the target pixel can then be computed. A source color distribution for a pixel window of a corresponding pixel in the first image can be computed using a computer processor. Further, a statistic of the target pixel can be determined with respect to the target color distribution. The source color in the source color distribution can be computed with the statistic. The target pixel color can then be replaced by the source color.

Abstract: Embodiments are described for a system and method for generating a multi-resolution image pyramid. The method can include obtaining an image captured as a coarse image of a defined subject and a fine image of the defined subject. The fine image can be downsampled to create a temporary image. A further operation is applying a structure transfer operation to the temporary image to transfer color detail from the coarse image. The structure transfer takes place while retaining structural detail from the temporary image. A blending operation can be applied between the temporary image and the fine image to construct an intermediate image for at least one intermediate level in the multi-resolution image pyramid between the fine image and the coarse image.

Abstract: A “Variable-Rate Perfect Hasher” maps sparse variable-rate data of one or more dimensions into a hash table using a perfect hash function. In various embodiments, perfect hash tables are populated by first computing offset table address for each data point of a domain of sparse variable-rate data elements. Offset vectors are then computed for each offset table address based in part on the size of each data element by evaluating offset vectors in order of a sum of the data point addresses mapping to each offset vector. These offset vectors are then stored in the offset table. For each data point, the corresponding offset vector is then used to compute a hash table address. Data elements are then perfectly hashed into the hash table using the computed hash table addresses. The resulting hash tables support efficient random access of the variable-sized data elements stored therein.

Abstract: A “Vector Graphics Encoder” encodes vector graphics in a randomly accessible format. This encoding format enables particular portions of encoded images to be directly accessed, at any desired level of zoom, without processing or otherwise decoding the entire image. This random-access format is based on a coarse image grid of partially overlapping cells wherein each cell is defined by a “texel program.” Unlike fixed-complexity cells used by conventional vector images, each cell defined by a texel program is locally specialized without requiring global constraints on the complexity of each cell. The texel program for each cell is provided as a variable-length string of tokens representing a locally specialized description of one or more of layers of graphics primitives overlapping the cell. Images are then rendered by interpreting the texel programs defining one or more cells.

Abstract: A saltating sample image enhancement system and method that provides an image processing operation in which a filter considers one or one or more exact source image pixels; one or more bilinearly interpolated source image samples, where the bilinear weights are coupled to the position of the target pixel relative to the source pixels; and (optionally) one or more linearly interpolated source image samples, where the linear weights are coupled to the position of the target pixel relative to the source pixels. The filter can construct a spatially continuous image statistic.

Abstract: A technique for generating high-resolution bitmaps from low-resolution bitmaps. A low-resolution bitmap is magnified to form a magnified image. Edge detection is performed on the magnified image to find high contrast edges. A plurality of image patches of the magnified image are generated. These images patches are analyzed by performing connected components analysis on each of them using the high contrast edges to produce a plurality of foreground and background decisions determining whether a portion of an image patch is a background or a foreground region. Then the contrast of one or more pixels in each of the plurality of image patches is enhanced based on the foreground and background decisions. Finally, the system and method of the invention combines the luminance of the enhanced output pixels with the color values generated by the magnification algorithm. This produces a high-resolution bitmap from the contrast-enhanced pixels.

Abstract: A “Vector Graphics Encoder” encodes vector graphics in a randomly accessible format. This encoding format enables particular portions of encoded images to be directly accessed, at any desired level of zoom, without processing or otherwise decoding the entire image. This random-access format is based on a coarse image grid of partially overlapping cells wherein each cell is defined by a “texel program.” Unlike fixed-complexity cells used by conventional vector images, each cell defined by a texel program is locally specialized without requiring global constraints on the complexity of each cell. The texel program for each cell is provided as a variable-length string of tokens representing a locally specialized description of one or more of layers of graphics primitives overlapping the cell. Images are then rendered by interpreting the texel programs defining one or more cells.

Abstract: A system and method for improving digital flash photographs. The present invention is a technique that significantly improves low-light imaging by giving the end-user all the advantages of flash photography without producing the jarring look. The invention uses an image pair—one taken with flash the other without—to remove noise from the ambient image, sharpen the ambient image using detail from the flash image, correct for color, and remove red-eye.

Abstract: Techniques and tools for mesh processing are described. For example, a multi-chart geometry image represents arbitrary surfaces on object models. The multi-chart geometry image is created by resampling a surface onto a regular 2D grid, using a flexible atlas construction to map the surface piecewise onto charts of arbitrary shape. This added flexibility reduces parameterization distortion and thus provides greater geometric fidelity, particularly for shapes with long extremities, high genus, or disconnected components. As another example, zippering creates a watertight surface on reconstructed triangle meshes. The zippering unifies discrete paths of samples along chart boundaries to form the watertight mesh.

Abstract: Systems and methods for discontinuity edge overdraw are described. In one aspect, a polygonal mesh is rendered to produce a computer-generated image. The image exhibits aliasing at its discontinuity edges. The discontinuity edges are sorted prior to overdrawing. The discontinuity edges are overdrawn as anti-aliased lines to reduce the aliasing.

Abstract: A “Variable-Rate Perfect Hasher” maps sparse variable-rate data of one or more dimensions into a hash table using a perfect hash function. In various embodiments, perfect hash tables are populated by first computing offset table address for each data point of a domain of sparse variable-rate data elements. Offset vectors are then computed for each offset table address based in part on the size of each data element by evaluating offset vectors in order of a sum of the data point addresses mapping to each offset vector. These offset vectors are then stored in the offset table. For each data point, the corresponding offset vector is then used to compute a hash table address. Data elements are then perfectly hashed into the hash table using the computed hash table addresses. The resulting hash tables support efficient random access of the variable-sized data elements stored therein.

Abstract: A multidimensional hash table is created based on a data source having sparse multidimensional data. The sparse source data is mapped into the hash table using a hash function. The hash function can be defined by accessing multidimensional values in an offset table. The offset values in the offset table can be precomputed from the static source data so as to avoid hash collisions, thus creating a perfect hash function. Additionally, the perfect hash function is designed to preserve spatial coherence of accesses, so as to improve locality of memory reference.

Abstract: A saltating sample image enhancement system and method that provides an image processing operation in which a filter considers one or one or more exact source image pixels; one or more bilinearly interpolated source image samples, where the bilinear weights are coupled to the position of the target pixel relative to the source pixels; and (optionally) one or more linearly interpolated source image samples, where the linear weights are coupled to the position of the target pixel relative to the source pixels. The filter can construct a spatially continuous image statistic.

Abstract: A method and system for synthesizing texture using upsampled pixel coordinates and a multi-resolution approach. The parallel texture synthesis technique, while based on a neighborhood matching technique having order-independent texture synthesis, extends that approach in at least two areas, including efficient parallel synthesis and intuitive user control. Pixel coordinates are upsampled instead of pixel colors, thereby reducing computational complexity and expense. These upsampled pixel coordinates then are jittered to provide texture variation. The jitter is controllable, such that a user has control over several aspects of the jitter. In addition, each neighborhood-matching pass is split into several sub-passes to improve correction. Using sub-passes improves correction speed and quality. The parallel texture synthesis system and method disclosed herein is designed for implementation on a parallel processor, such as a graphics processing unit.

Abstract: A multi-level image data structure (called a multi-level image stack) containing a single image at each level and a method for generating the same. Images at each level contain the same number of pixels. The multi-level image stack defines a set of levels emanating from an original image having a number of pixels. Each successive level of the multi-level image stack contains a single image. Each single image contains the same number of pixels as the original image. Successive levels encode progressively filtered information of the original image, but without subsampling. This retains the fine-scale resolution of the original image. A variety of filter techniques can be used, including a Gaussian filter and a box filter. The multi-level image stack is particularly well-suited for use in texture synthesis applications, where its fine-scale resolution at all levels has the advantage of reducing artifacts and spatial quantization.

Abstract: A method and system for synthesizing texture using a preprocessed exemplar image and a neighborhood-matching per-pixel texture synthesis correction technique. The sub-pass correction system and method alters pixel coordinates to recreate neighborhoods similar to those in the exemplar image. In the context of parallel texture synthesis, instead of synthesizing all pixels of an image simultaneously, the sub-pass correction system and method allows neighbors to be corrected in different sub-passes. Each pixel, therefore, benefits from the correction of some of its neighbors in previous sub-passes. This reduces the required number of global correction passes to obtain good synthesis results Generally, one or more correction passes are performed, with each correction pass divided into a plurality of correction sub-passes. A number of pixel coordinates are corrected in parallel during each of the correction sub-passes.

Abstract: An indirection texture magnification system and method for producing high-resolution indirection texture results. The system and method uses an indirection texture, designed for use with a low-resolution texture image, and a high-resolution texture image, which is a higher-resolution version of the low-resolution texture image. The indirection texture magnification system and method re-interprets an indirection texture computed for a low-resolution image so that a higher-resolution image can be used with the same indirection texture. This generates additional samples and allows the generation of a magnified, high-resolution indirection texture result. The indirection texture magnification system and method takes three or more neighboring pixel coordinates stored in an indirection texture and offsets those pixel coordinates in order to access the higher-resolution image with an increased precision.