CN114049272B - Screen image processing method, screen assembly and computer storage medium - Google Patents

Abstract

The application provides a screen image processing method of a curve angle, which is characterized in that a curve center is taken as an origin of a coordinate system, a curve arc of the curve angle is placed in a plane coordinate system, and a pixel grid intersected with the curve arc is taken as a target pixel grid, and the method comprises the following steps: responding to the first intersection point coordinate and the second intersection point coordinate of the curve arc and each row or each column of target pixel grids, and calculating the gray coefficient of each target pixel grid according to the first intersection point coordinate and the second intersection point coordinate of each row or each column of target pixel grids; and processing the image data according to the gray coefficient of the target pixel grid. The screen image processing method, the screen assembly and the computer storage medium can rapidly acquire the gray coefficient of each target pixel grid so as to eliminate the sawtooth and color cast phenomena of the curve angle and improve the display effect.

Description

Screen image processing method, screen component and computer storage medium

technical field

The present application relates to the technical field of curved-angle screen processing, in particular to a curved-angle screen image processing method, a screen component, and a computer storage medium.

Background technique

In the field of mobile phones, mobile phones are developing in the direction of full screen. In order to increase the screen ratio of mobile phones, prevent the edges of mobile phones from being fragile and improve the visual aesthetics of mobile phones, mobile phones have R corners, Notch, etc., but this method will make the mobile phone screen The physical sub-pixels are cut off, resulting in jagged edges and color casts on the cut edges, and loss or loss of data at the cut edges.

With the diversified development of mobile phone screen applications, when the arc cut by the edge of the screen is curved, the image processing algorithm for the screen with curved corners has become an urgent problem in the industry.

Contents of the invention

The present application provides a screen image processing method with curved corners, a screen component and a computer storage medium, which are used to alleviate the problems of sawtooth and color cast after being cut on the curved corners of the mobile phone screen, so as to improve the display effect.

In one aspect, the present application provides a screen image processing method for curved corners. Optionally, with the center of the curve as the origin of the coordinate system, the curved arcs of the curved corners are placed in a plane coordinate system, and the The pixel grid is a target pixel grid, and the method includes: in response to obtaining the coordinates of the first intersection point and the second intersection point coordinates of the curve arc and each row or column of the target pixel grid, according to the target pixel grid of each row or column calculating the gamma of each target pixel grid based on the first intersection coordinates and the second intersection coordinates; and processing the image data according to the gamma of the target pixel grid.

Optionally, the step of calculating the gamma of each target pixel grid according to the first intersection coordinate and the second intersection coordinate of each row or column of the target pixel grid includes:

Perform a straight line from the first intersection point to the second intersection point of each row or column of the target pixel grid area to obtain a fitted line segment;

Calculate the first area of each pixel grid that is not cut by the fitted line segment;

Calculate the ratio of the first area to the total area of each pixel grid to obtain the gamma of the target pixel grid.

Optionally, when calculating the target pixel grid of the Nth row in the first quadrant, set the side length of each pixel grid area to be 1, where N is a positive integer, the first intersection point is the upper intersection point, and the first intersection point The second intersection point is the lower intersection point; the step of calculating the first area of each pixel grid that is not cut by the fitted line segment includes:

When the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curved arc and the Nth row are both integers, the first area of each pixel grid in the Nth row is calculated according to the similarity of the triangle;

And/or, the abscissa coordinate of the upper intersection point of the curve arc and the Nth row is an integer, and when the abscissa coordinate of the lower intersection point is not an integer, obtain the fractional part of the abscissa coordinate of the lower intersection point, according to Calculate the first area of each pixel grid in the Nth row by the fractional part of the horizontal axis coordinate of the lower intersection point and the similarity of the triangle;

And/or, the horizontal axis coordinates of the upper intersection point of the curve arc and the Nth row are not integers, and when the horizontal axis coordinates of the lower intersection point are integers, the fractional part of the upper intersection point horizontal axis coordinates is obtained, according to the rectangular area formula, the upper intersection point Calculate the first area of each pixel grid in the Nth row by calculating the similarity between the fractional part of the horizontal axis coordinates and the triangle;

And/or, when the horizontal axis coordinates of the intersection point and the horizontal axis coordinates of the intersection point between the curved arc and the Nth row are not integers, obtain the decimal part of the horizontal axis coordinates of the intersection point and the decimal part of the horizontal axis coordinates of the intersection point , and then calculate the first area of each pixel grid in the Nth row according to the rectangular area formula, the fractional part of the horizontal axis coordinate of the intersection point, the fractional part of the horizontal axis coordinate of the intersection point and the similarity of the triangle.

Optionally, before the step of processing the image data according to the gamma of the target pixel grid includes:

The product of multiplying each gamma coefficient by the smoothing order is rounded to obtain the coefficient storage number and write it into the memory.

Optionally, the step of writing into the memory includes:

Allocating a storage field for each row or column of the target pixel grid in response to obtaining the coefficient storage number;

In the A target pixel grid of the Nth row or Nth column, from the first location of the Nth row or Nth column storage field to the A+1th location of the A+1th location, respectively write the Nth The number A of the target pixel grid in the row or Nth column and the coefficient storage number of the A target pixel grid in the Nth row or Nth column;

Wherein, N is a positive integer, and A is a positive integer.

On the other hand, the present application also provides a curved-angle screen component, specifically, including an image driver, an image processor, and a curved-angle screen; the image driver is used to send image data to the image processor, so that the The image processor controls the screen of the curved angle to display the image data; the image processor is used to: take the center of the curve as the origin of the coordinate system, place the curved arc of the curved angle in a plane coordinate system, and The intersecting pixel grid is the target pixel grid. In response to obtaining the first intersection coordinates and the second intersection coordinates of the curve arc and each row or column of the target pixel grid, according to the first intersection point coordinates of each row or each column of the target pixel grid The intersection coordinates and the second intersection coordinates calculate the gamma of each target pixel grid, and process the image data according to the gamma of the target pixel grid.

Optionally, the image processor is also used for:

Perform a straight line from the first intersection point to the second intersection point of each row or column of the target pixel grid area to obtain a fitted line segment;

Calculate the first area of each pixel grid that is not cut by the fitted line segment;

Calculate the ratio of the first area to the total area of each pixel grid to obtain the gamma of the target pixel grid.

Optionally, the image processor is further configured to: when calculating the target pixel grid of the Nth row in the first quadrant, set the side length of each pixel grid area to be 1, wherein, N is a positive integer, and the One intersection is the upper intersection, and the second intersection is the lower intersection; the step of calculating the first area of each pixel grid that is not cut by the fitted line segment includes:

