Abstract: In some examples, a computing device can determine synthetic meshes based on source meshes of a source mesh sequence and target meshes of a target mesh sequence. The computing device can then place the respective synthetic meshes based at least in part on a rigid transformation to define a processor-generated character. For example, the computing device can determine subsets of the mesh sequences based on a similarity criterion. The computing device can determine modified first and second meshes having a connectivity corresponding to a reference mesh. The computing device can then determine the synthetic meshes based on the modified first and second meshes. In some examples, the computing device can project source and target textures onto the synthetic mesh to provide projected source and target textures. The computing device can determine a synthetic texture registered to the synthetic mesh based on the projected source and target textures.

Abstract: In some examples, a computing device can determine synthetic meshes based on source meshes of a source mesh sequence and target meshes of a target mesh sequence. The computing device can then place the respective synthetic meshes based at least in part on a rigid transformation to define a processor-generated character. For example, the computing device can determine subsets of the mesh sequences based on a similarity criterion. The computing device can determine modified first and second meshes having a connectivity corresponding to a reference mesh. The computing device can then determine the synthetic meshes based on the modified first and second meshes. In some examples, the computing device can project source and target textures onto the synthetic mesh to provide projected source and target textures. The computing device can determine a synthetic texture registered to the synthetic mesh based on the projected source and target textures.

Abstract: This patent relates to thin plate spline (TPS)-based interpolation techniques for representing free-flowing vector graphics (VG) images based on user-specified features, such as points and curves. One or more features can be identified in a pixel grid. A higher-order least squares interpolating function with a TPS smoothness objective can then be utilized to interpolate individual color values to individual pixels of the pixel grid. Smoothness terms of the function that impose smoothness penalties can be interrupted in certain regions of the pixel grid based on attributes of the user-specified features. For example, a curve attribute can specify a particular color value(s), add or remove a smoothness penalty, or anisotropically impose a first derivative constraint in a particular direction.

Abstract: This patent relates to thin plate spline (TPS)-based interpolation techniques for representing free-flowing vector graphics (VG) images based on user-specified features, such as points and curves. One or more features can be identified in a pixel grid. A higher-order least squares interpolating function with a TPS smoothness objective can then be utilized to interpolate individual color values to individual pixels of the pixel grid. Smoothness terms of the function that impose smoothness penalties can be interrupted in certain regions of the pixel grid based on attributes of the user-specified features. For example, a curve attribute can specify a particular color value(s), add or remove a smoothness penalty, or anisotropically impose a first derivative constraint in a particular direction.

Abstract: Systems and/or methods that factor large-scale repeated content within and/or among images can include devices and components that factor received or acquired images into epitomes that include all the content of the received or acquired images and transform maps that encode how to construct a facsimile or a close approximation of the image by selecting transformed regions from the epitomes. Through use of both the epitomes and the transform maps in conjunction, a facsimile or a close approximation of the input image can be reconstructed and displayed.

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 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: A dimensionality-reduced appearance space system and method that transforms an exemplar image from a traditional three-dimensional space of pixel colors to a low-dimensional Euclidean space of appearance vectors. The transformation of an exemplar is a preprocessing step, and the transformed exemplar becomes the starting point for high-quality texture synthesis. The exemplar transformation begins by computing a high-dimensional appearance vector using one or a combination of several attribute channels. These attribute channels provide additional information to further distinguish exemplar pixels from each other. These attribute channels includes spatial pixel neighborhoods, feature distance, and radiance transfer information. Dimensionality reduction is applied to the resulting high-dimensional appearance vector to generate the transformed exemplar in low-dimensional Euclidean appearance space.

Abstract: An anisometric texture synthesis system and method for generating anisometric textures having a similar visual appearance as a given exemplar, but with varying orientation and scale. This variation is achieved by modifying the upsampling and correaction processes of the texture synthesis technique using a Jacobian field. The modified correaction process includes accessing only immediate neighbors of a pixel instead of non-local pixels. This constraint that only immediate neighbors be used also allows the generation of seamless anisometric surface textures. This is achieved by using indireaction maps containing indirection pointers that are used to jump from a set of pixels outside the boundary of a texture atlas chart to another chart. The system and method also includes an anisometric synthesis magnification technique that uses a Jacobian field to modify the magnification step of a synthesis magnification scheme and account for anisometry.

