CN117203661A - Image processing apparatus and method - Google Patents

Abstract

The image processing device and the method provided by the embodiment of the application relate to the technical field of computers, and can improve the rejection rate of data to be rendered, thereby reducing the consumption of computing resources and improving the rendering speed. The device comprises a rendering pipeline, wherein a first rasterizer and a first depth testing module are arranged in the rendering pipeline. A first rasterizer for converting primitives input to a rendering pipeline into fragments to be rendered. The first depth test module is used for carrying out a first depth test on the fragment to be rendered according to global depth information, if the fragment to be rendered fails the first depth test, the fragment to be rendered is removed, and the global depth information comprises depth information of a plurality of pixel blocks obtained by updating all the primitives to be rendered.

Description

Image processing device and method Technical field

The present application relates to the field of computer technology, and in particular to image processing devices and methods.

Background technique

Rendering is the process of two-dimensional projection of a model in a three-dimensional scene according to the set environment, lighting, materials and rendering parameters to obtain a digital image. However, during the rendering process, the graphics processing unit (GPU) consumes a large amount of computing resources. To this end, the GPU can eliminate data to be rendered that does not affect the rendering results during the rendering phase to reduce computing resource consumption.

However, in related technologies, the GPU can only eliminate a small amount of data to be rendered that does not affect the rendering result during the rendering stage, and cannot achieve a high elimination rate.

Contents of the invention

This application provides an image processing device and method that can improve the rejection rate of data to be rendered, thereby reducing computing resource consumption and increasing rendering speed.

In a first aspect, this application provides an image processing device, which includes a rendering pipeline in which a first rasterizer and a first depth testing module are disposed. The first rasterizer is used to convert primitives input into the rendering pipeline into fragments to be rendered. A first depth test module, configured to perform a first depth test on the fragment to be rendered based on global depth information. If the fragment to be rendered fails the first depth test, the fragment to be rendered is eliminated. The global The depth information includes depth information of multiple pixel blocks updated based on all primitives to be rendered.

It can be seen that the image processing device provided by this application can eliminate the fragments to be rendered through the global depth information. Since the global depth information is determined based on all the primitives to be rendered, and the fragments to be rendered are converted from the primitives to be rendered, so Global depth information is equivalent to being generated based on all fragments to be rendered. The embodiment of the present application uses the depth information of all the fragments to be rendered to perform fragment elimination. Compared with the related technology, which only uses the depth information of some of the fragments to be rendered to perform fragment elimination, the method provided by the application can improve the elimination rate of the data to be rendered, thereby reducing the Calculate resource consumption to increase GPU rendering speed.

In a possible implementation, the first depth testing module is specifically configured to perform the first step on the fragment to be rendered according to the depth information of the target pixel block in the global information and the depth information of the fragment to be rendered. For depth testing, the target pixel block is a pixel block among the plurality of pixel blocks that overlaps with the segment to be rendered.

In a possible implementation, the first depth testing module is specifically configured to: when the depth value of the fragment to be rendered is greater than the depth value of the target pixel block, determine that the fragment to be rendered has not passed the first depth test module. Deep testing.

Since the target pixel block and the fragment to be rendered overlap, the fragment to be rendered will be rendered on the target pixel block. Through the depth information of the target pixel block in the global information and the depth information of the fragment to be rendered, it can be determined that the fragment to be rendered will be visible on the target pixel block when the depth value of the fragment to be rendered is greater than the depth value of the target pixel block. blocked by the fragment.

Alternatively, a block of pixels (such as a target block of pixels) may include a target area. The depth information of the pixel block may include the maximum depth value of the target area of the pixel block, the maximum depth value of the non-target area of the pixel block, and the range of the target area of the pixel block.

Optionally, the depth information of a fragment (eg, a fragment to be rendered) may include a depth value of the fragment. Among them, the depth value of the fragment can be obtained through interpolation.

In a possible implementation, the target pixel block includes a target area, the depth value of the target pixel block includes a first depth value and a second depth value, and the first depth testing module is specifically used to:

When the segment to be rendered is located in the target area of the target pixel block and the depth value of the segment to be rendered is less than or equal to the first depth value, it is determined that the segment to be rendered passes the first depth test.

When the fragment to be rendered is located in the target area of the target pixel block and the depth value of the fragment to be rendered is greater than the first depth value, it is determined that the fragment to be rendered fails the first depth test.

When the fragment to be rendered is located in a non-target area of the target pixel block and the depth value of the fragment to be rendered is less than or equal to the second depth value, it is determined that the fragment to be rendered passes the first depth test.

When the fragment to be rendered is located in a non-target area of the target pixel block and the depth value of the fragment to be rendered is greater than the second depth value, it is determined that the fragment to be rendered fails the first depth test.

It should be noted that the fragment to be rendered is located in the target area of the target pixel block and the depth value of the fragment to be rendered is greater than the first depth value, indicating that the fragment to be rendered will be occluded by the visible fragments in the target area of the target pixel block, so it can Eliminate the fragment to be rendered to reduce the consumption of computing resources and increase the rendering speed of the GPU.

The fragment to be rendered is located in the target area of the non-target pixel block and the depth value of the fragment to be rendered is greater than the second depth value, indicating that the fragment to be rendered will be obscured by the visible fragments in the non-target area of the target pixel block, so the fragment to be rendered can be Eliminate rendering fragments to reduce computing resource consumption and increase GPU rendering speed.

It can be understood that, instead of only performing a depth test on the fragment to be rendered by the depth value of the target pixel block, the target pixel block is divided into a target area and a non-target area and the maximum depth value in these two areas is used to test the fragment to be rendered. Conducting depth testing can increase the accuracy of depth testing and reduce the probability of false rejections.

In a possible implementation, the device may further include a first cache module configured to cache the global depth information.

In a possible implementation, the device may further include a partition pipeline, in which a second rasterizer and a second depth test module are disposed. The second rasterizer is used to project the primitives to be rendered input into the partition pipeline to multiple pixel blocks to generate multiple projection areas. A second depth module, configured to perform a second depth test on the primitive to be rendered according to the plurality of projection areas, and if the primitive to be rendered fails the second depth test, eliminate the graphic to be rendered. Yuan. Wherein, the plurality of projection areas correspond to the plurality of pixel blocks on a one-to-one basis.

It can be seen that the device provided by this application can not only eliminate the fragments to be rendered that do not need to be rendered, but also eliminate the elements to be rendered that do not need to be rendered. Compared with only eliminating the fragments to be rendered that do not need to be rendered, this application can also eliminate the fragments that do not need to be rendered. The primitives to be rendered are eliminated, thereby further improving the elimination rate of the data to be rendered, further reducing the consumption of computing resources, and further improving the rendering speed of the GPU.

In a possible implementation, the second depth module is specifically configured to: determine whether the primitive to be rendered passes in the first pixel block according to the depth information of the first pixel block and the depth information of the first projection area. For depth testing, the first pixel block is any pixel block among the plurality of pixel blocks, and the first projection area is the projection area corresponding to the first pixel block. If the primitive to be rendered passes the depth test in the first pixel block, it is determined that the primitive to be rendered passes the second depth test; if the primitive to be rendered is in the plurality of pixel blocks If both of them fail the depth test, it is determined that the primitive to be rendered fails the second depth test.

In a possible implementation, the second depth module is specifically configured to: when the minimum depth value of the first projection area is less than the depth value of the first pixel block, determine where the primitive to be rendered is located. The first pixel block passes the depth test.

Optionally, the depth information of the projection area (such as the first projection area) may include a maximum depth value of the projection area, a minimum depth value of the projection area, and a range of the projection area.

In a possible implementation, the first pixel block includes a target area, and the depth value of the first pixel block includes a maximum depth value of the target area of the first pixel block and a depth value of the first pixel block. The maximum depth value of the non-target area. The second depth module is specifically used for:

When both the target area and the non-target area of the first projection area overlap with the first pixel block and the minimum depth value of the first projection area is less than the first depth value or the second depth value, it is determined that the primitive to be rendered is in the first pixel The block passes the test.

In the case where the first projection area overlaps with both the target area and the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value and the second depth value, it is determined that the primitive to be rendered is in the first Failed test in one pixel block

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is less than the first depth value, it is determined that the primitive to be rendered passes the test in the first pixel block.

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value, it is determined that the primitive to be rendered fails the test in the first pixel block.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is less than the second depth value, it is determined that the primitive to be rendered passes the test in the first pixel block.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the second depth value, it is determined that the primitive to be rendered fails the test in the first pixel block.

In a possible implementation, the second depth module is also configured to update the global depth information according to the multiple projection areas.

In a possible implementation, the second depth module is further specifically configured to: update the depth information of the first pixel block in the global depth information according to the depth information of the first pixel block and the depth information of the first projection area. Depth information, the first pixel block is any pixel block among the plurality of pixel blocks, and the first projection area is the projection area corresponding to the first pixel block.

In a possible implementation, the first pixel block includes a target area, and the second depth module is further specifically configured to: based on the maximum depth value of the first projection area, the target of the first pixel block The maximum depth value of the area, the maximum depth value of the non-target area of the first pixel block, and the depth information of the first pixel block are updated.

In a possible implementation, the second depth module is also specifically used to:

When the first projection area overlaps with both the target area and the non-target area of the first pixel block and the maximum depth value of the first projection area is less than the first depth value or the second depth value, update the depth of the first pixel block. information.

In the case where the first projection area overlaps with both the target area and the non-target area of the first pixel block and the maximum depth value of the first projection area is greater than the first depth value and the second depth value, the first pixel block is not updated. depth information.

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is less than the first depth value, the depth information of the first pixel block is updated.

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value, the depth information of the first pixel block is not updated.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is less than the second depth value, the depth information of the first pixel block is updated.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the second depth value, the depth information of the first pixel block is not updated.

In a possible implementation, the second depth module is also specifically used to:

When the first projection area completely coincides with the target area of the first pixel block and the third depth value (ie, the maximum depth value of the projection area) is less than the first depth value, the target area of the first pixel block is updated to the target projection. area and update the first depth value of the first pixel block to the third depth value.

When the first projection area completely coincides with the non-target area of the first pixel block and the third depth value is less than the second depth value, the target area of the first pixel block is updated to the non-target projection area and the first pixel block is The second depth value is updated to the third depth value.

When the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the first condition and the second condition are met, the target area of the first pixel block is updated to the first area and the third The first depth value of a pixel block is updated to a first numerical value. Wherein, the above-mentioned first condition is that the third depth value is smaller than the first depth value but larger than the second depth value or the third depth value is smaller than the second depth value but larger than the first depth value. The second condition is that the first absolute value is less than the second absolute value. The first absolute value is the absolute value of the difference between the first depth value and the third depth value. The second absolute value is the difference between the second depth value and the third depth value. The absolute value of the difference between the above third depth values. The above-mentioned first area is the union area of the target area and the target projection area, and the first value is the larger value between the first depth value and the third depth value.

When the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the first condition and the third condition are met, the target area of the first pixel block is updated to the second area and the third The second depth value of a pixel block is updated to a second value. Wherein, the above third condition is that the first absolute value is greater than the second absolute value. The above-mentioned second area is the intersection area of the target area and the non-target projection area. The above-mentioned second value is the larger value between the second depth value and the third depth value.

In the case that the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the third depth value is smaller than the first depth value and the second depth value, the target area of the first pixel block is updated as The target projection area is to change the first depth value of the first pixel block to a third depth value, and update the second depth value of the first pixel block to a third value. The third value is the larger value between the first depth value and the second depth value.

Optionally, the target projection area (CurMask) includes a first target projection area (ie CurMask0) and a second target projection area (ie CurMask0)

In the case where the third depth value of the projection area is smaller than the second depth value of the pixel block, the first target projection area (ie CurMask0) may represent an overlapping area of the projection area and the non-target area of the pixel block.

In the case where the third depth value of the projection area is smaller than the first depth value of the pixel block, the second target projection area (ie, CurMask0) may represent an overlapping area of the projection area and the target area of the pixel block.

The target projection area (CurMask) may be the union of the first target projection area (CurMask0) and the second target projection area (CurMask0).

In a possible implementation, the rendering pipeline of the image processing device may also be provided with at least one of a front depth testing module, a pixel shader, a post depth testing module, or a depth cache module. A front depth test module, configured to perform a front depth test on the first target fragment according to the depth value in the depth cache module. The pixel shader is used to shade the second target fragment. A post-depth test module, configured to perform a post-depth test on the third target fragment according to the depth value in the depth cache module. Depth cache module, used to cache depth values. The first target fragment is a fragment that passes the first depth test, the second target fragment is a fragment that passes a previous depth test, and the third target fragment is a fragment that is rendered by a pixel shader.

In a second aspect, this application also provides another image processing device, which includes a rendering pipeline, which is provided with a rasterizer, a rendering coarse-grained depth test module, a front-depth test module, a pixel shader, a depth test module, and a depth test module. Cache module and post-depth test module. The rasterizer is used to convert graphics elements input into the rendering pipeline into fragments to be rendered; the rendering coarse-grained depth test module is used to perform a first depth test on the fragments to be rendered; the front depth The test module is used to perform a front depth test on the first target fragment according to the depth value in the depth cache module; the pixel shader is used to perform color rendering on the second target fragment; the back depth test module is used Perform a post-depth test on the third target fragment according to the depth value in the depth cache module; the depth cache module is used to cache the depth value. The first target fragment is a fragment that passes the first depth test, the second target fragment is a fragment that passes a previous depth test, and the third target fragment is a fragment that is rendered by a pixel shader.

Compared with related technologies, only a pre-depth test module and a post-depth test module are set up in the rendering pipeline to eliminate fragments. The rendering pipeline of the image processing device provided by this application is not only provided with a front depth test module and a post depth test module, but is also provided with a rendering coarse-grained depth test module. By rendering the coarse-grained depth test module, the front depth test module and the post-depth test module together to perform depth tests on the fragments, the rejection rate of the data to be rendered can be improved, thereby reducing the consumption of computing resources and improving the rendering speed of the GPU.

In a possible implementation, the rendering coarse-grained depth testing module is specifically configured to perform the first step on the segment to be rendered based on the depth information of the target pixel block in the global information and the depth information of the segment to be rendered. A depth test, the target pixel block is a pixel block among the plurality of pixel blocks that overlaps with the segment to be rendered, and the global depth information includes the depth of the plurality of pixel blocks updated based on all primitives to be rendered. information.

In a possible implementation, the device further includes a coarse-grained depth cache module configured to cache the global depth information.

In a possible implementation, the device further includes a partition pipeline, which is provided with a coarse-grained rasterizer and a partitioned coarse-grained depth testing module; the coarse-grained rasterizer is used to convert the input into the The primitives to be rendered in the partition pipeline are projected to multiple pixel blocks to generate multiple projection areas, and the multiple projection areas correspond to the multiple pixel blocks one-to-one; the partition coarse-grained depth test module is used to generate multiple projection areas according to the multiple pixel blocks. A projection area is used to perform a second depth test on the primitive to be rendered.

In a possible implementation, the partitioned coarse-grained depth testing module is also configured to update global depth information based on the multiple projection areas, where the global depth information includes multiple depth information updated based on all primitives to be rendered. Depth information for pixel blocks.

Users can input the scene of the rendering pipeline in order of depth value from small to large in the fragment, and turn off the rendering coarse-grained depth test module in the rendering pipeline to reduce the amount of data processing in the rendering process.

Users can turn off all depth testing modules in the rendering pipeline (i.e. rendering coarse-grained depth testing module, pre-depth testing module and post-depth testing module) in scenes that do not involve depth (such as plane scenes, 2D scenes, etc.) to make the data to be rendered Directly enter the pixel shader for shading rendering to reduce the amount of data processing during the rendering process.

Users can turn off the post-depth test module in scenes where the depth value of the fragment is not affected by the pixel shader (that is, the depth value of the fragment does not change before and after pixel shader rendering) to reduce the amount of data processing in the rendering process.

Users can use this method in a scene where the depth value of a fragment is affected by the pixel shader (that is, the depth value of the fragment will change before and after the pixel shader is rendered) and the direction of change of the depth value of the fragment is not fixed (for example, the depth value of some fragments is changing during operation). The depth value of another part of the fragment increases after color rendering, and the depth value of another part of the fragment decreases after color rendering). Turn off the front depth test module to reduce the amount of data processing in the rendering process.

In a third aspect, this application also provides an image processing method, which method includes: first converting primitives input into the rendering pipeline into fragments to be rendered. Then, a first depth test is performed on the segment to be rendered according to the global depth information, and then if the segment to be rendered fails the first depth test, the segment to be rendered is eliminated. Wherein, the global depth information includes depth information of multiple pixel blocks updated based on all primitives to be rendered.

In a possible implementation, the global depth information includes depth information of multiple pixel blocks, and performing a first depth test on the fragment to be rendered based on the global depth information includes: based on the depth information of the target pixel block The first depth test is performed on the segment to be rendered using the depth information of the segment to be rendered, and the target pixel block is a pixel block among the plurality of pixel blocks that overlaps with the segment to be rendered.

In a possible implementation, performing the first depth test on the fragment to be rendered based on the depth information of the target pixel block and the depth information of the fragment to be rendered includes: If the depth value is greater than the depth value of the target pixel block, it is determined that the fragment to be rendered fails the first depth test.

In a possible implementation, the target pixel block includes a target area, the depth value of the target pixel block includes a first depth value and a second depth value, and the first depth value is the maximum depth value of the target area. Depth value, the second depth value is the maximum depth value of the non-target area in the target pixel block.

Alternatively, a block of pixels (such as a target block of pixels) may include a target area. The depth information of the pixel block may include the maximum depth value of the target area of the pixel block, the maximum depth value of the non-target area of the pixel block, and the range of the target area of the pixel block.

Optionally, the depth information of a fragment (eg, a fragment to be rendered) may include a depth value of the fragment. Among them, the depth value of the fragment can be obtained through interpolation.

In a possible implementation, the method further includes: projecting the primitives to be rendered in the input partition pipeline to multiple pixel blocks to generate multiple projection areas, and the multiple projection areas are one by one with the multiple pixel blocks. Correspondingly: perform a second depth test on the primitive to be rendered according to the plurality of projection areas; if the primitive to be rendered fails the second depth test, remove the primitive to be rendered.

In a possible implementation, performing a second depth test on the primitive to be rendered based on the multiple projection areas includes: determining based on the depth information of the first pixel block and the depth information of the first projection area. Whether the primitive to be rendered passes the depth test in the first pixel block, the first pixel block is any pixel block among the plurality of pixel blocks, and the first projection area is the first The projection area corresponding to the pixel block; if the primitive to be rendered passes the depth test in the first pixel block, it is determined that the primitive to be rendered passes the second depth test; if the primitive to be rendered is in If none of the plurality of pixel blocks passes the depth test, it is determined that the primitive to be rendered fails the second depth test.

Optionally, the depth information of the projection area (such as the first projection area) may include a maximum depth value of the projection area, a minimum depth value of the projection area, and a range of the projection area.

In a possible implementation, determining whether the primitive to be rendered passes the depth test in the first pixel block based on the depth information of the first pixel block and the depth information of the first projection area includes: If the minimum depth value of the first projection area is less than the depth value of the first pixel block, it is determined that the primitive to be rendered passes the depth test in the first pixel block.

In a possible implementation, the first pixel block includes a target area, and the depth value of the first pixel block includes a maximum depth value of the target area of the first pixel block and a depth value of the first pixel block. Maximum depth value for non-target areas.

In a possible implementation, the method further includes: updating the global depth information according to the multiple projection areas.