When the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curved arc and the Nth row are both integers, the first area of each pixel grid in the Nth row is calculated according to the similarity of the triangle;

And/or, the abscissa coordinate of the upper intersection point of the curve arc and the Nth row is an integer, and when the abscissa coordinate of the lower intersection point is not an integer, obtain the fractional part of the abscissa coordinate of the lower intersection point, according to Calculate the first area of each pixel grid in the Nth row by the fractional part of the horizontal axis coordinate of the lower intersection point and the similarity of the triangle;

And/or, the horizontal axis coordinates of the upper intersection point of the curve arc and the Nth row are not integers, and when the horizontal axis coordinates of the lower intersection point are integers, the fractional part of the upper intersection point horizontal axis coordinates is obtained, according to the rectangular area formula, the upper intersection point Calculate the first area of each pixel grid in the Nth row by calculating the similarity between the fractional part of the horizontal axis coordinates and the triangle;

And/or, when the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curve arc and the Nth row are not integers, obtain the fractional part of the upper intersection point horizontal axis coordinates and the lower intersection point horizontal axis The fractional part of the coordinates, and then calculate the first area of each pixel grid in the Nth row according to the rectangular area formula, the fractional part of the horizontal axis coordinates of the upper intersection point, the fractional part of the horizontal axis coordinates of the lower intersection point, and the triangle similarity.

Optionally, the curved angle screen component further includes a memory connected to the image processor, and the image processor is also configured to allocate a target pixel grid for each row or column in response to obtaining the coefficient storage number. Storage field; in the A target pixel grid of the Nth row or Nth column, from the first location of the Nth row or Nth column storage field to the A+1th location of the A+1th location, respectively write Enter the number A of the target pixel grid in the Nth row or Nth column and the coefficient storage number of the A target pixel grid in the Nth row or Nth column; wherein, N is a positive integer, and A is a positive integer.

On the other hand, the present application also provides a computer storage medium. Specifically, a computer program is stored on the computer storage medium. When the computer program is executed by a computer, the screen image processing described in any one of the above items can be realized. method.

As mentioned above, the screen image processing method for curved corners, screen components for curved corners, and computer storage media provided by the present application can not only quickly obtain the gamma of each target pixel grid, so as to eliminate the problem of being cut on the curved corners of the mobile phone screen. The final aliasing and color cast problems have effectively improved the display effect.

Description of drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description serve to explain the principles of the application. In order to more clearly illustrate the technical solutions of the embodiments of the present application, the accompanying drawings that need to be used in the description of the embodiments will be briefly introduced below. Obviously, for those of ordinary skill in the art, the Under the premise, other drawings can also be obtained based on these drawings.

FIG. 1 is a schematic diagram of an elliptical corner screen and edge pixel grids in an embodiment of the present application.

FIG. 2 is a flowchart of a screen image processing method according to the first embodiment of the present application.

FIG. 3 is a flow chart of calculating the gamma of the target pixel grid in the embodiment of FIG. 2 of the present application.

FIG. 4 is a schematic diagram of calculating the first area of each target pixel grid in the embodiment of FIG. 3 of the present application.

FIG. 5 is a structural diagram of a screen component in a second embodiment of the present application.

The realization, functional features and advantages of the present application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. By means of the above drawings, specific embodiments of the present application have been shown, which will be described in more detail hereinafter. These drawings and text descriptions are not intended to limit the scope of the concept of the application in any way, but to illustrate the concept of the application for those skilled in the art by referring to specific embodiments.

Detailed ways

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numerals in different drawings refer to the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with aspects of the present application as recited in the appended claims.

It should be noted that, in this document, the term "comprising", "comprising" or any other variation thereof is intended to cover a non-exclusive inclusion such that a process, method, article or apparatus comprising a set of elements includes not only those elements, It also includes other elements not expressly listed, or elements inherent in the process, method, article, or device. Without further limitations, an element defined by the statement "comprising a..." does not exclude the presence of other identical elements in the process, method, article, or device that includes the element. In addition, different implementations of the present application Components, features, and elements with the same name in the example may have the same meaning, or may have different meanings, and the specific meaning shall be determined based on the explanation in the specific embodiment or further combined with the context in the specific embodiment.

It should be understood that the specific embodiments described here are only used to explain the present application, and are not intended to limit the present application.

It should be noted that the screen image processing method of the curved corner is applied to the curved corner screen component, with the center of the curve as the origin of the coordinate system, the curved arc of the curved corner can be placed in the first quadrant of the plane coordinate system for easy explanation, and intersects with the curved arc The pixel grid of is the target pixel grid, but the application is not limited to similar processing in other quadrants.

Understandably, on a cutting line of a curved arc, for the target pixel grid to be cut on the elliptical screen, there are two intersection points in each row or column. Optionally, in each row of the target pixel grid in the first quadrant, the first intersection point may be an upper intersection point, and the second intersection point may be a lower intersection point. Similarly, in each column of the target pixel grid in the first quadrant, the first intersection point may be a left intersection point, and the second intersection point may be a right intersection point.

Curves can be various types of curves defined by mathematical functions, such as rounded curves, elliptic curves, perfect curves, and Fermat curves. In order to facilitate the description of the technical solution of the present application, the following embodiments are based on the convex elliptic curve angle screen as an example, and each row of target pixel grids in the ellipse cutting line in the first quadrant is used as the calculation object for illustration and example. For concave curved screens, other types of curves, or when each column of target pixel cells is used as the calculation object, the principles of the processing solutions in the following embodiments can be referred to. In other embodiments, the processing ideas of the present application may also be applied to other quadrants and each column of target pixel grids may be used as the processing object. Simple adjustments or transformations of the corresponding technical solutions after referring to the processing solutions of the following embodiments also fall within the protection scope of the present application.

Based on mathematical principles, an elliptical arc corresponds to an ellipse, that is, the major axis, minor axis and center of the ellipse can be determined according to the elliptical arc. Therefore, based on the elliptical arc cutting line, the major axis, minor axis and center. Wherein, the center coordinates are the coordinates of the center of the ellipse where the cutting line of the ellipse arc is located. Wherein, the ellipse arc cutting line is the contour line of the ellipse corner of the display screen, located at the edge of the ellipse arc of the display screen, and is used to define the edge of the ellipse arc of the display area of the display screen. Before chamfering or slotting the display screen, the shape of the cutting line can be pre-designed. If the chamfering is elliptical arc-shaped chamfering or the groove is elliptical arc-shaped, the elliptical arc cutting line used can be preset.

first embodiment

The present application firstly provides a screen image processing method for curved corners.

