CN113687806B

CN113687806B - DeMura method of display screen, display screen and storage medium

Info

Publication number: CN113687806B
Application number: CN202110946879.9A
Authority: CN
Inventors: 曹弘圭; 施伟; 廖欢
Original assignee: Shenghe Microelectronics Zhaoqing Co ltd
Current assignee: Shenghe Microelectronics Zhaoqing Co ltd
Priority date: 2021-08-17
Filing date: 2021-08-17
Publication date: 2025-01-21
Anticipated expiration: 2041-08-17
Also published as: CN113687806A

Abstract

The application discloses a DeMura method of a display screen, the display screen and a storage medium. The method comprises the steps of obtaining a pixel area of a display screen, detecting the pixel area to obtain Mura data of the pixel area, determining at least two different pixel areas according to the Mura data, carrying out module division on the at least two different pixel areas by using different division sizes, and carrying out DeMura (Mura compensation) on the divided pixel areas, so that the consumption of a storage of compensation data can be reduced while the performance of a Demura system is ensured.

Description

DeMura method of display screen, display screen and storage medium

Technical Field

The application relates to the technical field of display, in particular to a DeMura method for a display screen, the display screen and a storage medium.

Background

Mura is a process that occurs during the fabrication of OLED or LCD display devices due to imperfections in process technology, resulting in brightness differences of the display devices, creating various flaws. DeMura systems refer to methods or algorithms that effectively remove Mura present on OLED, LCD displays. Typically DeMura algorithms are implemented inside the DDI (display driver chip), mura compensation is performed for all pixels of the display device. However, if DeMura were performed on all pixels of an OLED, LCD display, the required amount of DDI internal and external memory for storing compensation data would be greatly increased and the cost would be too high.

Disclosure of Invention

In view of this, embodiments of the present application provide a method for a display screen DeMura, a display screen, and a storage medium, which can reduce the storage usage of compensation data while ensuring the performance of the Demura system.

In a first aspect, the present application provides a method for DeMura of a display screen, including:

Acquiring a pixel area of a display screen;

detecting the pixel area to obtain Mura data of the pixel area;

Determining at least two different pixel regions from the Mura data;

Performing module division on the at least two different pixel areas by using different division sizes;

And carrying out DeMura on the divided pixel areas.

Optionally, the module dividing the at least two different pixel areas using different division sizes includes:

The pixel areas with more Mura are divided by using a smaller dividing size;

The pixel areas with less Mura are divided by using a larger dividing size.

Optionally, the module dividing the pixel area with more Mura by using a smaller dividing size includes:

Carrying out module division on the pixel area with more Mura by using a division size of 1x1 or 2x 2;

the module division of the pixel area with less Mura by using a larger division size comprises the following steps:

the smaller Mura pixel areas are divided in modules using a division size of 4x4 or 8x8 or 16x16 or 32x 32.

Optionally, the performing DeMura on the divided pixel area includes:

Generating Mura compensation data by adopting a polynomial compensation mode;

and performing Mura compensation on the divided pixel areas by using the Mura compensation data.

Optionally, the polynomial compensation includes at least one of a 1 st order polynomial compensation, a2 nd order polynomial compensation, and a3 rd order polynomial compensation.

Optionally, the performing DeMura on the divided pixel area includes:

searching Mura compensation data by using an LUT (look-up table) mode, and encoding the Mura compensation data according to the raster scanning direction;

and carrying out lossless compression on the encoded Mura compensation data.

Optionally, the encoded Mura compensation data includes prefix bits and suffix bits.

Optionally, the performing DeMura on the divided pixel area further includes:

And decoding the suffix bits of the compressed Mura compensation data according to the raster scanning direction.

In a second aspect, an embodiment of the present application provides a display screen, where the display screen includes a memory and a processor, where the memory stores a DeMura program, and the DeMura program when executed by the processor implements the steps of the DeMura method of the display screen according to the first aspect.

In a third aspect, an embodiment of the present application provides a readable storage medium having a DeMura program stored thereon, the DeMura program, when executed by a processor, implementing the steps of the DeMura method of the display screen according to the first aspect.