In a possible implementation, updating the global depth information according to the multiple projection areas includes: updating the global depth information according to the depth information of the first pixel block and the depth information of the first projection area. Depth information of the first pixel block, the first pixel block is any pixel block among the plurality of pixel blocks, and the first projection area is the projection area corresponding to the first pixel block.

In a possible implementation, updating the depth information of the first pixel block in the global depth information according to the depth information of the first pixel block and the depth information of the first projection area includes: The maximum depth value of a projection area, the maximum depth value of the target area of the first pixel block, the maximum depth value of the non-target area of the first pixel block are used to update the depth information of the first pixel block.

In a possible implementation, the method further includes: performing a pre-depth test on the fragments that pass the first depth test.

In another possible implementation, the method further includes: performing a post-depth test on the fragments that pass the first depth test.

In yet another possible implementation, the method further includes: performing a pre-depth test and a post-depth test on the fragments that pass the first depth test.

In a fourth aspect, this application also provides a graphics processor, which includes the electronic device described in the above aspects or any possible implementation thereof, and is used to implement the above aspects or any possible implementation thereof. The method described in the implementation.

In a fifth aspect, the present application also provides an electronic device, which includes a memory, at least one processor, a transceiver, and instructions stored on the memory and executable on the processor. Further, the memory, the processor and the communication interface communicate with each other through internal connection paths. The at least one processor executes the instruction so that the image processing apparatus implements the method described in the above aspects or any possible implementation manner thereof.

For example, the electronic device is a mobile phone.

In a sixth aspect, the present application also provides a computer-readable storage medium for storing a computer program. The computer program includes methods for implementing the above aspects or any possible implementation manner thereof.

In a seventh aspect, the present application also provides a computer program product containing instructions that, when run on a computer, causes the computer to implement the methods described in each of the above aspects or any possible implementation thereof.

The image processing method, image processing device, graphics processor, electronic equipment, computer storage medium and computer program product provided by this embodiment are all used to execute the image processing method provided above. Therefore, the beneficial effects they can achieve can be Refer to the beneficial effects of the image processing method provided above, which will not be described again here.

Description of the drawings

Figure 1 is a depth schematic diagram provided by an embodiment of the present application;

Figure 2 is a schematic structural diagram of a rendering pipeline;

Figure 3 is a schematic structural diagram of an image processing device provided by an embodiment of the present application;

Figure 4 is a schematic flowchart of an image processing method provided by an embodiment of the present application;

Figure 5 is a schematic flow chart of another image processing method provided by an embodiment of the present application;

Figure 6 is a schematic diagram of a projection process provided by an embodiment of the present application;

Figure 7 is a schematic diagram of a pixel block provided by an embodiment of the present application;

Figure 8 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 9 is a schematic diagram of a depth value provided by an embodiment of the present application;

Figure 10 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 11 is a schematic diagram of another depth value provided by an embodiment of the present application;

Figure 12 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 13 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 14 is a schematic diagram of another depth value provided by an embodiment of the present application;

Figure 15 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 16 is a schematic diagram of another depth value provided by an embodiment of the present application;

Figure 17 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 18 is a schematic diagram of another depth value provided by an embodiment of the present application;

Figure 19 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 20 is a schematic diagram of a picture including pixel blocks provided by an embodiment of the present application;

Figure 21 is a schematic diagram of another pixel block provided by an embodiment of the present application;

Figure 22 is a schematic structural diagram of another image processing device provided by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the scope of protection of this application.

The term "and/or" in this application is just an association relationship describing related objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A alone exists, A and B exist simultaneously, alone There are three situations B.

The terms “first” and “second” in the description of this application and the drawings are used to distinguish different objects, or to distinguish different processes on the same object, rather than to describe a specific order of objects.

Furthermore, references to the terms "including" and "having" and any variations thereof in the description of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes other unlisted steps or units, or optionally also Includes other steps or units inherent to those processes, methods, products or devices.

It should be noted that in the description of the embodiments of this application, words such as "exemplarily" or "for example" are used to represent examples, illustrations or explanations. Any embodiment or design described as "exemplary" or "such as" in the embodiments of the present application shall not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of the words "exemplarily" or "for example" is intended to present the relevant concepts in a concrete manner.

In the description of this application, unless otherwise stated, the meaning of "plurality" means two or more.

First, some terms used in this application are explained to facilitate understanding by those skilled in the art.

Depth: used to characterize the distance between an object and the camera. As shown in Figure 1, the distance is used to represent the projection distance obtained by making a line segment based on the camera orientation.

Depth test: The process of determining whether the depth value of the data to be rendered is greater than the depth threshold.

Pre-depth testing: A depth test performed on the data (such as a fragment) before it has been rendered by a pixel shader.

Post depth test: A depth test performed on the data after it has been rendered by a pixel shader.

Primitive: The basic unit of geometric representation in the graphics rendering pipeline. The combination of geometric vertices is called a primitive (such as a point, line segment, or polygon, etc.).

Rasterization: Rasterization converts primitives into fragments, which hold information about pixels. The rasterization process determines where all pixels need to be drawn, and the rasterization process interpolates to determine the location of all pixels between two vertices. Not only does rasterization interpolate pixels, any vertex shader output variable and fragment shader input variable can be interpolated based on the corresponding pixel. Effects such as smooth color gradients and realistic lighting can be achieved through rasterization.

Partitioning stage (binning pass): Divide the screen into several areas (bins), change the perspective of all primitives that need to be rendered, and obtain the screen position of the primitive. Filter the primitives to the corresponding screen based on the screen position of the primitive. area, and finally each area (bin) is rendered independently, and only the set of primitives that fall into this area during the partitioning process are rendered. This screening process is the partitioning stage.

The GPU consumes a lot of computing resources during the rendering process. To this end, the GPU can eliminate data to be rendered that does not affect the rendering results during the rendering phase to reduce computing resource consumption.

In related technologies, depth testing can be used to eliminate data to be rendered that does not affect the rendering results. For example, in the rendering pipeline of the image processor as shown in Figure 2, the early depth test module in the rendering pipeline can perform early depth testing (earlylate-detph- test). When the depth value of the fragment is less than the depth value in the depth cache, after determining that the fragment passes the pre-depth test, the fragment is input into the pixel shader for rendering and the depth value in the depth cache is updated to the depth value of the fragment; when When the depth value of the fragment is greater than the depth value in the depth buffer, it is determined that the fragment has failed the pre-depth test and the fragment is eliminated. In some scenes, the depth value of the fragment will be affected by the pixel shader. The depth test needs to be in the pixel shader. In this case, the post-depth test mode is required to perform a post-depth test (late-detph-test).

It can be seen that in the related technology, the depth value in the depth cache is determined based on some of the fragments to be rendered that have passed the test. That is, the related technology can only use the depth information of some fragments to eliminate the fragments to be rendered during the depth test, so it cannot achieve Very high rejection rate. For example, the fragments to be rendered include fragments to be rendered 1, fragments to be rendered 2, fragments to be rendered 3, fragments to be rendered 4, and fragments to be rendered 5, and the depth values are 50, 40, 30, 20, and 10 respectively. If the depth values of these five to-be-rendered fragments are used for depth testing at the same time, only the to-be-rendered fragment 5 with the smallest depth value will pass the depth test, and the remaining four to-be-rendered fragments will be eliminated.

As shown in Table 1, when performing a depth test on the fragment to be rendered 1 through the existing technology, there is no depth value cached in the depth cache. Then the fragment 1 to be rendered passes the depth test and enters the shader for rendering. The depth value in the depth cache Updated to 50. When performing a depth test on the fragment to be rendered 2 using the existing technology, if the depth value 40 of the fragment 2 to be rendered is less than the depth value 50 in the depth cache, then the fragment 2 to be rendered passes the depth test and enters the shader for rendering. The depth value is updated to 40.

When performing a depth test on the fragment to be rendered 3 using the existing technology, if the depth value 30 of the fragment 3 to be rendered is less than the depth value 50 in the depth cache, then the fragment 3 to be rendered passes the depth test and enters the shader for rendering. The depth value is updated to 30.

When performing a depth test on the fragment to be rendered 4 through the existing technology, the depth value 20 of the fragment 4 to be rendered is less than the depth value 50 in the depth cache, then the fragment 3 to be rendered passes the depth test and enters the shader for rendering. The depth value is updated to 20.

When using the existing technology to perform a depth test on the fragment to be rendered 5, the depth value 10 of the fragment 5 to be rendered is less than the depth value 50 in the depth cache, then the fragment 3 to be rendered passes the depth test and enters the shader for rendering. The depth value is updated to 10.

It can be seen from Table 1 that the fragment to be rendered 1, the fragment to be rendered 2, the fragment to be rendered 3, the fragment to be rendered 4 and the fragment to be rendered 5 can all pass the depth test. The related technology only uses the depth information of some fragments that pass the depth test. Culling the fragments to be rendered cannot achieve a high culling rate.

Table 1

To this end, embodiments of the present application provide an image processing method that can improve the rejection rate of data to be rendered.

The image processing method provided by the embodiment of the present application is suitable for image processing devices. The image processing device may be provided in a graphics processor.

Specifically, the image processing device may be provided in a graphics processor of an electronic device. The embodiments of this application do not place any restrictions on the specific types of electronic devices. For example, the electronic device may be a mobile phone, a tablet computer, a notebook computer, an ultra-mobile personal computer (UMPC), a netbook, a personal digital assistant (PDA), etc.

For example, the image processing device may be provided in a graphics processor of a mobile phone.

Figure 3 shows a schematic block diagram of the image processing device. The image processing device includes a partition pipeline, a global depth information cache module and a rendering pipeline.

In the partition pipeline, the screen space will be divided into multiple pixel blocks (pixel blocks), and each primitive (primitive) in each CPU's graphics programming interface (draw-call) will be rasterized (rasterization). Project onto the multiple pixel blocks mentioned above. For example, the screen space can be divided into N blocks of pixels.

The partition pipeline is equipped with a coarse-grained rasterizer and a partitioned coarse-grained depth test module.

A coarse-grained rasterizer (also called a second rasterizer) is used to project primitives in the input partition pipeline (i.e. primitives to be rendered) to multiple pixel blocks to generate multiple projection areas. For example, the second rasterizer can project the primitives in the input partition pipeline into N pixel blocks to generate N projection areas. Among them, multiple pixel blocks and multiple projection areas correspond one to one.

The partitioned coarse-grained depth test module (which can also be called the second depth test module) is used to perform a partitioned coarse-grained depth test (which can also be called the second depth test) of the primitives to be rendered based on multiple projection areas. If the primitive to be rendered fails the second depth test, the primitive to be rendered is eliminated. If the primitive to be rendered fails the second depth test, then the primitive to be rendered passes the second depth test, and the primitive to be rendered is input into the rendering pipeline.

In a possible implementation, the partition pipeline can also be equipped with a polygon list generation module. The polygon list generation module is used to store the primitives to be rendered that pass the second depth test through memory, and the primitives that pass the second depth test. The primitives to be rendered for the depth test are packaged as polygon lists (PL) and input into the rendering pipeline in the form of polygon stacks (PL-Heap).

In a possible implementation, the second depth testing module can update the depth information accumulated on each pixel block during the second depth testing process, and store the depth information of each pixel block in the global depth information cache module. middle.

The global depth information cache module (which may be referred to as the first cache module) is used to cache the depth information of the above-mentioned multiple pixel blocks (which may be referred to as the global depth information). The depth information of the pixel blocks includes a pending mask (Pmask). ), pending destination z value (PZ) and original destination z value (OZ). For example, the first cache module caches global depth information, which includes depth information of multiple (eg, N) pixel blocks updated by all primitives to be rendered.

The global depth information cache module can be a cache inside the image processing device or a cache of other devices (such as a cache of a CPU).

Pmask, used to indicate the target area in the pixel block. Pmask can identify the range of the target area in the pixel block.

PZ, used to indicate the maximum depth value of the target area in the pixel block, that is, the depth values of all visible fragments in the target area of the pixel block are smaller than the PZ value.

OZ, used to indicate the maximum depth value of the non-target area in the pixel block, that is, the depth values of all visible fragments in the non-target area of the pixel block are smaller than the OZ value.

The rendering pipeline is set up with a rasterizer, a rendering coarse-grained depth test module, and a pixel shader.

A rasterizer (which may be called a first rasterizer) is used to convert primitives input into the rendering pipeline (i.e., primitives that pass the second depth test) into fragments (i.e., fragments to be rendered).

Rendering a coarse-grained depth test module (which may be called a first depth test module) is used to perform a first depth test on the fragment to be rendered based on the above-mentioned global depth information. If the fragment to be rendered fails the first depth test, the fragment to be rendered is eliminated. If the fragment to be rendered passes the first depth test, the fragment to be rendered is input into the pixel shader.

In a possible implementation, the rendering coarse-grained depth test module can also use other information to perform the first depth test on the fragment to be rendered.

A pixel shader used to shade the fragments input to the pixel shader.

In a possible implementation, the rendering pipeline may also be provided with a front depth testing module, a post depth testing module and a depth cache module.

The front depth testing module is used to perform front depth testing on the fragments to be rendered. The specific method of the front depth test can be processed by any method that can be thought of by those skilled in the art, and the embodiments of the present application do not specifically limit this.

Post-depth testing module, used to perform post-depth testing on fragments after shader rendering. The specific method of the post-depth test can be processed by any method that can be thought of by those skilled in the art, and the embodiments of the present application do not specifically limit this.

In a possible implementation, the second depth module is specifically configured to: determine whether the primitive to be rendered passes the depth test in the first pixel block according to the depth information of the first pixel block and the depth information of the first projection area. A pixel block is any pixel block among multiple pixel blocks, and the first projection area is the projection area corresponding to the first pixel block. If the primitive to be rendered passes the depth test in the first pixel block, it is determined that the primitive to be rendered passes the second depth test; if the primitive to be rendered fails the depth test in multiple pixel blocks, it is determined that the primitive to be rendered is Failed second depth test.

In a possible implementation, the second depth module is specifically configured to: when the minimum depth value of the first projection area is less than the depth value of the first pixel block, determine where the primitive to be rendered is located. The first pixel block passes the depth test.

Optionally, the depth information of the projection area (such as the first projection area) may include a maximum depth value of the projection area, a minimum depth value of the projection area, and a range of the projection area.

In a possible implementation, the first pixel block includes a target area, and the depth value of the first pixel block includes a maximum depth value of the target area of the first pixel block and a depth value of the first pixel block. The maximum depth value of the non-target area. The second depth module is specifically used for:

When both the target area and the non-target area of the first projection area overlap with the first pixel block and the minimum depth value of the first projection area is less than the first depth value or the second depth value, it is determined that the primitive to be rendered is in the first pixel The block passes the test.

In the case where the first projection area overlaps with both the target area and the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value and the second depth value, it is determined that the primitive to be rendered is in the first Failed test in one pixel block

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is less than the first depth value, it is determined that the primitive to be rendered passes the test in the first pixel block.

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value, it is determined that the primitive to be rendered fails the test in the first pixel block.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is less than the second depth value, it is determined that the primitive to be rendered passes the test in the first pixel block.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the second depth value, it is determined that the primitive to be rendered fails the test in the first pixel block.

In a possible implementation, the second depth module is also used to update global depth information according to multiple projection areas.

In a possible implementation, the second depth module is further specifically configured to: update the depth information of the first pixel block in the global depth information according to the depth information of the first pixel block and the depth information of the first projection area, the first pixel The block is any pixel block among the plurality of pixel blocks, and the first projection area is the projection area corresponding to the first pixel block.

In a possible implementation, the first pixel block includes a target area, and the second depth module is specifically configured to: based on the maximum depth value of the first projection area, the maximum depth value of the target area of the first pixel block, the first The maximum depth value of the non-target area of the pixel block updates the depth information of the first pixel block.

In a possible implementation, the second depth module is also specifically used to:

When the first projection area overlaps with both the target area and the non-target area of the first pixel block and the maximum depth value of the first projection area is less than the first depth value or the second depth value, update the depth of the first pixel block. information.

In the case where the first projection area overlaps with both the target area and the non-target area of the first pixel block and the maximum depth value of the first projection area is greater than the first depth value and the second depth value, the first pixel block is not updated. depth information.

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is less than the first depth value, the depth information of the first pixel block is updated.

When the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value, the depth information of the first pixel block is not updated.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is less than the second depth value, the depth information of the first pixel block is updated.

When the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the second depth value, the depth information of the first pixel block is not updated.

In a possible implementation, the second depth module is also specifically used to:

When the first projection area completely coincides with the target area of the first pixel block and the third depth value (ie, the maximum depth value of the projection area) is less than the first depth value, the target area of the first pixel block is updated to the target projection. area and update the first depth value of the first pixel block to the third depth value.

When the first projection area completely coincides with the non-target area of the first pixel block and the third depth value is less than the second depth value, the target area of the first pixel block is updated to the non-target projection area and the first pixel block is The second depth value is updated to the third depth value.

When the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the first condition and the second condition are met, the target area of the first pixel block is updated to the first area and the third The first depth value of a pixel block is updated to a first numerical value. Wherein, the above-mentioned first condition is that the third depth value is smaller than the first depth value but larger than the second depth value or the third depth value is smaller than the second depth value but larger than the first depth value. The second condition is that the first absolute value is less than the second absolute value. The first absolute value is the absolute value of the difference between the first depth value and the third depth value. The second absolute value is the difference between the second depth value and the third depth value. The absolute value of the difference between the above third depth values. The above-mentioned first area is the union area of the target area and the target projection area, and the first value is the larger value between the first depth value and the third depth value.

When the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the first condition and the third condition are met, the target area of the first pixel block is updated to the second area and the third The second depth value of a pixel block is updated to a second value. Wherein, the above third condition is that the first absolute value is greater than the second absolute value. The above-mentioned second area is the intersection area of the target area and the non-target projection area. The above-mentioned second value is the larger value between the second depth value and the third depth value.

In the case that the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the third depth value is smaller than the first depth value and the second depth value, the target area of the first pixel block is updated as The target projection area is to change the first depth value of the first pixel block to a third depth value, and update the second depth value of the first pixel block to a third value. The third value is the larger value between the first depth value and the second depth value.

Optionally, the target projection area (CurMask) includes a first target projection area (ie CurMask0) and a second target projection area (ie CurMask0)

In the case where the third depth value of the projection area is smaller than the second depth value of the pixel block, the first target projection area (ie CurMask0) may represent an overlapping area of the projection area and the non-target area of the pixel block.

In the case where the third depth value of the projection area is smaller than the first depth value of the pixel block, the second target projection area (ie, CurMask0) may represent an overlapping area of the projection area and the target area of the pixel block.

The target projection area (CurMask) may be the union of the first target projection area (CurMask0) and the second target projection area (CurMask0).

In a possible implementation, the first depth test module is specifically configured to: perform a first depth test on the fragment to be rendered based on the depth information of the target pixel block in the global information and the depth information of the fragment to be rendered, and the target pixel block is multiple There are pixel blocks in the pixel block that overlap with the fragment to be rendered.

In a possible implementation, the first depth testing module is specifically configured to: when the depth value of the fragment to be rendered is greater than the depth value of the target pixel block, determine that the fragment to be rendered has not passed the first depth test module. Deep testing.

Alternatively, a block of pixels (such as a target block of pixels) may include a target area. The depth information of the pixel block may include the maximum depth value of the target area of the pixel block, the maximum depth value of the non-target area of the pixel block, and the range of the target area of the pixel block.

Optionally, the depth information of a fragment (eg, a fragment to be rendered) may include a depth value of the fragment. Among them, the depth value of the fragment can be obtained through interpolation.