In one embodiment, the center of the curve is used as the origin of the coordinate system, the curved arc at the corner of the curve is placed in the plane coordinate system, and the pixel grid intersected with the curved arc is the target pixel grid. The steps of the screen image processing method include:

In response to obtaining the first intersection coordinates and the second intersection coordinates of the curve arc and each row or column of the target pixel grid, calculating each target pixel grid according to the first intersection coordinates and the second intersection coordinates of each row or column of the target pixel grid gamma; process the image data according to the gamma of the target pixel grid.

FIG. 1 is a schematic diagram of an elliptical corner screen and edge pixel grids in an embodiment of the present application.

Please refer to Fig. 1, in one embodiment, point o is the origin of the coordinate system, x and y correspond to the x-axis and y-axis of the plane coordinate axis respectively, and in the coordinate system composed of the origin o, x-axis and y-axis, the first quadrant Consists of multiple pixel grids of equal size. This application selects an ellipse angle with a major axis of 16 pixel units and a minor axis of 11 pixel units as an example. The ellipse angle is placed in the first quadrant, and the center of the ellipse coincides with point o to obtain an ellipse placed in the first quadrant. The elliptical arc r of the angle. The area formed by the ellipse arc r and the coordinate axis in the first quadrant is the light-emitting area of the screen, and the pixel grid intersecting the ellipse arc r is the target pixel grid, which represents the cutting edge. In other embodiments, the corners of the ellipse may also be placed in other quadrants.

Please continue to refer to FIG. 1. In one embodiment, a1, a2, a3, a4, a5, a6, a7, b1, b2, b3, b4, c1, c2, d1, d2, d3, e1, e2, f1, f2, g1, h1, h2, i1, j1, k1 are target pixel grids.

Understandably, when each row of the target pixel grid is used as the processing object, the coordinates of the upper intersection point and the coordinates of the lower intersection point may be selected. When each column of the target pixel grid is used as the processing object, the coordinates of the right intersection point and the left intersection point can be selected.

FIG. 2 is a flowchart of a screen image processing method according to the first embodiment of the present application.

Please refer to FIG. 2. Exemplarily, the screen image processing method includes:

S10: In response to obtaining the horizontal axis coordinates of the upper intersection point and the lower intersection point of the curve arc and each row of the target pixel grid.

The abscissa coordinates of the upper intersection point and the abscissa coordinates of the lower intersection point of each row of target pixel cells can be calculated according to the formula of the curve equation.

S20: Calculate the gamma of each target pixel grid according to the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of each row of target pixel grids.

The gamma coefficient can also be called the gradient coefficient, which can be the ratio of the uncut area to the total area of each target pixel grid. It can clearly indicate the target pixel grid, that is, the degree of color gradient after the image is cut. The ratio of the uncut area to the total area in each pixel grid can be calculated through the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates where the arc of the curve intersects with each row of target pixel grids.

S30: Process the image data according to the gamma of the target pixel grid.

The display brightness of each pixel grid on the screen is adjusted and controlled by the magnitude of the driving current, which is the current output to each pixel grid by the driving component of the pixel grid. At the edge of the screen, in order to smooth the brightness and eliminate the color cast phenomenon, each edge pixel grid corresponds to a gamma factor with optimized brightness. Generally speaking, the gamma factor of optimized brightness is different for different area ratios.

In this embodiment, the gamma of each target pixel grid is calculated by the coordinates of the first intersection point and the second intersection point of the target pixel grid, and the gamma coefficient of each target pixel grid can be quickly obtained to eliminate the aliasing generated after cutting the curve corner And color cast phenomenon, to achieve the purpose of saving costs.

In an embodiment, the step of calculating the gamma of each target pixel grid according to the first intersection coordinate and the second intersection coordinate of each row or column of the target pixel grid may include:

Carry out a straight line from the first intersection point to the second intersection point of each row or column of the target pixel grid area to obtain a fitted line segment; calculate the first area of each pixel grid that is not cut by the fitted line segment; calculate the first area and The ratio of the total area of each pixel to obtain the gamma of the target pixel.

FIG. 3 is a flow chart of calculating the gamma of the target pixel grid in the embodiment of FIG. 2 of the present application.

Please refer to FIG. 3 . Exemplarily, the screen image processing method is executing S20: the step of calculating the gamma of each target pixel grid according to the horizontal axis coordinates of the upper intersection point and the horizontal axis coordinates of the lower intersection point of each row of target pixel grids includes:

S21: Connect a straight line from the upper intersection point to the lower intersection point of each row of the target pixel grid area to obtain a fitting line segment.

S22: Calculate the first area of each pixel grid that is not cut by the fitted line segment.

S23: Calculate the ratio of the first area to the total area of each pixel grid to obtain the gamma of the target pixel grid.

Please refer to FIG. 1 , in one embodiment, the upper intersection point B and the lower intersection point A in the area of the first row of target pixel grids a1 to a7 are connected by a straight line to obtain a fitting line segment AB. Point C is the lower left corner of the target pixel grid area in the first row. The fitting line segment AB forms a triangle ABC with the target pixel grid area on the side close to the coordinate origin, and calculates the first uncut area of the triangle ABC in each target pixel grid. Exemplarily, in the target pixel grid a7, assuming that the side length of each pixel grid is 1, combined with the similar properties of the triangle, it can be calculated that the first uncut area is 0.033, since the total area of each pixel grid is 1 , so the gamma of the target pixel grid a7 is 0.033. According to the similarity principle of triangles, the gamma of the target pixel grids of a1-a6 can be calculated.

In this embodiment, the side length of each target pixel grid is set to 1, but the side length of the target pixel grid is not limited to 1 unit, and can be 2 units, 3 units or other random values greater than 0. At this time, the total area of each target pixel grid can be calculated according to the square area formula. Understandably, for a convex curve, the uncut area is on the side of the dividing line close to the origin of the coordinate system; while for a concave curve, the uncut area is on the side of the dividing line away from the origin of the coordinate system.

FIG. 4 is a schematic diagram of calculating the first area of each target pixel grid in the embodiment of FIG. 3 of the present application.

Please refer to FIG. 4 , in one embodiment, the screen image processing method includes multiple combinations in the step of performing S22 : calculating the first area of each pixel grid not cut by the fitted line segment. In the target pixel grid in row N, the side length of each pixel grid area is set to be 1, wherein N is a positive integer.

Please refer to combination 1 in Figure 4, when the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curve arc and the Nth row are both integers, each target pixel grid in the Nth row is not cut according to the triangle similarity calculation the first area of .

