Image processing apparatus, image processing method, and storage medium
US-2024428519-A1 · Dec 26, 2024 · US
US2021287431A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2021287431-A1 |
| Application number | US-202016819118-A |
| Country | US |
| Kind code | A1 |
| Filing date | Mar 15, 2020 |
| Priority date | Mar 15, 2020 |
| Publication date | Sep 16, 2021 |
| Grant date | — |
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.
Apparatus and method for lossy displaced mesh compression. For example, one embodiment of an apparatus comprises: displacement mapping circuitry/logic to generate an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and mesh compression circuitry/logic to compress the original displacement-mapped mesh, the mesh compression circuitry/logic comprising a quantizer to quantize the displacement mapping of the plurality of vertices in view of a base mesh to generate a displacement array.
Opening claim text (preview).
What is claimed is: 1 . An apparatus comprising: displacement mapping circuitry/logic to generate an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and mesh compression circuitry/logic to compress the original displacement-mapped mesh, the mesh compression circuitry/logic comprising a quantizer to quantize the displacement mapping of the plurality of vertices in view of a base mesh to generate a displacement array. 2 . The apparatus of claim 1 wherein the mesh compression circuitry/logic is to further store a compressed displaced mesh comprising base coordinates of the base mesh in combination with the displacement array. 3 . The apparatus of claim 2 wherein the base mesh comprises the base subdivision mesh. 4 . The apparatus of claim 2 further comprising: an interpolator to perform bilinear interpolation on the base subdivision mesh to generate the base mesh. 5 . The apparatus of claim 2 further comprising: decompression circuitry/logic to decompress the compressed displaced mesh responsive to a request. 6 . The apparatus of claim 5 wherein the decompression circuitry/logic attempts to reconstruct the original displacement-mapped mesh by combining coordinates of the base mesh with elements of the displacement array to generate a decompressed displacement-mapped mesh. 7 . The apparatus of claim 6 wherein the decompressed displacement-mapped mesh comprises an approximation of the original displacement-mapped mesh. 8 . The apparatus of claim 7 further comprising: bounding volume hierarchy (BVH) generation circuitry to generate a BVH based on a plurality of primitives including a first primitive associated with the decompressed displacement-mapped mesh. 9 . The apparatus of claim 8 further comprising: ray traversal/intersection circuitry to traverse one or more rays through the BVH to identify an intersection with the decompressed displacement-mapped mesh. 10 . A method comprising: generating an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and compressing the original displacement-mapped mesh by quantizing the displacement mapping of the plurality of vertices in view of a base mesh to generate a displacement array. 11 . The method of claim 10 wherein the mesh compression circuitry/logic is to further store a compressed displaced mesh comprising base coordinates of the base mesh in combination with the displacement array. 12 . The method of claim 11 wherein the base mesh comprises the base subdivision mesh. 13 . The method of claim 11 further comprising: performing bilinear interpolation on the base subdivision mesh to generate the base mesh. 14 . The method of claim 11 further comprising: decompressing the compressed displaced mesh responsive to a request. 15 . The method of claim 14 wherein decompressing further comprises combining coordinates of the base mesh with elements of the displacement array to generate a decompressed displacement-mapped mesh. 16 . The method of claim 15 wherein the decompressed displacement-mapped mesh comprises an approximation of the original displacement-mapped mesh. 17 . The method of claim 16 further comprising: generating a bounding volume hierarchy (BVH) based on a plurality of primitives including a first primitive associated with the decompressed displacement-mapped mesh. 18 . The method of claim 17 further comprising: traversing one or more rays through the BVH to identify an intersection with the decompressed displacement-mapped mesh. 19 . A machine-readable medium having program code stored thereon which, when executed by a machine, causes the machine to perform the operations of: generating an original displacement-mapped mesh by performing a displacement mapping of a plurality of vertices of a base subdivision mesh; and compressing the original displacement-mapped mesh by quantizing the displacement mapping of the plurality of vertices in view of a base mesh to generate a displacement array. 20 . The machine-readable medium of claim 19 wherein the mesh compression circuitry/logic is to further store a compressed displaced mesh comprising base coordinates of the base mesh in combination with the displacement array. 21 . The machine-readable medium of claim 20 wherein the base mesh comprises the base subdivision mesh. 22 . The machine-readable medium of claim 20 further comprising program code to cause the machine to perform the operations of: performing bilinear interpolation on the base subdivision mesh to generate the base mesh. 23 . The machine-readable medium of claim 20 further comprising program code to cause the machine to perform the operations of: decompressing the compressed displaced mesh responsive to a request. 24 . The machine-readable medium of claim 23 wherein decompressing further comprises combining coordinates of the base mesh with elements of the displacement array to generate a decompressed displacement-mapped mesh. 25 . The machine-readable medium of claim 24 wherein the decompressed displacement-mapped mesh comprises an approximation of the original displacement-mapped mesh. 26 . The machine-readable medium of claim 25 further comprising program code to cause the machine to perform the operations of: generating a bounding volume hierarchy (BVH) based on a plurality of primitives including a first primitive associated with the decompressed displacement-mapped mesh. 27 . The machine-readable medium of claim 26 further comprising program code to cause the machine to perform the operations of: traversing one or more rays through the BVH to identify an intersection with the decompressed displacement-mapped mesh.
the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title
Finite element generation, e.g. wire-frame surface description, {tesselation} · CPC title
Processor architectures; Processor configuration, e.g. pipelining · CPC title
based on interpolation, e.g. bilinear interpolation (image demosaicing G06T3/4015; edge-driven or edge-based scaling G06T3/403) · CPC title
involving image processing hardware · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.