In a possible implementation, the target pixel block includes a target area, the depth value of the target pixel block includes a first depth value and a second depth value, and the first depth testing module is specifically used to:

When the segment to be rendered is located in the target area of the target pixel block and the depth value of the segment to be rendered is less than or equal to the first depth value, it is determined that the segment to be rendered passes the first depth test.

When the fragment to be rendered is located in the target area of the target pixel block and the depth value of the fragment to be rendered is greater than the first depth value, it is determined that the fragment to be rendered fails the first depth test.

When the fragment to be rendered is located in a non-target area of the target pixel block and the depth value of the fragment to be rendered is less than or equal to the second depth value, it is determined that the fragment to be rendered passes the first depth test.

When the fragment to be rendered is not located in the non-target area of the target pixel block and the depth value of the fragment to be rendered is greater than the second depth value, it is determined that the fragment to be rendered fails the first depth test.

As shown in Figure 3, users can turn off all depth test modules (i.e., rendering coarse-grained depth test module, pre-depth test module) in the rendering pipeline of the image processing device in scenes that do not involve depth (such as plane scenes, two-dimensional scenes, etc.) and post-depth testing module) so that the data to be rendered directly enters the pixel shader for shading rendering to reduce the amount of data processing in the rendering process.

Users can input the scene of the rendering pipeline in order of depth value from small to large in the fragment, and turn off the rendering coarse-grained depth test module in the rendering pipeline to reduce the amount of data processing in the rendering process.

Users can turn off the post-depth test module in scenes where the depth value of the fragment is not affected by the pixel shader (that is, the depth value of the fragment does not change before and after pixel shader rendering) to reduce the amount of data processing in the rendering process.

Users can use this method in a scene where the depth value of a fragment is affected by the pixel shader (that is, the depth value of the fragment will change before and after the pixel shader renders) and the direction of the change of the depth value of the fragment is not fixed (for example, the depth value of some fragments is changed during shading). increases after rendering, and the depth value of another part of the fragment decreases after shading and rendering), turn off the front depth test module to reduce the amount of data processing during the rendering process.

FIG. 4 shows a schematic flowchart of the image processing method provided by the embodiment of the present application. The method can be executed by the image processing device shown in FIG. 3 . As shown in Figure 4, the image processing method includes:

S401. The image processing device performs a second depth test on the graphics elements to be rendered that are input into the partition pipeline and eliminates the graphics elements to be rendered that fail the second depth test.

For example, taking the input partition pipeline of M primitives to be rendered as an example, the image processing device first performs the second depth test on the first primitive to be rendered, then performs the second depth test on the second primitive, and then performs the second depth test on the second primitive to be rendered. The 3rd, 4th,..., Mth primitives to be rendered are subjected to the second depth test. If the primitive to be rendered fails the second depth test, the primitive to be rendered is eliminated; if the primitive to be rendered passes the second test, the primitive to be rendered is input into the rendering pipeline.

It should be noted that if the primitive to be rendered fails the second depth test, it means that the primitive to be rendered has a higher depth and will be blocked by other primitives to be rendered. Therefore, the primitive may not be rendered, but the primitive may be eliminated. to reduce computing resource consumption.

In a possible implementation, the image processing device performing a second depth test on each primitive to be rendered may include: first projecting the primitive to be rendered to multiple pixels divided by the screen space through a coarse-grained rasterizer. The block generates multiple projection areas and then performs a second depth test on the primitive to be rendered based on the multiple projection areas. Wherein, the plurality of projection areas correspond to the plurality of pixel blocks in one-to-one correspondence.

For example, as shown in Figure 6, the screen space can be divided into 16 pixel blocks (the white area in the figure), and the image processing device can project the primitives to be rendered into these 16 pixel blocks to generate 16 pixel blocks. There are 16 projection areas in one-to-one correspondence (the black area in the picture), and then a second depth test is performed on the primitive to be rendered based on these 16 projection areas.

In a possible implementation, the image processing device may determine whether the primitive to be rendered passes the depth test in each pixel block based on the depth information of each pixel block and the depth information of the projection area corresponding to each pixel block. If the primitive to be rendered passes the depth test in any pixel block, it is determined that the primitive to be rendered passes the second depth test; if the primitive to be rendered fails the depth test in any of the plurality of pixel blocks, it is determined that the primitive to be rendered is The render primitive failed the second depth test.

For example, as shown in Figure 6, the image processing device can determine that the primitive to be rendered is in the 16 pixel blocks in Figure 6 based on the depth information of the 16 pixel blocks in Figure 6 and the depth information of the 16 projection areas in Figure 6 Whether the depth test passes in each pixel block. If the primitive to be rendered passes the depth test in any pixel block, it is determined that the primitive to be rendered passes the second depth test. If the primitive to be rendered fails the depth test in the above 16 pixel blocks, it is determined that the primitive to be rendered fails the second depth test.

Optionally, the pixel block may include a target area, and the depth information of the pixel block may include a maximum depth value of the target area of the pixel block (which may be referred to as a first depth value), and a maximum depth value of a non-target area of the pixel block (which may be referred to as a first depth value for short). is the second depth value) and the range of the target area of the pixel block.

Optionally, the depth information of the projection area may include a maximum depth value of the projection area and a minimum depth value of the projection area.

In a possible implementation, the image processing device can determine the maximum depth value of the target area of each pixel block, the maximum depth value of the non-target area of each pixel block, and the minimum depth of the projection area corresponding to each pixel block. The value determines whether the primitive to be rendered passes the depth test in each pixel block.

Figure 7 shows the pixel block and the projection area. The gray area in Figure 7 is the target area of the pixel block, the white area is the non-target area of the pixel block, and the black area is the projection area. It can be seen from Figure 7 that there are three positional relationships between pixel blocks and projection areas. Figure 7 (a) shows that the first positional relationship, that is, the projection area overlaps with both the target area and the non-target area of the pixel block; Figure 7(b) shows the second positional relationship, that is, the projection area. There is only overlap with the target area of the pixel block; (c) in Figure 7 shows the third positional relationship, that is, the projection area only overlaps with the non-target area of the pixel block.

With reference to FIG. 7 , taking the first pixel block and the first projection area as an example, the following describes how the image processing device determines the maximum depth value of the target area of each pixel block, the maximum depth value of the non-target area of each pixel block, and the maximum depth value of each pixel block. The minimum depth value of the projection area corresponding to each pixel block determines whether the primitive to be rendered passes the depth test in each pixel block. Wherein, the first pixel block is any pixel block among the plurality of pixel blocks, and the first projection area is the projection area corresponding to the first pixel block.

As shown in (a) of Figure 7 , there is overlap between the target area and the non-target area of the first projection area and the first pixel block, and the minimum depth value of the first projection area is smaller than the first depth value or the second depth value. In the case of , it is determined that the primitive to be rendered passes the depth test in the first pixel block.

As shown in (a) of Figure 7 , there is overlap between the target area and the non-target area of the first projection area and the first pixel block, and the minimum depth value of the first projection area is greater than the first depth value and the second depth value. In the case of , it is determined that the primitive to be rendered fails the depth test in the first pixel block.

As shown in (b) of Figure 7 , in the case where the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is less than the first depth value, the primitive to be rendered is determined Pass the depth test in the first block of pixels.

As shown in (b) of Figure 7 , in the case where the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value, the primitive to be rendered is determined Depth test failed in first block of pixels.

As shown in (c) of Figure 7 , in the case where the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is less than the second depth value, the image to be rendered is determined The element passes the depth test in the first block of pixels.

As shown in (c) of Figure 7, in the case where the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the second depth value, the primitive to be rendered is determined The depth fails the test in the first block of pixels.

In a possible implementation, the image processing device can also update the global depth information according to the multiple projection areas. Among them, the global depth information includes the depth information of multiple pixel blocks divided by the screen space. For example, the image processing device may update the depth information of each pixel block in the global depth information based on the depth information of each pixel block (current depth information) and the depth information of the projection area corresponding to each pixel block.

With reference to FIG. 7 , taking the first projection area and the first pixel block as an example, the following describes how the image processing device determines the maximum depth value of the first projection area and the maximum depth value of the target area of the first pixel block (i.e., the first depth value). ), the maximum depth value of the non-target area of the first pixel block (ie, the second depth value), and the specific process of updating the depth information of the first pixel block.

As shown in (a) of Figure 7 , there is overlap between the target area and the non-target area of the first projection area and the first pixel block, and the maximum depth value of the first projection area is smaller than the first depth value or the second depth value. In the case of , update the depth information of the first pixel block.

As shown in (a) of Figure 7 , there is overlap between the target area and the non-target area of the first projection area and the first pixel block, and the maximum depth value of the first projection area is greater than the first depth value and the second depth value. In the case of , the depth information of the first pixel block is not updated.

As shown in (b) of Figure 7 , when the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is less than the first depth value, the first pixel block is updated. depth information.

As shown in (b) of Figure 7 , when the first projection area only overlaps with the target area of the first pixel block and the minimum depth value of the first projection area is greater than the first depth value, the first pixel is not updated. Block depth information.

As shown in (c) of Figure 7 , when the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is less than the second depth value, the first pixel is updated. Block depth information.

As shown in (c) of Figure 7 , when the first projection area only overlaps with the non-target area of the first pixel block and the minimum depth value of the first projection area is greater than the second depth value, the first projection area is not updated. Depth information for pixel blocks.

In a possible implementation, the image processing device may update the depth information of the first pixel block according to the target area. The target projection area (CurMask) includes a first target projection area (ie, CurMask0) and a second target projection area (ie, CurMask0).

CurMask0: In the overlapping area between the projection area of the primitive to be rendered and the non-target area of the pixel block (also called the OZ area), if the maximum depth of the projection area (can be called the third depth value, or simply Zmax ) is less than the maximum depth value of the non-target area of the pixel block (that is, the second depth value, which can be referred to as OZ), then the depth values of all visible fragments of the pixel block in the above overlapping area must be smaller than the Zmax value (otherwise the image will be element occlusion), then the OZ value of the pixel block is conditionally updated to the Zmax value of the projection area of the primitive to be rendered. In this case, the CurMask0 mask can be used to represent the coverage of this part of the area. That is, in the case where the third depth value of the projection area is smaller than the second depth value of the pixel block, CurMask0 may represent an overlapping area of the projection area and the non-target area of the pixel block.

CurMask1: In the overlapping area between the projection area of the primitive to be rendered and the target area of the pixel block (also called the PZ area), if the maximum depth of the projection area is less than the maximum depth value of the target area of the pixel block (i.e. the first depth value, which can be abbreviated as PZ), then the depth values of all visible fragments of the pixel block in the above overlapping area must be smaller than the Zmax value (otherwise they will be obscured by the primitive), then the PZ value of the pixel block is conditionally updated to The Zmax value of the projected area of the primitive to be rendered. In this case, the CurMask1 mask can be used to represent the coverage of this part of the area. That is, in the case where the third depth value of the projection area is smaller than the first depth value of the pixel block, CurMask1 may represent the overlapping area of the projection area and the target area of the pixel block.

CurMask: The union of CurMask0 and CurMask1.

layer0Mask: Represents the area in the original OZ area (that is, the OZ area before update) that is not indicated by CurMask0.

layer1Mask: represents the area in the original PZ area (that is, the PZ area before update) that is not indicated by CurMask1.

Specifically, the image processing device updates the depth information of the first pixel block, which may include:

When the first projection area completely coincides with the target area of the first pixel block and the third depth value (ie, the maximum depth value of the projection area) is less than the first depth value, the target area of the first pixel block is updated to the target projection. area and update the first depth value of the first pixel block to the third depth value.

Exemplarily, (a) in Figure 8 shows the target area (gray area) and non-target area (white area) before the first pixel block is updated, and (b) in Figure 8 shows the first projection area (black area) and the first pixel block. It can be seen from Figure 8(b) that the first projection area completely overlaps with the target area of the first pixel block. (a) in Figure 9 shows the first depth value (PZ), the second depth value (OZ) and the depth range of the first projection area. The horizontal axis in Figure 9 represents the depth value, and the depth value increases from left to right. . It can be seen from Figure 9(a) that the maximum depth value (Zmax) of the first projection area is smaller than the first depth value (PZ) and the second depth value (OZ), so the target projection area includes the entire first projection area. Correspondingly, as shown in (c) of FIG. 8 , the image processing device updates the target area of the first pixel block to the target projection area. As shown in (b) of FIG. 9 , the image processing device updates the first depth value (PZ) of the first pixel block to the third depth value (Zmax).

When the first projection area completely coincides with the non-target area of the first pixel block and the third depth value is less than the second depth value, the target area of the first pixel block is updated to the non-target projection area and the first pixel block is The second depth value is updated to the third depth value.

For example, with reference to Figures (a) and (b) in Figure 10, it can be seen that the first projection area completely coincides with the non-target area of the first pixel block. Referring to Figure 11 (a), it can be seen that the third depth value is smaller than the second depth value but larger than the first depth value, then the target projection area includes the overlapping area of the first projection area and the non-target area of the first pixel block ( i.e. the entire non-target area). As shown in (c) of FIG. 8 , since the non-target projection area is the same as the target area of the first pixel block, the image processing device does not update the target area. As shown in (b) of FIG. 11 , the image processing device updates the second depth value (OZ) of the first pixel block to the third depth value (Zmax).

As another example, with reference to pictures (a) and (b) in FIG. 12 , it can be seen that the first projection area completely coincides with the non-target area of the first pixel block. If the maximum depth value (Zmax) of the first projection area is smaller than the first depth value (PZ) and the second depth value (OZ), then the target projection area includes the entire first projection area. Then, as shown in (c) of Figure 12, the image processing device updates the target area of the first pixel block to the non-target projection area (that is, the area in the first pixel block that does not overlap with the first projection area) and adds the first The second depth value (OZ) of the pixel block is updated to the third depth value (Zmax).

When the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the first condition and the second condition are met, the target area of the first pixel block is updated to the first area and the third The first depth value of a pixel block is updated to a first numerical value. Wherein, the above-mentioned first condition is that the third depth value is smaller than the first depth value but larger than the second depth value or the third depth value is smaller than the second depth value but larger than the first depth value. The second condition is that the first absolute value is less than the second absolute value. The first absolute value is the absolute value of the difference between the first depth value and the third depth value. The second absolute value is the difference between the second depth value and the third depth value. The absolute value of the difference between the above third depth values. The above-mentioned first area is the union area of the target area and the target projection area, and the first value is the larger value between the first depth value and the third depth value.

It should be noted that satisfying the first condition and the second condition means that the third depth value is between the first depth value and the second depth value, and the third depth value is closer to the first depth value.

As another example, with reference to pictures (a) and (b) in FIG. 13 , it can be seen that the first projection area does not completely coincide with the target area and the non-target area of the first pixel block. Referring to Figure 14(a), it can be seen that the third depth value (Zmax) is between the first depth value (PZ) and the second depth value (OZ), and the third depth value is closer to the first depth value. Since the third depth value is smaller than the second depth value but larger than the first depth value, the target projection area only includes the overlapping area of the first projection area and the non-target area, and the first area includes the target projection area and the current target area. As shown in (c) of FIG. 13 , the image processing device updates the target area of the first pixel block to the first area. Since the third depth value is greater than the first depth value, the first value is the third depth value. As shown in (b) of FIG. 14 , the image processing device updates the first depth value (PZ) of the first pixel block to the third depth value (Zmax).

When the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the first condition and the third condition are met, the target area of the first pixel block is updated to the second area and the third The second depth value of a pixel block is updated to a second value. Wherein, the above third condition is that the first absolute value is greater than the second absolute value. The above-mentioned second area is the intersection area of the target area and the non-target projection area. The above-mentioned second value is the larger value between the second depth value and the third depth value.

It should be noted that satisfying the first condition and the third condition means that the third depth value is between the first depth value and the second depth value, and the third depth value is closer to the second depth value.

As another example, with reference to pictures (a) and (b) in FIG. 15 , it can be seen that the first projection area does not completely coincide with the target area and the non-target area of the first pixel block. Referring to (a) in FIG. 16 , it can be seen that the third depth (Zmax) value is between the first depth value (PZ) and the second depth value (OZ), and the third depth value is closer to the second depth value. Since the third depth value is smaller than the second depth value but larger than the first depth value, the target projection area only includes an overlapping area of the first projection area and the non-target area. The second area includes the intersection area of the non-target projection area and the current target area. As shown in (c) of Figure 15, since the second area is the same as the current target area, the image processing device does not update the target area. Since the second depth value is greater than the third depth value, the second value is the second depth value. As shown in (b) of FIG. 16 , since the second value is the same as the current second depth value (OZ), the image processing device does not update the second depth value (OZ).

In the case that the first projection area does not completely coincide with the target area and the non-target area of the first pixel block and the third depth value is smaller than the first depth value and the second depth value, the target area of the first pixel block is updated as The target projection area is to change the first depth value of the first pixel block to a third depth value, and update the second depth value of the first pixel block to a third value. The third value is the larger value between the first depth value and the second depth value.

As another example, with reference to pictures (a) and (b) in FIG. 17 , it can be seen that the first projection area does not completely coincide with the target area and the non-target area of the first pixel block. Referring to (a) in FIG. 18 , it can be seen that the third depth value (Zmax) is smaller than the first depth value (PZ) and the second depth value (OZ). Since the third depth value is smaller than the first depth value and the second depth value, the target projection area includes the entire first projection area. As shown in (c) of FIG. 17 , the image processing device updates the target area of the first pixel block to the target projection area, that is, the entire first projection area. Since the first depth value is smaller than the second depth value, the third value is the second depth value. As shown in (a) of FIG. 18 , the image processing device updates the first depth value of the first pixel block to the third depth value. In addition, since the current second depth value of the first pixel block is the same as the third value, the image processing device does not update the second depth value of the first pixel block.

Alternatively, the image processing device may store the primitives to be rendered that pass the second depth test in polygon list generation (polygon list generation) in the partition pipeline.

S402. The image processing device inputs the graphics elements to be rendered that have passed the second depth test into the rendering pipeline.

For example, taking the K to-be-rendered primitives among the M to-be-rendered primitives input into the partition pipeline to pass the second depth test, the polygon list generation in the image processing device can pass the second depth test. The primitives to be rendered are packed into multiple polygon lists (PL), and then input into the rendering pipeline in the form of polygon stacks (PL-Heap).

S403. The image processing device converts the primitives input into the rendering pipeline into fragments to be rendered.

For example, the image processing device may convert primitives input to the rendering pipeline (ie, primitives that pass the second depth test) into fragments to be rendered through a rasterizer in the rendering pipeline.

The above-mentioned specific method of converting graphics elements into fragments can be processed by any method that can be thought of by those skilled in the art, and this is not specifically limited in the embodiments of the present application.

S404. The image processing device performs a first depth test on the segments to be rendered and eliminates the segments to be rendered that fail the first depth test.

In a possible implementation, the image processing device may perform a first depth test on the segment to be rendered based on the global depth information in the global depth information cache module.

Specifically, the image processing device may perform a first depth test on the segment to be rendered based on the depth information of the target pixel block in the global depth information and the depth information of the segment to be rendered. The target pixel block is a pixel block among multiple pixel blocks that overlaps with the segment to be rendered.

For example, Figure 19 shows 9 pixel blocks and 1 fragment to be rendered (black square in the figure). It can be seen that the pixel block in the upper left corner overlaps with the fragment to be rendered. The image processing device performs a first depth test on the segment to be rendered based on the depth information of the pixel block in the upper left corner of the global depth information and the depth information of the segment to be rendered.

Alternatively, the depth information of the fragment may include a depth value of the fragment. Among them, the depth value of the fragment can be obtained through interpolation.

In a possible implementation, the image processing device performs a first depth test on the fragment to be rendered based on the depth value, the first depth value or the second depth value of the fragment to be rendered.

In a possible implementation, the image processing device may perform a first depth test on the fragment to be rendered based on the depth value, the first depth value, or the second depth value of the fragment to be rendered, which may include:

The image processing device determines that the segment to be rendered passes the first depth test when the segment to be rendered is located within the target area of the target pixel block and the depth value of the segment to be rendered is less than or equal to the first depth value.

The image processing device determines that the segment to be rendered fails the first depth test when the segment to be rendered is located within the target area of the target pixel block and the depth value of the segment to be rendered is greater than the first depth value.

The image processing device determines that the segment to be rendered passes the first depth test when the segment to be rendered is not located in the target area of the target pixel block and the depth value of the segment to be rendered is less than or equal to the second depth value.

The image processing device determines that the segment to be rendered fails the first depth test when the segment to be rendered is not located in the target area of the target pixel block and the depth value of the segment to be rendered is greater than the second depth value.

It should be noted that the fragment to be rendered is located in the target area of the target pixel block and the depth value of the fragment to be rendered is greater than the first depth value, indicating that the fragment to be rendered will be occluded by the visible fragments in the target area of the target pixel block, so it can Eliminate the fragment to be rendered to reduce the consumption of computing resources and increase the rendering speed of the GPU.

The fragment to be rendered is located in the target area of the non-target pixel block and the depth value of the fragment to be rendered is greater than the second depth value, indicating that the fragment to be rendered will be obscured by the visible fragments in the non-target area of the target pixel block, so the fragment to be rendered can be Eliminate rendering fragments to reduce computing resource consumption and increase GPU rendering speed.

For example, taking a 4x4 pixel block located in the left frame in the picture shown in Figure 20 as an example, it can be seen that the objects rendered in this pixel block include the sky, the roof, and a triangle. The gray area shown in (a) of Figure 21 is the target area of the pixel block, and the black area is the non-target area of the pixel block. In the global depth information, the maximum depth value (PZ) of the target area of the pixel block is 0.1, and the maximum depth value (OZ) of the non-target area is 1.0. After rasterizing the triangle, it can be seen from the picture (b) in Figure 21 that the two fragments of the triangle (that is, the white squares in the picture) are located in the target area. It can be seen from the picture (c) in Figure 21 The two segments of the triangle (the light gray squares in the figure) are located in the non-target area. As shown in (d) of Figure 21, since the interpolated depth values of the two fragments located in the target area are greater than the PZ, the two fragments located in the target area will be eliminated; while the two fragments located in the non-target area are interpolated. The depth value is smaller than OZ, so the two fragments located in the non-target area will not be culled, but will be input to the pixel shader for rendering.

It can be seen that the method provided by the embodiment of the present application can eliminate the fragments to be rendered through the global depth information. Since the global depth information is determined based on all the primitives to be rendered, and the fragments to be rendered are converted from the primitives to be rendered, so Global depth information is equivalent to being generated based on all fragments to be rendered. The embodiment of the present application uses the depth information of all the fragments to be rendered to eliminate fragments. Compared with the related technology, which only uses the depth information of some fragments to be rendered to eliminate fragments, the elimination rate of the data to be rendered can be improved, thereby reducing the consumption of computing resources. To improve the rendering speed of GPU.

S405. The image processing device inputs the fragment to be rendered that passes the first depth test into the pixel shader.

In a possible implementation, the image processing device may first perform a front-depth test on the to-be-rendered fragments that pass the first depth test through a front-depth test module, and then input the to-be-rendered fragments that pass the front-depth test into the pixel shader.

S406. The image processing device performs coloring and rendering on the fragments input to the pixel shader.

The above-mentioned specific method of shading and rendering can be processed by any method that can be thought of by those skilled in the art, and the embodiments of the present application do not specifically limit this.

In a possible implementation, the image processing device can perform a post-depth test on the rendered fragments through a post-depth test module.

FIG. 5 shows a schematic flowchart of another image processing method provided by an embodiment of the present application. This method can be executed by the image processing device shown in FIG. 3 . As shown in Figure 5, the image processing method includes:

S501. The image processing device converts the primitives input into the rendering pipeline into fragments to be rendered.

S502. The image processing device performs the first depth test on the fragment to be rendered based on the global depth information.

The global depth information includes depth information of multiple pixel blocks updated based on all primitives to be rendered.

It should be noted that the specific implementation of S502 may refer to the description of S404 above, and will not be described again here.

S503. If the segment to be rendered fails the first depth test, the image processing device eliminates the segment to be rendered.

Embodiments of the present application also provide a computer storage medium. Computer instructions are stored in the computer storage medium. When the computer instructions are run on an image processing device, the image processing device executes the above related method steps to realize the image in the above embodiment. Approach.

An embodiment of the present application also provides a computer program product. When the computer program product is run on a computer, it causes the computer to perform the above related steps to implement the image processing method in the above embodiment.

An embodiment of the present application also provides an image processing device, which may be a chip, an integrated circuit, a component or a module. Specifically, the device may include a connected processor and a memory for storing instructions, or the device may include at least one processor for retrieving instructions from an external memory. When the device is running, the processor can execute instructions to cause the chip to execute the image processing method in each of the above method embodiments.

Please refer to FIG. 22 , which is a schematic structural diagram of another image processing device provided by an embodiment of the present application. The image processing device 2000 includes: at least one CPU, GPU, and memory. The types of memory may include, for example, SRAM and ROM, a microcontroller unit (Micro controller Unit, MCU), a WLAN subsystem, a bus, a transmission interface, and the like. Although not shown in Figure 22, the image processing device 2000 may also include an application processor (Application Processor, AP), NPU and other dedicated processors, as well as a power management subsystem, a clock management subsystem, a power consumption management subsystem, etc. other subsystems.

The above-mentioned parts of the image processing device 2000 are coupled through connectors. For example, connectors include various types of interfaces, transmission lines or buses, etc. These interfaces are usually electrical communication interfaces, but they may also be mechanical interfaces or other forms of interfaces. , this embodiment does not limit this.

Optionally, the CPU can be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor; optionally, the CPU can be a processor group composed of multiple processors. Coupled to each other via one or more buses. In an optional situation, the CPU implements any of the image processing methods in the above method embodiments by calling program instructions stored in the above-mentioned on-chip memory or off-chip memory. In an optional situation, the CPU and the MCU jointly implement any of the image processing methods in the above method embodiments. For example, the CPU completes some steps in the image processing method, and the MCU completes other steps in the image processing method. In an optional situation, the AP or other special-purpose processor implements any of the image processing methods in the above method embodiments by calling program instructions stored in the above-mentioned on-chip memory or off-chip memory.

The transmission interface may be an interface for receiving and sending data of the processor chip. The transmission interface usually includes a variety of interfaces. In an optional case, the transmission interface may include an internal integrated circuit (Inter-Integrated Circuit, I2C). interface, Serial Peripheral Interface (SPI), Universal asynchronous receiver-transmitter (UART) interface, General-purpose input/output (GPIO) interface, etc. It should be understood that these interfaces can implement different functions by reusing the same physical interface.

In an optional case, the transmission interface may also include a High Definition Multimedia Interface (HDMI), a V-By-One interface, an embedded display port (Embedded Display Port, eDP), and a mobile industry processing interface. Mobile Industry Processor Interface (MIPI) or Display Port (DP), etc.

In an optional situation, the above-mentioned parts are integrated on the same chip; in another optional situation, the memory can be an independent chip.

A WLAN subsystem may include radio frequency circuitry and baseband, for example.

The chip involved in the embodiment of the present application is a system manufactured on the same semiconductor substrate using an integrated circuit process, also called a semiconductor chip. It can be manufactured using an integrated circuit process on a substrate (usually a semiconductor such as silicon). A collection of integrated circuits formed on a semiconductor packaging material, the outer layer of which is usually encapsulated by a semiconductor packaging material. The above-mentioned integrated circuits may include various types of functional devices. Each type of functional devices may include logic gate circuits, metal-oxide-semiconductor (MOS) transistors, bipolar transistors or diodes, and may also include capacitors, resistors or transistors. Inductors and other components. Each functional device can work independently or with the help of necessary driver software, and can realize various functions such as communication, computing or storage.

Among them, the image processing device, computer storage medium and computer program product provided by this embodiment are all used to execute the corresponding method provided above. Therefore, the beneficial effects that can be achieved can be referred to the corresponding method provided above. The beneficial effects will not be repeated here.

It should be understood that in the various embodiments of the present application, the size of the sequence numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its functions and internal logic, and should not be used in the embodiments of the present application. The implementation process constitutes any limitation.

Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in this application can be implemented with electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each specific application, but such implementations should not be considered beyond the scope of this application.

Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the systems, devices and units described above can be referred to the corresponding processes in the above method embodiments, and will not be described again here.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the above units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or may be Integrated into another system, or some features can be ignored, or not implemented. On the other hand, the coupling or direct coupling or communication connection between each other shown or discussed may be through some interfaces, indirect coupling or communication connection of devices or units, which may be in electrical, mechanical or other forms.

The units described above as separate components may or may not be physically separated. The components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application can be integrated into one processing unit, each unit can exist physically alone, or two or more units can be integrated into one unit.