Abstract: An adaptive texture regeneration method and system for generating a sequence of images over time (an animation sequence) that gives the appearance of texture flowing over a surface. The adaptive texture regeneration method and system helps keep synthesized texture flow over a surface from becoming so distorted such that it no longer resembles the original exemplar. This is achieved in part by using pixel coordinates instead of colors. By using pixel coordinates, distortion of the texture can be measured. Based on this distortion measurement, the texture can be adaptively regenerated if necessary. The distortion measurement of the texture is measured and compared to a distortion threshold. If the measured distortion does not exceed the threshold, then the current synthesized texture is retained. On the other hand, if the measured distortion exceeds the threshold, the current synthesized texture is regenerated.

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: 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: The claimed subject matter provides systems and/or methods that factor large-scale repeated content within and/or among images. The system can include devices and components that factor received or acquired images into epitomes that include all the content of the received or acquired images and transform maps that encode how to construct a facsimile or a close approximation of the image by selecting transformed regions from the epitomes. Though use of both the epitomes and the transform maps in conjunction, a facsimile or a close approximation of the input image can be reconstructed and displayed.

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 regional progressive mesh provides support for real-time rendering of large-scale surfaces with locally adapting surface geometric complexity according to changing view parameters. The regional progressive mesh is constructed by subdividing an initial detailed mesh one or more times into multiple sub-regions as an iterative or recursive process. Each sub-region is separately simplified, and the localized transformations recorded in separate segments in a sequence of mesh refinement transformations that form the progressive mesh representation. The resulting regionalized organization of mesh refinement transformations reduces the working set of memory pages containing progressive mesh data needed for real-time view-dependent adaptation and rendering of the mesh surface.

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: Plural levels of detail of a terrain are stored in memory in regular grids. In one such example, a terrain is cached in a set of nested regular grids obtained from the plural levels as a function of distance from a viewpoint. In one such example, the plural levels of detail of terrain comprise terrain elevation and texture images. If the viewpoint moves relative to the terrain, the nested regular grids are incrementally refilled relative to the viewpoints movement in the terrain. In one such example, a transition region is introduced to help blend between grid levels. The regular grids are stored as vertex buffers in video memory in one example. In one such example, a vertex data includes an elevation values from another grid level for efficient grid level boundary blending.

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.

Abstract: An adaptive texture regeneration method and system for generating a sequence of images over time (an animation sequence) that gives the appearance of texture flowing over a surface. The adaptive texture regeneration method and system helps keep synthesized texture flow over a surface from becoming so distorted such that it no longer resembles the original exemplar. This is achieved in part by using pixel coordinates instead of colors. By using pixel coordinates, distortion of the texture can be measured. Based on this distortion measurement, the texture can be adaptively regenerated if necessary. The distortion measurement of the texture is measured and compared to a distortion threshold. If the measured distortion does not exceed the threshold, then the current synthesized texture is retained. On the other hand, if the measured distortion exceeds the threshold, the current synthesized texture is regenerated.

Abstract: An anisometric texture synthesis system and method for generating anisometric textures having a similar visual appearance as a given exemplar, but with varying orientation and scale. This variation is achieved by modifying the upsampling and correaction processes of the texture synthesis technique using a Jacobian field. The modified correaction process includes accessing only immediate neighbors of a pixel instead of non-local pixels. This constraint that only immediate neighbors be used also allows the generation of seamless anisometric surface textures. This is achieved by using indireaction maps containing indireaction pointers that are used to jump from a set of pixels outside the boundary of a texture atlas chart to another chart. The system and method also includes an anisometric synthesis magnification technique that uses a Jacobian field to modify the magnification step of a synthesis magnification scheme and account for anisometry.