Please refer to combination 2 in Figure 4. The horizontal axis coordinates of the upper intersection point of the curve arc and the Nth row are integers, and when the horizontal axis coordinates of the lower intersection point are not integers, obtain the fractional part of the horizontal axis coordinates of the lower intersection point. The fractional part and the similarity of the triangle calculate the uncut first area of each target pixel grid in the Nth row.

For example, please refer to Figure 1, in the target pixel grid on line 11, according to the ellipse formula, the horizontal axis coordinate x1=0 of the upper intersection point B is an integer, and the horizontal axis coordinate x2=6.666 of the lower intersection point A is not an integer , the two right sides of the right triangle ABC are 1 and 6.666 respectively, and then the total area of the right triangle ABC can be calculated according to the area formula of the right triangle. Obtain the fractional part of the abscissa coordinate of the lower intersection point A and the similarity of the triangle to calculate the first area of each pixel grid in row 11.

Please refer to combination 3 in Figure 4, the horizontal axis coordinates of the upper intersection point of the curve arc and the Nth row are not integers, and when the horizontal axis coordinates of the lower intersection point are integers, the decimal part of the horizontal axis coordinates of the upper intersection point is obtained, according to the rectangular area formula, the upper The fractional part of the horizontal axis coordinates of the intersection point and the similarity of the triangle are used to calculate the uncut first area of each target pixel grid in the Nth row.

Please refer to combination 4 in Figure 4, when the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curve arc and the Nth row are not integers, obtain the decimal part of the horizontal axis coordinates of the upper intersection point and the decimal point of the lower intersection point horizontal axis coordinates part, and then calculate the uncut first area of each target pixel grid in the Nth row according to the rectangular area formula, the fractional part of the horizontal axis coordinates of the upper intersection point, the fractional part of the horizontal axis coordinates of the lower intersection point, and the triangle similarity.

For example, please refer to Figure 1, when the horizontal axis coordinates of the upper intersection point x1=6.666 and the lower intersection point horizontal axis coordinates x2=9.199 of the ellipse arc and the target pixel grid in the 10th row are not integers, obtain the decimal number of the upper intersection point horizontal axis coordinates Part rem(x1)=0.666 and the fractional part rem(x2)=0.199 of the horizontal axis coordinates of the lower intersection point, then obtain the rectangular area 0.666 in the b1 target pixel lattice according to the fractional part of the horizontal axis coordinates of the upper intersection point and the rectangular area formula, and then according to the following Calculate the fractional part of the horizontal axis coordinates of the intersection point and the similarity of the triangle to obtain the area of the trapezoid in the b1 target pixel grid of 0.246, and add the last two areas to obtain the first area of the b1 target pixel grid of 0.912, and then according to the similarity of the triangle, get the 10th The first uncut area of each pixel grid of the row.

For the cutting of each line, by using a straight line instead of a curve fitting method, the fitted straight line and each line of target pixels to be cut are combined into three shapes: triangle, trapezoid and rectangle, combined with mathematical formulas to accurately Combining and calculating the first uncut area of each target pixel grid, so as to obtain the gamma of each target pixel grid.

In one embodiment, the screen image processing method includes before performing the step of S30: processing image data according to the gamma of the target pixel grid:

The product of each gamma multiplied by the smoothing order is rounded to obtain the stored number of coefficients and written to memory. It should be noted that the rounding can be rounding up, discarding decimals and rounding up, or rounding up.

The smoothness level indicates the smoothness level of the edge of the screen. In order to facilitate the storage of the hardware, all the gamma coefficients are normalized to 4bit, and the smoothness can be divided into 16 levels at most.

In the embodiment of rounding down, the gamma of each target pixel grid is multiplied by 16, and the obtained product discards the decimal and rounds down to select an integer, which is stored in the memory, so that the gamma value after processing In the middle of [0,15].

For example, when the gamma of a target pixel grid a7 is 0.033, multiply 0.033 by 16 to get a product of 0.528, and round down to get 0, which can be converted into the first binary data 0000 and stored in the memory. When the system calls the gamma of a7, it reads the binary data 0000, which is 0 in decimal, and divides 0 by 16 to get the quotient 0, that is, takes 0 as the actual gamma of the target pixel grid a7 for display driving.

For example, when the gamma of a target pixel grid a1 is 0.9, multiply 0.9 by 16 to get the product 14.4, and round down to get 14, which can be converted into the 15th binary data 1110 and stored in the memory. When the system calls the gamma of a1, it reads the binary data 1110, that is, 14 in decimal, and divides 14 by 16 to obtain a quotient of 0.875, that is, 0.875 is used as the actual gamma of the target pixel grid a1 for display driving.

In the embodiment of rounding up, the gamma of each target pixel grid is multiplied by 16, and the obtained product is rounded up and then an integer is selected and stored in the memory, so that the gamma value after processing is in [1, 16] Middle.

For example, when the gamma of a target pixel grid a7 is 0.033, multiply 0.033 by 16 to get a product of 0.528, and round up to get 1, which can be converted into the first binary data 0000 and stored in the memory. When the system calls the gamma of a7, read the binary data 0000, which is 0 in decimal, add 1 to get 1, divide 1 by 16 to get the quotient 0.0625, that is, use 0.0625 as the actual gamma of the target pixel grid a7 for display drive.

For example, when the gamma of a target pixel grid a1 is 0.9, multiply 0.9 by 16 to get a product of 14.4, and round up to get 15, which can be converted into the 15th binary data 1110 and stored in the memory. When the system calls the gamma of a1, read the binary data 1110, which is 14 in decimal, add 1 to get 15, divide 15 by 16 to get the quotient 0.9375, that is, use 0.9375 as the actual gamma of the target pixel grid a1 for display drive.

In the embodiment of rounding and rounding, the gamma of each target pixel grid is multiplied by 15, and the obtained product is rounded and rounded to an integer and stored in the memory so that the gamma value after processing is in [0, 15] Middle.

For example, when the gamma of a target pixel grid a8 is 0.39, the product 5.85 is obtained by multiplying 0.39 by 15, and rounded to an integer to obtain 6, which can be converted into the seventh binary data 0110 and stored in the memory. When the system calls the gamma of a7, it reads the binary data 0110, which is 6 in decimal, and divides 6 by 15 to get the quotient 0.4, that is, takes 0.4 as the actual gamma of the target pixel grid a8 for display driving.

For example, when the gamma of a target pixel grid a9 is 0.87, the product 13.05 is obtained by multiplying 0.87 by 15, and rounded to an integer to obtain 13, which can be converted into the 14th binary data 1101 and stored in the memory. When the system invokes the gamma of a9, it reads the binary data 1101, that is, 13 in decimal, and divides 13 by 15 to obtain a quotient of 0.867, that is, 0.867 is used as the actual gamma of the target pixel grid a9 for display driving.