If the above functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the above methods in various embodiments of the present application. The above-mentioned storage media include: U disk, mobile hard disk, read only memory (Read Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application. should be covered by the protection scope of this application. Therefore, the protection scope of this application should be determined by the protection scope of the claims.

Claims (33)

An image processing device, characterized by comprising: a rendering pipeline, in which a first rasterizer and a first depth test module are provided; The first rasterizer is used to convert primitives input into the rendering pipeline into fragments to be rendered; The first depth test module is used to perform a first depth test on the fragment to be rendered according to global depth information; If the segment to be rendered fails the first depth test, the segment to be rendered is eliminated, and the global depth information includes depth information of multiple pixel blocks updated based on all primitives to be rendered. The device according to claim 1, characterized in that the first depth testing module is specifically used for: The first depth test is performed on the segment to be rendered according to the depth information of the target pixel block in the global information and the depth information of the segment to be rendered. The target pixel block is the same as the target pixel block in the plurality of pixel blocks. The fragment to be rendered has overlapping pixel blocks. The device according to claim 2, characterized in that the first depth testing module is specifically used for: If the depth value of the fragment to be rendered is greater than the depth value of the target pixel block, it is determined that the fragment to be rendered fails the first depth test. The device according to claim 3, wherein the target pixel block includes a target area, the depth value of the target pixel block includes a first depth value and a second depth value, and the first depth value is the The maximum depth value of the target area, and the second depth value is the maximum depth value of the non-target area in the target pixel block. The device according to any one of claims 1 to 4, characterized in that the device further includes a first cache module, the first cache module being used to cache the global depth information. The device according to any one of claims 1 to 5, characterized in that the device further includes: a partition pipeline, and a second rasterizer and a second depth test module are provided in the partition pipeline: The second rasterizer is used to project the primitives to be rendered input into the partition pipeline to multiple pixel blocks to generate multiple projection areas, and the multiple projection areas correspond to the multiple pixel blocks in one-to-one correspondence; The second depth module is used to perform a second depth test on the primitive to be rendered according to the multiple projection areas; If the primitive to be rendered fails the second depth test, the primitive to be rendered is eliminated. The device according to claim 6, wherein the second depth module is specifically used for: Determine whether the primitive to be rendered passes the depth test in the first pixel block according to the depth information of the first pixel block and the depth information of the first projection area. The first pixel block is one of the plurality of pixel blocks. For any pixel block, the first projection area is the projection area corresponding to the first pixel block; If the primitive to be rendered passes the depth test in the first pixel block, it is determined that the primitive to be rendered passes the second depth test; If the primitive to be rendered fails the depth test in the plurality of pixel blocks, it is determined that the primitive to be rendered fails the second depth test. The device according to claim 7, characterized in that the second depth module is specifically used for: If the minimum depth value of the first projection area is less than the depth value of the first pixel block, it is determined that the primitive to be rendered passes the depth test in the first pixel block. The device of claim 8, wherein the first pixel block includes a target area, and the depth value of the first pixel block includes a maximum depth value of the target area of the first pixel block and the third pixel block. The maximum depth value of the non-target area of a pixel block. The device according to any one of claims 6 to 9, wherein the second depth module is further configured to update the global depth information according to the plurality of projection areas. The device according to claim 10, characterized in that the second depth module is further specifically used for: The depth information of the first pixel block in the global depth information is updated according to the depth information of the first pixel block and the depth information of the first projection area, and the first pixel block is any one of the plurality of pixel blocks. Pixel block, the first projection area is the projection area corresponding to the first pixel block. The device according to claim 11, wherein the first pixel block includes a target area, and the second depth module is further configured to: Update the depth of the first pixel block according to the maximum depth value of the first projection area, the maximum depth value of the target area of the first pixel block, and the maximum depth value of the non-target area of the first pixel block information. The device according to any one of claims 1 to 12, wherein the rendering pipeline is further provided with at least one of a front depth module, a pixel shader, a back depth test module or a depth cache module; The front depth test module is configured to perform a front depth test on the first target fragment according to the depth value in the depth cache module, and the first target fragment is a fragment that passes the first depth test; The pixel shader is used to shade and render a second target fragment, which is a fragment that passes the front depth test; The post-depth test module is configured to perform a post-depth test based on a third target fragment of the depth value in the depth cache module, where the third target fragment is a fragment rendered by the pixel shader; The depth cache module is used to cache depth values. An image processing device, characterized by comprising: a rendering pipeline, which is provided with a rasterizer, a rendering coarse-grained depth test module, a front depth test module, a pixel shader, a depth cache module and a post depth test module ; The rasterizer is used to convert primitives input into the rendering pipeline into fragments to be rendered; The rendering coarse-grained depth test module is used to perform a first depth test on the fragment to be rendered; The front depth test module is configured to perform a front depth test on the first target fragment according to the depth value in the depth cache module, and the first target fragment is a fragment that passes the first depth test; The pixel shader is used to shade and render a second target fragment, which is a fragment that passes the front depth test; The post-depth test module is configured to perform a post-depth test on a third target fragment based on the depth value in the depth cache module, where the third target fragment is a fragment rendered by the pixel shader; The depth cache module is used to cache depth values. The device according to claim 14, wherein the rendering coarse-grained depth testing module is specifically used for: The first depth test is performed on the segment to be rendered according to the depth information of the target pixel block in the global information and the depth information of the segment to be rendered. The target pixel block is the same among the plurality of pixel blocks as the segment to be rendered. There are overlapping pixel blocks in the rendering fragment, and the global depth information includes depth information of multiple pixel blocks updated based on all primitives to be rendered. The device of claim 15, further comprising a coarse-grained depth cache module configured to cache the global depth information. The device according to any one of claims 14 to 16, characterized in that the device further includes a partition pipeline, the partition pipeline is provided with a coarse-grained rasterizer and a partitioned coarse-grained depth test module; The coarse-grained rasterizer is used to project the primitives to be rendered input into the partition pipeline to multiple pixel blocks to generate multiple projection areas, and the multiple projection areas correspond to the multiple pixel blocks in one-to-one correspondence; The partitioned coarse-grained depth test module is used to perform a second depth test on the primitive to be rendered according to the plurality of projection areas. The device according to claim 17, characterized in that the partition coarse-grained depth testing module is also used to: Global depth information is updated according to the plurality of projection areas, and the global depth information includes depth information of a plurality of pixel blocks updated according to all primitives to be rendered. An image processing method, characterized by including: Convert primitives input to the rendering pipeline into fragments to be rendered; Perform a first depth test on the fragment to be rendered based on global depth information, where the global depth information includes depth information of multiple pixel blocks updated based on all primitives to be rendered; If the segment to be rendered fails the first depth test, the segment to be rendered is eliminated. The method of claim 19, wherein the global depth information includes depth information of multiple pixel blocks, and performing a first depth test on the fragment to be rendered based on the global depth information includes: The first depth test is performed on the segment to be rendered according to the depth information of the target pixel block and the depth information of the segment to be rendered. The target pixel block is one of the plurality of pixel blocks that is the same as the segment to be rendered. Overlapping blocks of pixels. The method of claim 20, wherein performing the first depth test on the segment to be rendered based on the depth information of the target pixel block and the depth information of the segment to be rendered includes: If the depth value of the fragment to be rendered is greater than the depth value of the target pixel block, it is determined that the fragment to be rendered fails the first depth test. The method of claim 21, wherein the target pixel block includes a target area, the depth value of the target pixel block includes a first depth value and a second depth value, and the first depth value is the The maximum depth value of the target area, and the second depth value is the maximum depth value of the non-target area in the target pixel block. The method according to any one of claims 19 to 22, characterized in that the method further includes: Project the to-be-rendered primitives of the input partition pipeline to multiple pixel blocks to generate multiple projection areas, and the multiple projection areas correspond to the multiple pixel blocks in one-to-one correspondence; Perform a second depth test on the primitive to be rendered according to the multiple projection areas; If the primitive to be rendered fails the second depth test, the primitive to be rendered is eliminated. The method of claim 23, wherein performing a second depth test on the primitive to be rendered according to the plurality of projection areas includes: Determine whether the primitive to be rendered passes the depth test in the first pixel block according to the depth information of the first pixel block and the depth information of the first projection area. The first pixel block is one of the plurality of pixel blocks. For any pixel block, the first projection area is the projection area corresponding to the first pixel block; If the primitive to be rendered passes the depth test in the first pixel block, it is determined that the primitive to be rendered passes the second depth test; If the primitive to be rendered fails the depth test in the plurality of pixel blocks, it is determined that the primitive to be rendered fails the second depth test. The method of claim 24, wherein the step of determining whether the primitive to be rendered passes the depth test in the first pixel block is based on the depth information of the first pixel block and the depth information of the first projection area. ,include: If the minimum depth value of the first projection area is less than the depth value of the first pixel block, it is determined that the primitive to be rendered passes the depth test in the first pixel block. The method of claim 25, wherein the first pixel block includes a target area, and the depth value of the first pixel block includes a maximum depth value of the target area of the first pixel block and the third pixel block. The maximum depth value of the non-target area of a pixel block. The method according to any one of claims 23 to 26, characterized in that the method further includes: The global depth information is updated according to the plurality of projection areas. The method of claim 27, wherein updating the global depth information according to the plurality of projection areas includes: The depth information of the first pixel block in the global depth information is updated according to the depth information of the first pixel block and the depth information of the first projection area, and the first pixel block is any one of the plurality of pixel blocks. Pixel block, the first projection area is the projection area corresponding to the first pixel block. The method of claim 28, wherein updating the depth information of the first pixel block in the global depth information based on the depth information of the first pixel block and the depth information of the first projection area includes: Update the depth of the first pixel block according to the maximum depth value of the first projection area, the maximum depth value of the target area of the first pixel block, and the maximum depth value of the non-target area of the first pixel block information. The method according to any one of claims 19 to 29, characterized in that the method further includes: The clips that pass the first depth test are subjected to pre-depth testing and/or post-depth testing. An electronic device, including at least one processor and an interface circuit, the at least one processor and the interface circuit being coupled, characterized in that the at least one processor executes a program or instruction stored in a memory, so that the The electronic device implements the method described in any one of claims 19 to 30. A computer-readable storage medium used to store a computer program, characterized in that the computer program includes instructions for implementing the method described in any one of claims 19 to 30. A computer program product, the computer program product contains instructions, characterized in that when the instructions are run on a computer or a processor, the computer or the processor implements any of the above claims 19 to 30. method described in one item.