According to the DeMura method of the display screen, the pixel areas are detected by acquiring the pixel areas of the display screen, so that Mura data of the pixel areas are acquired, at least two different pixel areas are determined according to the Mura data, at least two different pixel areas are divided by using different dividing sizes, deMura (Mura compensation) is carried out on the divided pixel areas, and therefore the consumption of a storage of compensation data can be reduced while the performance of a Demura system is ensured.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow chart of a method DeMura of a display according to one embodiment of the present application;

FIG. 2 is a schematic diagram of a DeMura system according to one embodiment of the present application;

FIG. 3 is a schematic diagram of reference gray values according to an embodiment of the present application;

FIG. 4 is a flow chart illustrating the sub-steps of step S400 according to an embodiment of the present application;

FIG. 5 is a schematic diagram of the module division of a pixel region according to an embodiment of the application;

FIG. 6 is a flow chart illustrating the sub-steps of step S500 according to an embodiment of the present application;

FIG. 7 is a flow chart illustrating a sub-step of step S500 according to another embodiment of the present application;

FIG. 8 is a schematic diagram of searching Mura compensation data and encoding according to an embodiment of the present application;

FIG. 9 is a diagram of coding Mura compensation data of a 16×16 module according to an embodiment of the present application;

Fig. 10 is a schematic diagram of dividing a 16×16 module with 32 gray values according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be clearly and completely described below with reference to the embodiments and the accompanying drawings. It is apparent that the described embodiments are only some embodiments, not all embodiments. The various embodiments described below and their technical features can be combined with each other without conflict.

Typically, to implement DeMura systems, DDI internal storage uses SRAM storage and external storage uses flash memory. After the compensation data is stored in the external flash memory, the compensation data is read from the flash memory at power-on, copied and used in the internal SRAM. Since SRAM is required to be used inside the DDI, and flash memory is used outside, the Demura system generally becomes a factor for increasing the display cost of the OLED and LCD. However, by using Demura system, the yield of the display screen finished product in quality inspection can be increased, and the performance of the display screen can be improved. Particularly in the manufacturing industry, the demand for applying Demura systems on large-sized mobile phone display screens is increasing, because the yield is an important index of sales profits.

Generally, smaller module sizes achieve better performance on a component Demura system. Finally, if Demura is formed in units of all 1 pixel, the best Demura results are obtained. However, if the 1x1 module is used, i.e., demura is performed in 1 pixel minimum units, the external flash memory and internal SRAM memory requirements are maximized. That is, the larger the size of the module, the fewer the number of modules, and finally the amount of external flash memory and internal SRAM memory is reduced, thus achieving the most efficient Demura system.

Based on the above, the application provides a DeMura method of a display screen, a display screen and a storage medium, which firstly acquire Mura data of pixel areas, determine at least two different pixel areas according to the Mura data, carry out module division by using smaller division sizes in the pixel areas with more Mura, carry out module division by using larger division sizes in the pixel areas with less Mura, and then carry out Mura compensation, so that the consumption of a storage of compensation data can be reduced while the performance of a Demura system is ensured.

In a first aspect, an embodiment of the present application provides a method DeMura of a display, as shown in fig. 1, where the method includes:

Step S100, acquiring a pixel area of a display screen;

step 200, detecting the pixel area to obtain Mura data of the pixel area;

step S300, determining at least two different pixel areas according to Mura data;

Step 400, performing module division on at least two different pixel areas by using different division sizes;

and S500, carrying out DeMura on the divided pixel areas.

In some embodiments, the DeMura method of the present embodiment is applied to a display screen, by acquiring a pixel area of the display screen, detecting the pixel area to acquire Mura data of the pixel area, determining at least two different pixel areas according to the Mura data, performing module division on the at least two different pixel areas by using different division sizes, and performing DeMura on the divided pixel areas, so that the consumption of a storage of compensation data can be reduced while ensuring the performance of a Demura system.

