Dynamic reference point depth offset Z value compression algorithm

A technology of depth offset and compression algorithm, which is applied in computing, image data processing, instruments, etc., can solve the problem of large memory data bandwidth, achieve high compressibility, good continuity, and improve the effect of compressibility

Pending Publication Date: 2020-04-21
XIAN AVIATION COMPUTING TECH RES INST OF AVIATION IND CORP OF CHINA
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, frequent video memory read and write operations

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
  • Dynamic reference point depth offset Z value compression algorithm
  • Dynamic reference point depth offset Z value compression algorithm
  • Dynamic reference point depth offset Z value compression algorithm

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0039] Original 2 static Z in DO algorithm Min And Z Max Based on the reference point, add a dynamic reference point Z for each pixel Tile Dyn , When a certain pixel depth data in Tile is based on Z Min And Z Max When the compression of the reference points fails, the Z is determined dynamically according to the position of the current compression failure pixel Dyn Insert position, and increase the indicator associated with each offset from 1bit to 2bit, so that in Z Min ,Z Max And Z Dyn Choose between reference points so that based on Z Dyn Offset coverage area of ​​reference point relative to Z Min Or Z Max The reference point is doubled for better coverage. Tile cannot be based on Z Min And Z Max Discrete, non-uniformly distributed pixel depth values ​​covered by the reference point offset, so as to achieve a higher compressibility.

[0040] A dynamic reference point depth migration Z value compression algorithm, the algorithm includes the following steps:

[0041] S1: Ca...

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

The invention discloses a dynamic reference point depth offset Z value compression algorithm. The algorithm comprises the following steps: S1, calculating and storing ZMin and ZMax reference points ofa current Tile, and increasing an Indicator associated with each offset from 1 bit to 2 bit; S2, judging whether the Z value of each pixel is compressible or not according to a standard DO algorithm,and if all the pixels in the Tile are compressible, indicating that the Tile is successfully compressed; if any pixel in the Tile is incompressible, entering S3; and S3, adding a dynamic reference point ZDyn according to the depth of the incompressible pixel, and compressing the incompressible pixel in the S2 in the Tile based on the ZDyn. According to the algorithm, the offset coverage area based on the ZDyn reference point is doubled relative to the ZMin or ZMax reference point, and discrete and non-uniformly distributed pixel depth values which cannot be covered by the offset based on theZMin and ZMax reference points in the Tile are better covered, so that a higher compressible rate is realized.

Description

technical field [0001] The invention relates to the technical field of computer hardware, in particular to a compression algorithm of a dynamic reference point Z value based on depth offset. Background technique [0002] The most significant difference between 3D graphics processing and 2D graphics processing is the introduction of the concept of depth, which makes the rendering result have a layered and three-dimensional real experience. In the process of continuous graphics drawing, in order to finally correctly display the color of the primitive pixel closest to the observer, the depth data (Z value) of each pixel needs to be buffered for real-time depth testing to distinguish the pixel currently being drawn The contextual relationship between the depth value of the pixel and the depth value of the pixel that has been drawn. However, frequent video memory read and write operations for depth testing require a huge memory data bandwidth. For example, assuming that the com...

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
IPC IPC(8): G06T9/00
CPCG06T9/00
Inventor 张骏田泽郑新建任向隆韩立敏聂曌
Owner XIAN AVIATION COMPUTING TECH RES INST OF AVIATION IND CORP OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap