Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Random Depth Buffer Compression Using Generalized Planar Coding

A depth and compressor technology, applied in the field of random depth buffer compression, which can solve problems such as complex depth functions

Inactive Publication Date: 2016-12-07
INTEL CORP
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] While planar encoding is very useful for static 2D rasterization, it is not sufficient for using static planes for higher order rasterization, where the depth function is more complex

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Random Depth Buffer Compression Using Generalized Planar Coding
  • Random Depth Buffer Compression Using Generalized Planar Coding
  • Random Depth Buffer Compression Using Generalized Planar Coding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0019] Planar coding can be generalized to include random effects such as motion blur and depth of field. The depth function coefficients are computed in the rasterizer and passed to the compressor. Standard plane encoding uses three coefficients per depth function (ie, plane) in the form d=A*x+B*Y+C to represent the depth of a triangle. When triangles experience random effects such as motion blur and depth of field, the depth function is no longer flat. However, we can still get a depth function in the form d=f(x,y,u,v,t) by storing more coefficients per triangle.

[0020] In some embodiments, the benefits of this approach include a substantially more efficient compression algorithm than the previous approach. This is made possible by providing an analytical representation of the depth function directly from the rasterizer settings, avoiding the cost of finding lower-order representations in the compressor, as in previous approaches. Unlike previous planar compression meth...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

Unlike a static primitive, where the depth function is planar, the depth function for a moving and defocused triangle is a rational function in time and the lens parameters. Compact depth functions can be used to design an efficient depth buffer compressor / decompressor, which significantly lowers total depth buffer bandwidth usage. In addition, this compressor / decompressor is substantially simpler in the number of operations needed to execute, which makes it more amenable for hardware implementation than previous methods.

Description

[0001] Cross References to Related Applications [0002] This application claims priority to Provisional Application Serial No. 61 / 706,177, filed September 27, 2012, which is expressly incorporated herein by reference. technical field [0003] In general, the present invention relates to depth buffering, and in particular, the present invention relates to methods and apparatus for stochastic depth buffer compression using generalized planar coding. Background technique [0004] Depth buffering is a standard technique for resolving visibility between objects in the rasterization pipeline. The depth buffer holds a per-sample depth value representing the current closest depth of all previously rendered triangles that overlap the sample. The depth value d can be defined in many ways. [0005] In stochastic rasterizers with many samples per pixel, the depth buffer bandwidth requirements are much higher than usual, and the depth data should be compressed if possible. Most depth...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04N13/00G06T5/00
CPCG06T9/00G06T15/40G06T15/20G06T11/40
Inventor M·安德松C·J·蒙克贝里T·G·阿可尼内-默勒J·N·哈塞尔格伦
Owner INTEL CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com