Frame pacing for improved experiences in 3D applications
US-12057090-B2 · Aug 6, 2024 · US
US9607357B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9607357-B2 |
| Application number | US-201514940527-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 13, 2015 |
| Priority date | Sep 13, 2010 |
| Publication date | Mar 28, 2017 |
| Grant date | Mar 28, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods and Apparatus provide for obtaining a data sequence representative of a three-dimensional parameter space; forming a plurality of coding units by dividing, in three dimensions, the data sequence subject; and generating, for each of the plurality of coding units: (i) a palette defined by two representative values, and (ii) a plurality of indices, each index representing a respective original data point as a value, determined by linear interpolation, to be one of, or an intermediate value between, the representative values, and setting the palette and the plurality of indices for each of the coding units as compressed data.
Opening claim text (preview).
What is claimed is: 1. A data compression device comprising: a data division unit configured to form a plurality of coding units by dividing, in three dimensions, a data sequence subject to compression in a three-dimensional parameter space; and a compression coding unit configured to generate, for each of the plurality of coding units: (i) a palette defined by two representative values, and (ii) a plurality of indices, each index representing a respective original data point as a value, determined by linear interpolation, to be one of, or an intermediate value between, the representative values, wherein the palette and the plurality of indices for each of the coding units are set as compressed data, the data sequence has at least one frame of data at each of a plurality of discrete times, each frame of data includes a plurality of discrete data points representing two of the three dimensions, and the discrete time represents a third of the three dimensions, of the three-dimensional parameter space, each coding unit includes: (i) a respective set of data points from among one or more sets of the discrete data points of the at least one frame at a first of the discrete times, and (ii) a respective corresponding set of data points from among one or more corresponding sets of the discrete data points of the at least one frame at a second of the discrete times, and a predetermined pattern of the coding units defines respective two dimensional positions of: (i) the one or more sets of the discrete data points, and (ii) the one or more corresponding sets of the discrete data points. 2. The data compression device of claim 1 , wherein the compression coding unit is configured to define the palette of each of the plurality of coding units by respective minimum and maximum values taken from the data points of such coding unit. 3. The data compression device according to claim 1 , wherein: the data division unit is configured to form respective sets of coding units according to each of a plurality of predetermined patterns, the compression coding unit is configured to perform respective separate data compressions of the data sequence using each of the plurality of predetermined patterns, and one of the plurality of predetermined patters is selected for performing compression of the data sequence based on comparing resultant errors of the respective separate data compressions and determining a smallest error. 4. The data compression device according to claim 1 , further comprising: a conversion unit configured to generate, from moving image data, a Y image sequence, a Cb image sequence, and a Cr image sequence, wherein: the at least one frame of data at each discrete time includes: (i) a luminance frame Y having a plurality of pixels of luminance data Y, (ii) a chrominance frame Cb having a plurality of pixels of chrominance data Cb, and (iii) a chrominance frame Cr having a plurality of pixels of chrominance data Cr; and the data division unit is configured to form coding units from the luminance frames Y, and other coding units from the chrominance frames Cb and the chrominance frames Cr. 5. The data compression device according to claim 4 , wherein the data division unit reduces the Cb image sequence and the Cr image sequence by a predetermined scale in a direction of an image plane before division and performs temporal and spatial division such that a number of pixels included in each coding unit is constant in the Y image sequence, the Cb image sequence, and the Cr image sequence. 6. The data compression device according to claim 4 , wherein the moving image data is a moving image stream which constitutes hierarchical moving image data obtained by hierarchizing, in order of resolution, a plurality of image frame sequences that represent image frames constituting a single moving image in different resolutions, and which is generated in units of tile images obtained by dividing each image frame of an image frame sequence of each hierarchical layer by a predetermined size. 7. The data compression device according to claim 1 , wherein the compression coding unit generates a storage unit in which the palette and the indices generated for each coding unit are combined in an original three-dimensional parameter space and stores, as compressed data, the palette and the indices in a memory device for each respective storage unit. 8. The data compression device according to claim 1 , wherein the data division unit selects a division pattern for each area of a predetermined unit in the three-dimensional parameter space and generates a division pattern mapping identification information of the selected division pattern to the area of a predetermined unit, and wherein the compression coding unit generates the palette and the indices for each coding unit generated by the selected division pattern and then includes the division pattern map in the compressed data. 9. The data compression device according to claim 8 , wherein the compression coding unit embeds, by expressing the identification information of the division pattern by a magnitude relationship of the two values retained by the palette and by the storage order of the two values, the division pattern map in the palette generated for each coding unit. 10. A data compression method, comprising: reading out a data sequence representative of a three-dimensional parameter space from a memory device; forming a plurality of coding units by dividing, in three dimensions, the data sequence subject; generating, for each of the plurality of coding units: (i) a palette defined by two representative values, and (ii) a plurality of indices, each index representing a respective original data point as a value, determined by linear interpolation, to be one of, or an intermediate value between, the representative values; and setting the palette and the plurality of indices for each of the coding units as compressed data, wherein: the data sequence has at least one frame of data at each of a plurality of discrete times, each frame of data includes a plurality of discrete data points representing two of the three dimensions, and the discrete time represents a third of the three dimensions, of the three-dimensional parameter space, each coding unit includes: (i) a respective set of data points from among one or more sets of the discrete data points of the at least one frame at a first of the discrete times, and (ii) a respective corresponding set of data points from among one or more corresponding sets of the discrete data points of the at least one frame at a second of the discrete times, and a predetermined pattern of the coding units defines respective two dimensional positions of: (i) the one or more sets of the discrete data points, and (ii) the one or more corresponding sets of the discrete data points. 11. A non-transitory, computer readable storage medium containing a computer program, which when executed by a computer system causes the system to carry out actions, comprising: reading out a data sequence representative of a three-dimensional parameter space from a memory device; forming a plurality of coding units by dividing, in three dimensions, the data sequence subject; generating, for each of the plurality of coding units: (i) a palette defined by two representative values, and (ii) a plurality of indices, each index representing a respective original data point as a value, determined by linear interpolation, to be one of, or an intermediate value between, the representative values; and setting the palette and the plurality of indices for each of the coding units as compressed data, wherein: the data sequence has at least one frame of data a
the unit being a colour or a chrominance component · CPC title
Arrangements for interaction with the human body, e.g. for user immersion in virtual reality (blind teaching G09B21/00) · CPC title
involving spatial prediction techniques · CPC title
Tree coding, e.g. quad-tree coding · CPC title
Memory management · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.