Abstract: Techniques to facilitate compression of depth data and real-time reconstruction of high-quality light fields. A parameter space of values for a line, pairs of endpoints on different sides of the line, and a palette index for each pixel of a pixel tile of a depth image is sampled. Values for the line, the pairs of endpoints, and the palette index that minimize an error are determined and stored.

Abstract: Techniques to facilitate compression of depth data and real-time reconstruction of high-quality light fields. A parameter space of values for a line, pairs of endpoints on different sides of the line, and a palette index for each pixel of a pixel tile of a depth image is sampled. Values for the line, the pairs of endpoints, and the palette index that minimize an error are determined and stored.

Abstract: Systems, methods, and articles of manufacture are disclosed that enable the compression of depth data and real-time reconstruction of high-quality light fields. In one aspect, spatial compression and decompression of depth images is divided into the following stages: generating a quadtree data structure for each depth image captured by a light field probe and difference mask associated with the depth image, with each node of the quadtree approximating a corresponding portion of the depth image data using an approximating function; generating, from the quadtree for each depth image, a runtime packed form that is more lightweight and has a desired maximum error; and assembling multiple such runtime packed forms into per-probe stream(s); and decoding at runtime the assembled per-probe stream(s). Further, a block compression format is disclosed for approximating depth data by augmenting the block compression format 3DC+(BC4) with a line and two pairs of endpoints.

Abstract: Systems, methods, and articles of manufacture for real-time rendering using compressed animated light fields are disclosed. One embodiment provides a pipeline, from offline rendering of an animated scene from sparse optimized viewpoints to real-time rendering of the scene with freedom of movement, that includes three stages: offline preparation and rendering, stream compression, and real-time decompression and reconstruction. During offline rendering, optimal placements for cameras in the scene are determined, and color and depth images are rendered using such cameras. Color and depth data is then compressed using an integrated spatial and temporal scheme permitting high performance on graphics processing units for virtual reality applications.

Abstract: A system for performing memory allocation for seamless media content presentation includes a computing platform having a CPU, a GPU having a GPU memory, and a main memory storing a memory allocation software code. The CPU executes the memory allocation software code to transfer a first dataset of media content to the GPU memory, seamlessly present the media content to a system user, register a location of the system user during the seamless presentation of the media content, and register a timecode status of the media content at the location. The CPU further executes the memory allocation software code to identify a second dataset of the media content based on the location and the timecode status, transfer a first differential dataset to the GPU memory, continue to seamlessly present the media content to the system user, and transfer a second differential dataset out of the GPU memory.

Abstract: Systems, methods, and articles of manufacture are disclosed that enable the compression of depth data and real-time reconstruction of high-quality light fields. In one aspect, spatial compression and decompression of depth images is divided into the following stages: generating a quadtree data structure for each depth image captured by a light field probe and difference mask associated with the depth image, with each node of the quadtree approximating a corresponding portion of the depth image data using an approximating function; generating, from the quadtree for each depth image, a runtime packed form that is more lightweight and has a desired maximum error; and assembling multiple such runtime packed forms into per-probe stream(s); and decoding at runtime the assembled per-probe stream(s). Further, a block compression format is disclosed for approximating depth data by augmenting the block compression format 3DC+(BC4) with a line and two pairs of endpoints.

Abstract: A system for performing memory allocation for seamless media content presentation includes a computing platform having a CPU, a GPU having a GPU memory, and a main memory storing a memory allocation software code. The CPU executes the memory allocation software code to transfer a first dataset of media content to the GPU memory, seamlessly present the media content to a system user, register a location of the system user during the seamless presentation of the media content, and register a timecode status of the media content at the location. The CPU further executes the memory allocation software code to identify a second dataset of the media content based on the location and the timecode status, transfer a first differential dataset to the GPU memory, continue to seamlessly present the media content to the system user, and transfer a second differential dataset out of the GPU memory.