In another embodiment, all gamma coefficients can also be normalized to 5 bits, and the smoothness can be divided into 32 levels at the highest. It should be noted that the normalization of the gamma can be 4 bits, 5 bits, 6 bits, etc. any bit data, which is not limited in this application. The degree of smoothness may represent the level of smoothness of the glow at the edges of the screen. The larger the smoothing order, the more accurate the stored data and the better the light smoothing effect. The smaller the smoothing order, the more effective the storage space can be saved.

In one embodiment, the screen image processing method includes:

In response to obtaining the coefficient storage number, a storage field is allocated for each row of target pixel cells. Corresponding to the A target pixel grid in the Nth row, from the first location of the storage field in the Nth row to the A+1th location in the A+1th location, write the number of the target pixel grid in the Nth row respectively. The number A and the coefficient storage number of the A target pixel grid in the Nth row. Wherein, N is a positive integer, and A is a positive integer.

Please combine Fig. 1 and Table 1, Table 1 is the storage mode of each target pixel grid gamma, in one embodiment, in Table 1, a storage field is allocated for each row of target pixel grid; In the target pixel grid, the number of target pixel grids in the first row and the 7 target pixels in the first row are respectively written in the 8 locations from the first to the eighth location of the storage field of the first row. The coefficient storage numbers a1, a2, a3, a4, a5, a6, a7 of the grid, and the target pixel grids of other rows can be deduced by analogy. In the process of displaying the curve angle screen, the system can directly read the number of target pixel cells whose gamma coefficient needs to be adjusted according to the storage field of each row of target pixel cells. The system can also quickly locate the storage location of the corresponding gamma coefficient according to the storage field of each row of the target pixel grid to speed up the reading speed.

Table I

7 a1 a2 a3 a4 a5 a6 a7 4 b1 b2 b3 b4 2 c1 c2 3 d1 d2 d3 2 e1 e2 2 f1 f2 1 g1 2 h1 h2 1 l1 1 j1 1 k1

second embodiment

On the other hand, on the basis of the first embodiment, the present application also provides a screen component with curved corners. FIG. 5 is a structural diagram of the screen component in the second embodiment of the present application.

Please refer to FIG. 5 . Exemplarily, the curved-angle screen assembly includes an image driver 10 , an image processor 20 and a curved-angle screen 30 . The image driver 10 is used for sending image data to the image processor 20 so that the image processor 20 controls the curved screen 30 to display the image data.

In one embodiment, the image processor 20 is used to: take the center of the curve as the origin of the coordinate system, place the curved arc at the corner of the curve in the plane coordinate system, and the pixel grid intersecting the curved arc is the target pixel grid, and respond to the acquisition of the curved arc Calculate the gamma of each target pixel grid according to the first intersection coordinate and the second intersection coordinate of each row or column of the target pixel grid, Process the image data according to the gamma of the target pixel grid; control the curve angle screen 30 to display the processed image data.

Exemplarily, the image processor 20 can calculate the abscissa coordinates of the upper intersection point and the abscissa coordinates of the lower intersection point of each row of target pixel grids according to the formula of the ellipse equation. The gamma coefficient can also be called the gradient coefficient, which can be the ratio of the uncut area to the total area of each target pixel grid. It can clearly indicate the target pixel grid, that is, the degree of color gradient after the image is cut. The ratio of the uncut area to the total area in each pixel grid can be calculated through the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates where the arc of the ellipse arc intersects with each row of target pixel grids.

The display brightness of each pixel grid on the screen is adjusted and controlled by the magnitude of the driving current, which is the current output to each pixel grid by the driving component of the pixel grid. At the edge of the screen, in order to smooth the brightness and eliminate the color cast phenomenon, each edge pixel grid corresponds to a gamma factor with optimized brightness. Generally speaking, the gamma factor of optimized brightness is different for different area ratios.

The image processor 20 calculates the coordinates of the first intersection point and the coordinates of the second intersection point of each row or column of the target pixel grid, and then determines and obtains the gamma control curve angle of each target pixel grid. The screen 30 displays the processed image data, which can Quickly obtain the gamma of each target pixel grid to eliminate the jaggedness and color cast after cutting the corner of the curve, and achieve the purpose of saving costs.

In one embodiment, the image processor 20 is also used for:

Perform a straight line from the first intersection point to the second intersection point of each row or column of the target pixel grid area to obtain a fitted line segment;

Calculate the first area of each pixel grid that is not cut by the fitted line segment;

Calculate the ratio of the first area to the total area of each pixel grid to obtain the gamma of the target pixel grid.

Exemplarily, the image processor 20 in the elliptical corner screen component can also be used to: connect a straight line from the upper intersection point to the lower intersection point of each row of the target pixel grid area to obtain a fitted line segment; Fit the first area cut by the line segment; calculate the ratio of the first area to the total area of each pixel grid to obtain the gamma of the target pixel grid.

Please refer to FIG. 1 at the same time. For example, the upper intersection point B and the lower intersection point A in the area of the first row of target pixel grids a1 to a7 are connected by a straight line to obtain a fitting line segment AB. The lower left corner of the target pixel grid area in the first row is point C. The fitting line segment AB forms a triangle ABC with the target pixel grid area on the side close to the coordinate origin, and calculates the first uncut area of the triangle ABC in each target pixel grid. Exemplarily, in the target pixel grid a7, assuming that the side length of each pixel grid is 1, combined with the similar properties of the triangle, it can be calculated that the first uncut area is 0.033, since the total area of each pixel grid is 1 , so the gamma of the target pixel grid a7 is 0.033. According to the similarity principle of triangles, the gamma of the target pixel grids of a1-a6 can be calculated.

In this embodiment, the side length of each target pixel grid is set to 1, but the side length of the target pixel grid is not limited to 1 unit, and can be 2 units, 3 units or other random values greater than 0. At this time, the total area of each target pixel grid can be calculated according to the square area formula.

In one embodiment, the image processor 20 in the curved corner screen assembly is also used to: in the target pixel grid of the Nth row, set the side length of each pixel grid area to be 1, where N is a positive integer; The steps of the first area of the pixel grid not cut by the fitted line segment include:

Please refer to combination 1 in Figure 4, when the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curve arc and the Nth row are both integers, each target pixel grid in the Nth row is not cut according to the triangle similarity calculation the first area of .

Please refer to combination 2 in Figure 4. The horizontal axis coordinates of the upper intersection point of the curve arc and the Nth row are integers, and when the horizontal axis coordinates of the lower intersection point are not integers, obtain the fractional part of the horizontal axis coordinates of the lower intersection point. The fractional part and the similarity of the triangle calculate the uncut first area of each target pixel grid in the Nth row.