As shown in fig. 2, a schematic diagram of the Demura system is shown. 100 is Demura systems. 110 is Demura encoder, or Mura compensation data generator. 120 is Demura decoder, or Mura data compensator. 111 is a display device with Mura, such as an OLED, LCD, etc., that can display an image. 112 is a Mura data capturing device, which refers to a camera device that detects Mura of a display device, and can extract R, G, B luminance data of an image. Reference numeral 113 denotes a Mura compensation data generating module which generates Mura compensation data by using an optimal method of Mura compensation in various ways. And 114 is a Mura compensation data storage module for storing Mura compensation data in a flash memory externally connected to a DDI installed on the OLED display device through the DDI. 121 is a Mura compensation data copying module operative to copy Mura compensation data from the flash memory to the internal SRAM memory. 122 is a Mura compensation module for performing Mura compensation using the Mura compensation data. And 123 is a display module for displaying the Mura compensated image.

In some embodiments, to correct Mura of an OLED, LCD screen, it is first necessary to detect Mura of the display screen with a special camera. In this case, although it is preferable to perform Mura detection on all the gradation values of 0 to 255, it is practically impossible to use excessive resources due to the processing time and the use of Mura compensation. Thus, only a few reference gray values are Mura detected and their data are used to construct an efficient Mura compensation algorithm. As shown in FIG. 3, a schematic diagram of specific reference gray values includes 32-gray values, 64-gray values, 96-gray values, 128-gray values, 160-gray values, 192-gray values, 224-gray values. As described above, mura data (luminance) is obtained by a camera for a specific value (32, 64, 96, 128, 160, 192, 224) of R, G, B gradation values.

In some embodiments, as shown in fig. 4, step S400 includes:

step S410, carrying out module division on the pixel areas with more Mura by using smaller division sizes;

step S420, module division is carried out on the pixel areas with less Mura by using larger division sizes.

In some embodiments, the pixel area with more Mura is divided by using a smaller dividing size to perform module division, so that Demura can be performed on all Mura better, and better performance is achieved. The larger dividing size is used for carrying out module division on the pixel area with less Mura, so that the memory consumption of compensation data can be reduced.

In some embodiments, step S410 includes:

carrying out module division on the pixel areas with more Mura by using division sizes of 1x1 and/or 2x 2;

Step S420 includes:

The pixel areas with less Mura are divided by using the dividing size of 4x4 and/or 8x8 and/or 16x16 and/or 32x 32.

In some embodiments, as shown in fig. 5, the pixel regions with more Mura are divided into modules using a division size of 1x1 and/or 2x2, and the pixel regions with less Mura are divided into modules using a division size of 4x4 and/or 8x8 and/or 16x16 and/or 32x 32. The above-mentioned dividing size may be adjusted according to actual situations, and this embodiment is not limited thereto.

In some embodiments, the division into 32x32 and 16x16 modules is a Mura-less module. That is, since there is less Mura, the Mura data captured by the modules with the camera has equal values or very fine differences. The Mura values for the 8x8 modules are less uniform than for the 16x16 modules, but the values within the partitioned 8x8 modules are similar. Among the 8x8 blocks, the blocks with non-uniform Mura values (too large difference in values) for all the corresponding pixels are subdivided into 4x4 blocks. Such a process is divided by 2x2 modules, eventually proceeding to 1x1 modules that cannot be subdivided. Specifically, it is determined whether a 16x16 module needs to be divided into 48 x8 modules, and 256 Mura pixel values within the 16x16 module need to be analyzed. The method for determining whether to divide 48 x8 blocks is to use the statistics of all Mura pixels of 16x16 blocks. For example, calculate the average, standard deviation, minimum, maximum, etc., and ultimately analyze how large the Mura is, if the Mura is greater than a predetermined standard, then divide into 4 smaller modules, otherwise the modules remain the same.

In some embodiments, as shown in fig. 6, step S500 includes:

step S510, generating Mura compensation data by adopting a polynomial compensation mode;

Step S520, mura compensation is performed on the divided pixel areas by using Mura compensation data.