Abstract: Systems, methods, and articles of manufacture for real-time rendering using compressed animated light fields are disclosed. One embodiment provides a pipeline, from offline rendering of an animated scene from sparse optimized viewpoints to real-time rendering of the scene with freedom of movement, that includes three stages: offline preparation and rendering, stream compression, and real-time decompression and reconstruction. During offline rendering, optimal placements for cameras in the scene are determined, and color and depth images are rendered using such cameras. Color and depth data is then compressed using an integrated spatial and temporal scheme permitting high performance on graphics processing units for virtual reality applications.

Abstract: Views of a virtual space may be presented based on predicted colors of individual pixels of individual frame images that depict the views of the virtual space. Predictive models may be assigned to individual pixels that predict individual pixel colors of individual pixels at individual time points. Individual models may be updated and/or reprojected to other pixels based on comparisons of the predicted pixel colors and colors specified by in a raster input signal.

Abstract: A method is disclosed for reducing distortions introduced by deformation of a surface with an existing parameterization. In an exemplary embodiment, the method comprises receiving a rest pose mesh comprising a plurality of faces, a rigidity map corresponding to the rest pose mesh, and a deformed pose mesh; using the rigidity map to generate a simulation grid on the rest pose mesh, the simulation grid comprising a plurality of cells; defining a set of constraints on the simulation grid, the constraints being derived at least in part from the rigidity map; running a simulation using the simulation grid and the set of constraints to obtain a warped grid; and texture mapping the deformed pose mesh based on data from the warped grid.

Abstract: Views of a virtual space may be presented based on predicted colors of individual pixels of individual frame images that depict the views of the virtual space. Predictive models may be assigned to individual pixels that predict individual pixel colors of individual pixels at individual time points. Individual models may be updated and/or reprojected to other pixels based on comparisons of the predicted pixel colors and colors specified by in a raster input signal.

Abstract: A method is disclosed for reducing distortions introduced by deformation of a surface with an existing parameterization. In an exemplary embodiment, the method comprises receiving a rest pose mesh comprising a plurality of faces, a rigidity map corresponding to the rest pose mesh, and a deformed pose mesh; using the rigidity map to generate a simulation grid on the rest pose mesh, the simulation grid comprising a plurality of cells; defining a set of constraints on the simulation grid, the constraints being derived at least in part from the rigidity map; running a simulation using the simulation grid and the set of constraints to obtain a warped grid; and texture mapping the deformed pose mesh based on data from the warped grid.

Abstract: A method is disclosed for reducing distortions introduced by deformation of a surface with an existing parameterization. In one embodiment, the distortions are reduced over a user-specified convex region in texture space ensuring optimization is locally contained in areas of interest. A distortion minimization algorithm is presented that is guided by a user-supplied rigidity map of the specified region. In one embodiment, non-linear optimization is used to calculate the axis-aligned deformation of a non-uniform grid specified over the region's parameter space, so that when the space is remapped from the original to the deformed grid, the distortion of the rigid features is minimized. Since grids require minimal storage and the remapping from one grid to another entails minimal cost, grids can be precalculated for animation sequences and used for real-time texture space remapping that minimizes distortions on specified rigid features.

Abstract: A method is disclosed for reducing distortions introduced by deformation of a surface with an existing parameterization. In one embodiment, the distortions are reduced over a user-specified convex region in texture space ensuring optimization is locally contained in areas of interest. A distortion minimization algorithm is presented that is guided by a user-supplied rigidity map of the specified region. In one embodiment, non-linear optimization is used to calculate the axis-aligned deformation of a non-uniform grid specified over the region's parameter space, so that when the space is remapped from the original to the deformed grid, the distortion of the rigid features is minimized. Since grids require minimal storage and the remapping from one grid to another entails minimal cost, grids can be precalculated for animation sequences and used for real-time texture space remapping that minimizes distortions on specified rigid features.