For example, please refer to Figure 1, in the target pixel grid on line 11, according to the ellipse formula, the horizontal axis coordinate x1=0 of the upper intersection point B is an integer, and the horizontal axis coordinate x2=6.666 of the lower intersection point A is not an integer , the two right sides of the right triangle ABC are 1 and 6.666 respectively, and then the total area of the right triangle ABC can be calculated according to the area formula of the right triangle. Obtain the fractional part rem(x2)=0.666 of the abscissa coordinate of the lower intersection point A, and calculate the first area of each pixel grid in the 11 rows according to the similarity between the fractional part of the abscissa coordinate of the lower intersection point and the triangle.

Please refer to combination 3 in Figure 4, the horizontal axis coordinates of the upper intersection point of the curve arc and the Nth row are not integers, and when the horizontal axis coordinates of the lower intersection point are integers, the decimal part of the horizontal axis coordinates of the upper intersection point is obtained, according to the rectangular area formula, the upper The fractional part of the horizontal axis coordinates of the intersection point and the similarity of the triangle are used to calculate the uncut first area of each target pixel grid in the Nth row.

Please refer to combination 4 in Figure 4, when the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curve arc and the Nth row are not integers, obtain the decimal part of the horizontal axis coordinates of the upper intersection point and the decimal point of the lower intersection point horizontal axis coordinates part, and then calculate the uncut first area of each target pixel grid in the Nth row according to the rectangular area formula, the fractional part of the horizontal axis coordinates of the upper intersection point, the fractional part of the horizontal axis coordinates of the lower intersection point, and the triangle similarity.

For example, please refer to Fig. 1, when the ellipse arc and the horizontal axis coordinates of the upper intersection point x1=6.666 and the lower intersection point horizontal axis coordinates x2=9.199 in the 10th row are not integers, obtain the decimal part of the upper intersection point horizontal axis coordinates rem( x1)=0.666 and the fractional part rem(x2)=0.199 of the abscissa coordinate of the lower intersection point. According to the fractional part of the horizontal axis coordinate of the upper intersection point and the formula of the area of the rectangle, the area of the rectangle in the b1 target pixel grid can be obtained as 0.666. According to the similarity between the fractional part of the horizontal axis coordinate of the lower intersection point and the triangle, the area of the trapezoid in the b1 target pixel grid can be calculated as 0.246, and the last two areas are added to obtain the first area of the b1 target pixel grid as 0.912. According to the similarity of the triangles, the first uncut area of each target pixel grid in row 10 can be further obtained.

For the cutting of each line, by using the straight line segment instead of the curve fitting method, the target pixel grid formed by the cut straight line segment and the screen pixel points is combined into three shapes such as triangle, trapezoid and rectangle, and combined with mathematical formulas, it can accurately The combination of calculates the uncut first area of each target pixel grid, so as to obtain the gamma of each target pixel grid.

Please continue to refer to FIG. 5 , in one embodiment, the screen component further includes a memory 40 connected to the image processor 20, and the image processor 20 is also used to round the product of multiplying each gamma factor by the smoothing order to an integer. The stored number of coefficients is obtained and written into the memory 40 .

The smoothness level represents the smoothness level of the light at the edge of the screen. In order to facilitate hardware storage, the image processor 20 can normalize all the gamma coefficients to 4 bits, and the smoothness can be divided into 16 levels at most.

In the embodiment of rounding down, the gamma of each target pixel grid is multiplied by 16, and the obtained product discards decimals and rounds down to select an integer, which is stored in the memory 40, so that the gamma after processing The value is in the middle of [0, 15].

Exemplarily, when the gamma of a target pixel grid a7 is 0.033, multiply 0.033 by 16 to get a product of 0.528, round down to get 0, and the image processor 20 can convert it into the first binary data 0000 and store it in the memory 40 in. When the image processor 20 invokes the gamma of a7, it reads the binary data 0000, that is, 0 in decimal, and divides 0 by 16 to obtain a quotient of 0, that is, uses 0 as the actual gamma of the target pixel grid a7 for display driving.

Exemplarily, when the gamma of a target pixel grid a1 is 0.9, multiply 0.9 by 16 to get the product 14.4, and round down to get 14, the image processor 20 can convert the 15th binary data 1110 and store it in the memory 40 in. When the image processor 20 invokes the gamma of a1, it reads the binary data 1110, which is 14 in decimal, and divides 14 by 16 to obtain a quotient of 0.875, that is, 0.875 is used as the actual gamma of the target pixel grid a1 for display driving.

In the embodiment of rounding up, the image processor 20 multiplies the gamma of each target pixel grid by 16, and the obtained product is rounded up to select an integer and stored in the memory 40, so that the processed gamma The value is in the middle of [1, 16].

Exemplarily, when the gamma of a target pixel grid a7 is 0.033, the image processor 20 multiplies 0.033 by 16 to obtain a product of 0.528, and rounds up to obtain 1, which can be converted into the first binary data 0000 and stored in the memory 40 middle. When the image processor 20 invokes the gamma of a7, read the binary data 0000, that is, 0 in decimal, add 1 to get 1, divide 1 by 16 to get the quotient 0.0625, that is, take 0.0625 as the actual gray scale of the target pixel grid a7 Coefficients for display driving.

Exemplarily, when the gamma of a target pixel grid a1 is 0.9, the image processor 20 multiplies 0.9 by 16 to obtain a product of 14.4, and rounds up to obtain 15, which can be converted into the 15th binary data 1110 and stored in the memory 40 middle. When the image processor 20 invokes the gamma of a1, read the binary data 1110, that is, 14 in decimal, add 1 to get 15, divide 15 by 16 to get the quotient 0.9375, that is, take 0.9375 as the actual gray scale of the target pixel grid a1 Coefficients for display driving.

In the embodiment of rounding and rounding, the image processor 20 multiplies the gamma of each target pixel grid by 15, and the obtained product is rounded and rounded to an integer to select an integer and stored in the memory 40, so that the processed gamma The value is in the middle of [0, 15].

Exemplarily, when the gamma of a target pixel grid a8 is 0.39, the image processor 20 multiplies 0.39 by 15 to obtain a product of 5.85, and rounds to an integer to obtain 6, which can be converted into the seventh binary data 0110 and stored in the memory 40 middle. When the image processor 20 invokes the gamma of a7, it reads the binary data 0110, that is, 6 in decimal, and divides 6 by 15 to obtain a quotient of 0.4, that is, takes 0.4 as the actual gamma of the target pixel grid a8 for display driving.