In some embodiments, with Mura display devices, the target luminance is different from the actual luminance. Thus, to compensate for the differences, various methods are used to generate Mura compensation data. Typically the brightness distribution of the display device is characterized by a gamma 2.2 curve. Since the gamma characteristics of the display device with Mura are different from the gamma 2.2 curve, it is necessary to compensate for the difference. The Mura compensation method of the OLED display device generally adopts a polynomial compensation mode. Polynomial compensation includes at least one of polynomial compensation of degree 1, polynomial compensation of degree 2, polynomial compensation of degree 3, namely a way of modeling and compensating differences of the gamma 2.2 curve and an actual gamma characteristic curve of the display device using the polynomial of degree 1, the polynomial of degree 2, and the polynomial of degree 3. Mura compensation data is typically constructed with a polynomial of order 2. The values of a, b, c can be found by modeling [ diff_Gamma=ideal_Gamma-real_Gamma ] using a polynomial such as Y=ax≡2+bx+c. The values of a, b, c are stored in flash memory in a suitable form to compensate for Mura. If a, b, c are calculated for all pixels, the storage requirement is too high. Therefore, after dividing the data into modules such as 32x32, 16x16, 8x8, 4x2, and 2x2, the same values of a, b, and c are obtained and used for the modules, and thus the storage requirement is reduced. And (3) adjusting gray values of the actual gamma curve which does not accord with the gamma 2.2 curve to enable the actual gamma curve to be consistent with the gamma 2.2 curve, so as to realize Mura compensation.

In some embodiments, as shown in fig. 7, step S500 includes:

Step S530, searching Mura compensation data by utilizing an LUT lookup table mode, and encoding the Mura compensation data in cooperation with a raster scanning direction;

and S540, carrying out lossless compression on the encoded Mura compensation data.

In some embodiments, the Mura compensation data is searched using a Look-Up Table (LUT) Look-Up Table, and encoded in coordination with the raster scan direction. As shown in fig. 8, the divided 16×16 modules are searched for Mura compensation data and encoded. 810 in fig. 8 shows the result of the final division of the 16x16 module into 8x 8-1 x1 modules. 811 denotes an order in which Mura compensation data of the divided modules are encoded. The Mura compensation data find the most suitable item in 256 LUTs (Look-Up tables) defined in advance and distribute. In this case, the LUT may be formed by a plurality of other methods besides vector quantization or clustering.

Referring to fig. 8, it can be seen first at 820 that the 16x16 module is divided into 48 x8 modules, with the Mura compensation data for the 16x16 module assigned to 0xFF. This value is an entry for 256 LUTs. 0xFF is not a direct Mura compensation data value, but a special value that refers to the module being partitioned. That is, if a 0xFF value occurs, it means that the current module is divided into 4 small modules. 830 shows 48 x8 modules. Here, a module with a value of 0xYY indicates that the appropriate value is found in the LUT. That is, a value of 0xYY refers to any value of 0x00 to 0xfe in 16 scale. A module with a value of 0xYY means that it is not split into smaller modules anymore. These modules with a value of 0xYY mean that all pixels within the module have the same or similar value and are therefore Mura-less modules, which do not need to be subdivided. Only the 8x8 block in the upper right corner of 830 has a 0xFF value, and none of the other 3 blocks are subdivided. In 840, the 8x8 module, which is distinguished as 0xFF, is subdivided into 4x4 modules. Likewise, the 3 modules with a value of 0xYY are not subdivided, and only the 4x4 module in the upper right corner is subdivided into 42 x2 modules. At 850, a morphology divided into 42 x2 modules may be confirmed. The last 860 indicates that 12 x2 module is divided into 41 x1 modules.

Referring to fig. 9, the coding sequence of the Mura compensation data of each module after 116 x16 module is divided into 8x8 to 1x1 modules according to the degree of Mura is shown in detail. The center of the 16x16 module has a dot. This dot represents the corresponding encoded data of the module. The arrows indicate the order in which the 16x16 modules are encoded when they are split into 16x 16-8 x 8-4 x 4-2 x 2-1 x 1. Encoding is performed on each dot from start to end. Combining 860 of fig. 8 with fig. 9, it can be appreciated that this is encoded with the table of fig. 9. The module level indicates which module each encoded value corresponds to. That is, 16 refers to a 16×16 module, and the corresponding encoded value is FF. The actual encoded data does not contain module level values. But from the coding level value we can know exactly the module level of the current coding value and use this information to perform Mura compensation.