For example, when the gamma of a target pixel grid a9 is 0.87, the product 13.05 is obtained by multiplying 0.87 by 15, and rounded to an integer to obtain 13, which can be converted into the 14th binary data 1101 and stored in the memory. When the system invokes the gamma of a9, it reads the binary data 1101, that is, 13 in decimal, and divides 13 by 15 to obtain a quotient of 0.867, that is, 0.867 is used as the actual gamma of the target pixel grid a9 for display driving.

In another embodiment, the image processor 20 can also normalize all the gamma to 5 bits, and the smoothness can be divided into 32 levels at most. It should be noted that the normalization of the gamma can be 4 bits, 5 bits, 6 bits, etc. any bit data, which is not limited in this application. The degree of smoothness may represent the level of smoothness of the glow at the edges of the screen. The larger the smoothing order, the more accurate the stored data and the better the light smoothing effect. The smaller the smoothing order, the more effective the storage space can be saved.

In one embodiment, the image processor 20 is also used for:

In response to obtaining the coefficient storage number, a storage field is allocated for each row of target pixel cells. Corresponding to the A target pixel grid in the Nth row, from the first location of the storage field in the Nth row to the A+1th location in the A+1th location, write the number of the target pixel grid in the Nth row respectively. The number A and the coefficient storage number of the A target pixel grid in the Nth row. Wherein, N is a positive integer, and A is a positive integer.

Please combine Figure 1 and Table 1. Table 1 shows the storage method of the gamma of each target pixel grid. In one embodiment, the image processor 20 in Table 1 allocates a storage field for each row of target pixel grids; In the 8 zones of the 8 zones, the number 7 of the target pixel grid in the first row and the coefficient storage numbers a1, a2, a3, a4, a5, a6, a7 of the 7 target pixel grids in the first row are respectively written, The target pixel grid of other rows can be deduced in the same way. In the process of displaying the curved angle screen, the image processor 20 can directly read the number of target pixel cells whose gamma needs to be adjusted in the row according to the storage field of each row of target pixel cells. The image processor 20 can also quickly locate the storage location of the corresponding gamma coefficient according to the storage field of each row of the target pixel grid, so as to speed up the reading speed.

third embodiment

On the other hand, the present application also provides a computer storage medium, specifically, a computer program is stored on the computer storage medium, and when the computer program is executed by a computer, any screen image processing method as described above can be realized.

Exemplarily, the computer program on the computer storage medium implements the screen image processing method and applies the steps in FIG. 1 as follows:

S1: Assuming that the side length of each pixel grid area is 1, according to the ellipse equation and the first quadrant of the coordinate system, obtain the abscissa coordinates of the upper intersection point and the lower intersection point abscissa coordinates of the ellipse arc r and each row of target pixel grids.

S2: Connect straight lines from the upper intersection point to the lower intersection point of the target pixel grid area in each row to obtain the fitted line segment, and calculate the first area of each pixel grid that is not cut by the fitted line segment. There are the following four situations:

When the abscissa coordinates of the upper intersection point and the abscissa coordinates of the lower intersection point in the Nth row are both integers, the first area of each pixel grid in the Nth row is calculated according to the similarity of the triangles;

When the horizontal axis coordinate of the upper intersection point in the Nth line is an integer, and the horizontal axis coordinate of the lower intersection point is not an integer, obtain the fractional part of the horizontal axis coordinate of the lower intersection point, and calculate the Nth according to the similarity between the fractional part of the horizontal axis coordinate of the lower intersection point and the triangle The first area of each pixel grid of the row;

When the horizontal axis coordinate of the upper intersection point in the Nth row is not an integer and the horizontal axis coordinate of the lower intersection point is an integer, obtain the fractional part of the horizontal axis coordinate of the upper intersection point. According to the rectangular area formula, the decimal part of the horizontal axis coordinate of the upper intersection point is similar to that of a triangle Calculate the first area of each pixel grid in the Nth row;

When the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the Nth row are not integers, obtain the fractional part of the horizontal axis coordinates of the upper intersection point and the fractional part of the lower intersection point horizontal axis coordinates, and then use the rectangular area formula, the upper intersection point horizontal axis The first area of each pixel grid in the Nth row is calculated by the fractional part of the axis coordinates, the fractional part of the horizontal axis coordinates of the lower intersection point, and the similarity of the triangle.

S3: Calculate the ratio of the first area to the total area of each pixel grid to obtain the gamma of the target pixel grid. Image data is processed according to the gamma of each target pixel bin.

When it is necessary to store the gamma coefficients, the product of each gamma coefficient multiplied by the smoothing order can be rounded to an integer, and a storage field is allocated for each row of target pixel cells, and the obtained coefficients are stored according to the "number of coefficients + The arrangement of "coefficient storage number" is written into the memory.

In the process of implementing the screen image processing method by the computer program, reference may be made to the above embodiments for technical details involved, which will not be repeated here.

It should be noted that, the above embodiments are described and illustrated with each row of target pixel grids in the ellipse cutting line of the first quadrant as the calculation object. Therefore, the intersection coordinate data used are the abscissa coordinates of the first intersection point and the abscissa coordinates of the second intersection point. axis coordinates. For other quadrants or when each column of the target pixel grid is used as the calculation object, it is actually a similar shape based on the rotation of each row of the target pixel grid in the first quadrant. Therefore, the calculation method that uses each column of the target pixel grid as the calculation object can be With reference to the principles explained in the above embodiments, when using the intersection coordinate data, the vertical axis coordinates of the first intersection point and the vertical axis coordinates of the second intersection point can be selected for calculation, and details will not be repeated here.

As above, the curved corner screen image processing method, screen component and computer storage medium provided by the present application can quickly obtain the gamma of each target pixel grid, so as to eliminate the jagged edges and color casts after being cut on the curved corners of the mobile phone screen problem, effectively improving the display effect.

The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structures or equivalent process transformations made by using the contents of the specification and drawings of this application, or directly or indirectly used in other related technical fields , are all included in the patent protection scope of the present application in the same way.

Claims (3)