In some embodiments, referring to fig. 10, it is shown how the 16x16 modules of 32 gray values are partitioned. The 8x8 modules all carry a gray value of 32. A gray value of 32 in all indicates no Mura and therefore no longer needs to be split into smaller modules. 1010. 1020, 1030 indicates that there are Mura in 18 x8 block, the gray value is not 32, and the value of several pixels is more or less than 32, so it is divided into 4x4, 2x2, 1x1 blocks. The 4x4 block in 1010 is not all 32 but 2 of the 16 pixel values are 33, 1 and 31, and therefore is composed of similar values, and the average value of the 4x4 block is close to 32. The module does not continue to divide into 42 x2 modules. Instead, the individual pixel values within 1020, 1030 exhibit a variety of distributions. Therefore, the modules Mura are more, and are composed of values that differ greatly from 32. The 2x2 block of 1020 is made up of 3 32, 1, 33 pixels and is no longer divided into 1x1 blocks. The 1040 module has a value of 4 pixels greater than 32, and 3 38 and 1 37. But the 2x2 module does not continue to divide into 1x1 modules. The reason is that the pixel values, although larger than the ratio 32, are all composed of similar values. As such, although the average value is greater than 32, the modules with smaller average deviations need not be divided into smaller modules. Because the module can use one LUT entry for Mura compensation. However, in the case of a 2x2 module like 1030, where all values are different, the standard deviation is large, and the difference between the minimum value and the maximum value is also large, that is, the module is the most serious module of Mura. The module needs to be split into the final 1x1 module and processed to perform Mura compensation well.

In some embodiments, mura compensation needs to be performed in the direction and order of raster scanning, so the order of fig. 9 is applied in conjunction with the order of raster scanning. The encoded data is encoded by actual data of 0-8 rows of raster scan lines. The matched data are listed in sequence along the raster scan 0 row, and the coded data can be obtained. The encoded data is read and processed sequentially in a Mura decoder.

In some embodiments, the Mura compensation data is obtained using a method of module partitioning, which necessarily results in a large number of module partitioning code (0 xFF) values. A corresponding number of 0xFF values are also generated, depending on the number of partitioning modules. The divided modules are encoded with a 0xFF value. When the prefix code value is 0, 0xFF may be allocated, with 1 bit replacing the 1 byte value 0xFF. Prefix code 10, i.e., a 0x2 value, consists of 4 bits, which may represent a maximum of 16 values. Thus, an 8-bit value can be expressed by 6 bits, and thus the effect of data compression can be obtained. The reason for this is to allocate a smaller number of bits to the index with a higher frequency on the structure of the LUT. In most cases, the histogram frequency recorded in the values between 0 and 15 is high, so that the data compression efficiency can be greatly improved. The indexes with smaller frequency numbers are respectively allocated to the prefix codes 1100, 1101, 1110 and 1111 by 16, 32, 64 and 128, so that lossless data compression is realized.

In some embodiments, the encoded Mura compensation data includes prefix bits and suffix bits.

In some embodiments, step S500 further comprises:

In some embodiments, the encoded Mura compensation data includes prefix bits and suffix bits, as described above. The Demura decoder needs to restore R, G, B-compensated data compressed with lossless compression codes to the original state. In order to restore the compressed code to original state, after detecting the prefix code in the decoder, the suffix bit is decoded according to the raster scanning direction, and the original Mura compensation code can be obtained.

In some embodiments, decoding is performed in raster scan order, meaning that decoding is performed row by row. For example, assuming that the first module is divided into 8x8, the Mura compensation data of the 8x8 module needs to be maintained until all decoding of the 8 lines is completed.

In a second aspect, an embodiment of the present application provides a display screen, including a memory and a processor, wherein the memory has a DeMura program stored thereon, and the DeMura program when executed by the processor implements the steps of the DeMura method of the display screen according to the first aspect.

In some embodiments, the DeMura method of the display screen according to the first aspect is applied to the display screen, so that the display effect of the image can be effectively improved. The specific implementation process is referred to the description of the first aspect, and will not be repeated here.

In some embodiments, the display screen may be an OLED display screen, an LCD display screen, or the like.

In a third aspect, an embodiment of the present application provides a readable storage medium having a DeMura program stored thereon, which DeMura program, when executed by a processor, implements the steps of the DeMura method of the display according to the first aspect.

Those of ordinary skill in the art will appreciate that the functional modules/units in the systems, devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof.

In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components, for example, one physical component may have a plurality of functions, or one function or step may be cooperatively performed by several physical components. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.

Although the application has been shown and described with respect to one or more implementations, equivalent alterations and modifications will occur to others skilled in the art based upon a reading and understanding of this specification and the annexed drawings. The present application includes all such modifications and alterations and is limited only by the scope of the following claims. In particular regard to the various functions performed by the above described components, the terms used to describe such components are intended to correspond, unless otherwise indicated, to any component which performs the specified function of the described component (e.g., that is functionally equivalent), even though not structurally equivalent to the disclosed structure which performs the function in the herein illustrated exemplary implementations of the specification.

That is, the above embodiments are only some embodiments of the present application, and not limiting the scope of the application, and all equivalent structures or equivalent processes using the descriptions of the present application and the accompanying drawings, such as the combination of technical features of the embodiments, or direct or indirect application in other related technical fields, are included in the scope of the present application.

Without further limitation, an element defined by the phrase "comprising one does not exclude the presence of other like elements in a process, article or apparatus that comprises the element, and further, elements having the same meaning may have different meanings, or components having the same names in different embodiments, whose specific meaning is to be determined by its interpretation in this particular embodiment or further in connection with the context of this particular embodiment.

In addition, although the terms "first, second, third," etc. are used herein to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well. The terms "or" and/or "are to be construed as inclusive, or mean any one or any combination. An exception to this definition will occur only when a combination of elements, functions, steps or operations are in some way inherently mutually exclusive.

In the present application, the word "in some embodiments" is used to mean "serving as an example, instance, or illustration. Any embodiment described herein as "in some embodiments" is not necessarily to be construed as preferred or advantageous over other embodiments. The previous description is provided to enable any person skilled in the art to make or use the present application. In the above description, various details are set forth for purposes of explanation. It will be apparent to one of ordinary skill in the art that the present application may be practiced without these specific details. In other instances, well-known structures and processes have not been shown in detail to avoid unnecessarily obscuring the description of the application. Thus, the present application is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

Claims

1. A method of DeMura of a display screen, comprising:

Acquiring a pixel area of a display screen;

detecting the pixel region with a specific reference gray value to obtain Mura data of the pixel region, wherein the specific reference gray value is 32, 64, 96, 128, 160, 192 and 224;

Determining at least two different pixel regions from the Mura data;

the at least two different pixel areas are divided by using different dividing sizes, wherein the method comprises the steps of dividing the pixel areas with more Mura by using a smaller dividing size, and dividing the pixel areas with less Mura by using a larger dividing size;

The step DeMura of dividing the pixel area includes searching Mura compensation data by using an LUT lookup table mode, encoding the Mura compensation data according to a raster scanning direction, wherein the encoded Mura compensation data comprises prefix bits and suffix bits, performing lossless compression on the encoded Mura compensation data, and decoding the suffix bits of the compressed Mura compensation data according to the raster scanning direction.

2. The method of claim 1, wherein the modular division of the Mura-rich pixel area using smaller division sizes comprises:

3. The method of claim 1, wherein said DeMura of dividing the pixel region comprises:

Generating Mura compensation data by adopting a polynomial compensation mode;

4. A method of DeMura for a display screen according to claim 3, wherein the polynomial compensation comprises at least one of a 1 st order polynomial compensation, a 2 nd order polynomial compensation, a 3 rd order polynomial compensation.

5. A display screen comprising a memory and a processor, wherein the memory has a DeMura program stored thereon, the DeMura program when executed by the processor performing the steps of the method DeMura of the display screen of any one of claims 1 to 4.

6. A readable storage medium having a program DeMura stored thereon, which DeMura program when executed by a processor performs the steps of the method DeMura of the display screen of any one of claims 1to 4.