1. A screen image processing method of a curved angle, characterized in that, with the center of the curve as the origin of the coordinate system, the curved arc of the curved angle is placed in the plane coordinate system, and the pixel grid intersected with the curved arc is the target pixel Grid, the method includes: in response to obtaining the first intersection coordinates and the second intersection coordinates of the curved arc and each row or column of the target pixel grid, according to the first intersection coordinates of each row or each column of the target pixel grid calculating the gamma of each target pixel grid with the coordinates of the second intersection point; processing the image data according to the gamma of the target pixel grid; The step of calculating the gamma of each target pixel grid according to the first intersection coordinate and the second intersection coordinate of each row or column of the target pixel grid includes: from the target pixel grid area of each row or column Carry out a straight line connection from the first intersection point to the second intersection point to obtain a fitted line segment; calculate each pixel according to the similarity of multiple triangles in the region formed by the same row or column of the target pixel grid area cut by the fitted line segment The first area of the grid that is not cut by the fitting line segment; calculating the ratio of the first area to the total area of each pixel grid to obtain the gamma of the target pixel grid; Before the step of processing the image data according to the gamma of the target pixel grid, it includes: rounding the product of each gamma multiplied by the smoothing order to obtain the coefficient storage number; in response to obtaining the coefficient Storage number, allocate a storage field for each row or column of the target pixel grid; in the Nth row or Nth column of the A target pixel grid, from the first location of the Nth row or Nth column storage field to the first In the A+1 area of the A+1 area, the number A of the target pixel grid in the Nth row or Nth column and the coefficient storage number of the A target pixel grid in the Nth row or Nth column are respectively written, as Write the coefficient storage number into the memory; wherein, N is a positive integer, and A is a positive integer; Wherein, when calculating the target pixel grid of the Nth row in the first quadrant, the side length of each pixel grid area is set to be 1, wherein, N is a positive integer, the first intersection point is the upper intersection point, and the second intersection point is the lower intersection point; the step of calculating the first area of each pixel grid that is not cut by the fitting line segment includes: the horizontal axis coordinates of the upper intersection point and the lower intersection point horizontal axis coordinates of the curved arc and the Nth row are both When it is an integer, the first area of each pixel grid in the Nth row is calculated according to the similarity of the triangle; and/or, the abscissa coordinate of the upper intersection point between the curved arc and the Nth row is an integer, When the horizontal axis coordinate of the lower intersection point is not an integer, obtain the fractional part of the horizontal axis coordinate of the lower intersection point, and calculate each pixel in the Nth row according to the similarity between the fractional part of the horizontal axis coordinate of the lower intersection point and the triangle The first area of the grid; and/or, the horizontal axis coordinates of the upper intersection point of the curve arc and the Nth row are not integers, and when the horizontal axis coordinates of the lower intersection point are integers, the decimal part of the upper intersection point horizontal axis coordinates is obtained, according to Rectangular area formula, the fractional part of the horizontal axis coordinates of the upper intersection point and the similarity of the triangle to calculate the first area of each pixel grid in the Nth row; and/or, the curved arc and the Nth row When neither the horizontal axis coordinates of the intersection point nor the horizontal axis coordinates of the intersection point are integers, the decimal part of the horizontal axis coordinates of the intersection point and the decimal part of the horizontal axis coordinates of the intersection point are obtained, and then according to the rectangular area formula, the decimal part of the horizontal axis coordinates of the intersection point, and the decimal point of the horizontal axis coordinates of the intersection point The fractional part of the axis coordinates and the triangle similarity calculate the first area of each pixel grid of the Nth row. 2. A screen assembly with a curved angle, characterized in that it includes an image driver, an image processor and a curved angle screen; the image driver is used to send image data to the image processor, so that the image processor controls The image data is displayed on the curve angle screen; the image processor is used to: take the center of the curve as the origin of the coordinate system, place the curve arc of the curve angle in the plane coordinate system, and the pixel grid intersecting with the curve arc is The target pixel grid, in response to obtaining the first intersection coordinates and the second intersection coordinates of the curve arc and each row or column of the target pixel grid, according to the first intersection coordinates and the second intersection coordinates of each row or each column of the target pixel grid calculating the gamma of each target pixel grid at the intersection coordinates, and processing the image data according to the gamma of the target pixel grid; The image processor is also used for: performing a straight line connection from the first intersection point to the second intersection point of each row or column of the target pixel grid area to obtain a fitted line segment; The similarity of a plurality of triangles in the area formed by cutting the fitting line segment, calculating the first area of each pixel grid that is not cut by the fitting line segment; calculating the ratio of the first area to the total area of each pixel grid , to obtain the gamma of the target pixel grid; The image processor is also used for rounding the product of each gamma coefficient multiplied by the smoothing order to obtain the coefficient storage number; in response to obtaining the coefficient storage number, assign a target pixel grid for each row or column Storage field; in the A target pixel grid of the Nth row or Nth column, from the first location of the Nth row or Nth column storage field to the A+1th location of the A+1th location, respectively write Enter the number A of the target pixel grid of the Nth row or the Nth column and the coefficient storage number of the A target pixel grid of the Nth row or the Nth column, so as to write the coefficient storage number into the memory; wherein, N is A positive integer, A is a positive integer; Wherein, the image processor is also used for: when calculating the target pixel grid of the Nth row in the first quadrant, set the side length of each pixel grid area to be 1, wherein, N is a positive integer, and the first intersection point is the upper intersection point, and the second intersection point is the lower intersection point; the step of calculating the first area of each pixel grid that is not cut by the fitting line segment includes: the curved arc is transverse to the upper intersection point of the Nth row When the axis coordinates and the horizontal axis coordinates of the lower intersection point are both integers, the first area of each pixel grid in the Nth row is calculated according to the similarity of triangles; and/or, the curve arc and the Nth row are all When the abscissa coordinate of the upper intersection point is an integer and the abscissa coordinate of the lower intersection point is not an integer, obtain the fractional part of the abscissa coordinate of the lower intersection point, and calculate according to the similarity between the fractional part of the abscissa coordinate of the lower intersection point and the triangle The first area of each pixel grid in the Nth row; and/or, when the abscissa coordinates of the upper intersection point between the curved arc and the Nth row are not integers, and the abscissa coordinates of the lower intersection point are integers, the upper The decimal part of the horizontal axis coordinates of the intersection point, according to the rectangular area formula, the decimal part of the upper intersection point horizontal axis coordinates and the similarity of the triangle to calculate the first area of each pixel grid in the Nth row; and/or, the curved arc When the horizontal axis coordinates of the upper intersection point and the horizontal axis coordinates of the lower intersection point in the Nth row are not integers, obtain the fractional part of the horizontal axis coordinates of the upper intersection point and the fractional part of the horizontal axis coordinates of the lower intersection point, and then according to the rectangle The area formula, the fractional part of the horizontal axis coordinate of the upper intersection point, the fractional part of the horizontal axis coordinate of the lower intersection point and the similarity of the triangles are used to calculate the first area of each pixel grid in the Nth row. 3. A computer storage medium, wherein a computer program is stored on the computer storage medium, and when the computer program is executed by a computer, the screen image processing method according to claim 1 can be realized.

Images