Demura data storage method and display device
By dividing the pixel units of the display panel into rectangular areas, and encoding and compressing their position information and compensation values, the space and speed problems when storing and extracting Mura compensation data in the prior art are solved, and more efficient data is achieved Storage and fast compensation process.
Patent Information
- Application Number
- CN202410716746.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-04
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2044-06-04
AI Technical Summary
When storing and extracting Mura compensation data from the display panel, the data volume is large, the storage space occupies a large amount, and the access speed is slow, which affects the performance of the display device.
By dividing the pixel units of the display panel into several rectangular areas according to the Mura compensation value, and encode and compress the position information and compensation value of the rectangular area, it is stored in flash memory. The encoding step includes sorting by row and column, and setting increments in the column direction to reduce the size of stored data.
It effectively reduces the use of storage space, improves the access speed of data, and improves the performance and display effect of the display device.
Smart Images

Figure CN118486255B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of image processing, and in particular to a Demura data storage method and a display device. Background Art
[0002] During the manufacturing process, the relevant parameters of the light-emitting unit of the display screen may deviate from the design value, resulting in a deviation between the light-emitting brightness and the ideal value, which in turn causes the display effect to deteriorate. This display defect caused by manufacturing, which mainly manifests itself in the display brightness of the display screen deviating from the set value, thereby damaging the correct display of the picture, is called Mura.
[0003] The presence of Mura will reduce the display quality of the display screen and thus reduce the product yield. Therefore, this deviation will be quantified during the production process of the display screen, and then the Demura (Mura elimination) method will be used to extract the brightness of the display panel, calculate the compensation data, and perform external compensation for the Mura defects that appear in the production of the display screen, reduce or eliminate the Mura defects, and improve the display effect and yield of the product. For example, the Mura compensation value of each module is calculated and stored in an external storage unit. During the display stage, the Mura compensation value of each module is read from the storage unit to perform pixel compensation. In this regard, due to the large number of modules, the amount of storage information of the compensation data of all modules calculated is large, which places a large demand on the storage capacity of the storage unit, etc., and is not conducive to improving the real-time performance of pixel compensation.
[0004] Therefore, there are a lot of research on the effective storage and extraction of demura data. For example, the patent application CN112927640 A proposes a data compression method and storage device for local compensation of uneven brightness of a display screen. The brightness uneven compensation value of each screen block of the display screen is compressed in a corresponding data compression mode to obtain a compressed brightness uneven compensation value of each screen block of the display screen. However, the method is complex and the data compression is limited. Summary of the invention
[0005] In order to solve the above technical problems, the present invention provides a DeMura data storage method and a display device.
[0006] A Demura data storage method, comprising:
[0007] Dividing the pixel units of the display panel into a plurality of rectangular areas according to the Mura compensation value, wherein the Mura compensation value of the pixel units in the same rectangular area is within a set range;
[0008] Obtaining position information of the rectangular area and a mura compensation value of the rectangular area, wherein the position information includes starting row information and starting column information, and the length and width of the rectangular area;
[0009] After encoding the position information of the rectangular area, or encoding the Mura compensation value of the rectangular area, the Mura compensation value of the rectangular area is stored;
[0010] The encoding step comprises:
[0011] Sort the rectangular areas according to row information, and if the row information is the same, sort them according to column information;
[0012] Compress the rectangular area with the same row information and set the column increment.
[0013] The advantages of the present invention are:
[0014] Sorting and sorting the rectangular information helps to further analyze and compress the data. The arranged data is more convenient for incremental encoding, further compressing the size of the data to be stored.
[0015] During decoding, the sorted data can be quickly retrieved.
[0016] When arranged in the order of rows first and columns later, it conforms to the characteristic of displaying information in rows, and facilitates rapid positioning compensation of display data. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The above and other objects, features and advantages of the present invention will become more apparent through a more detailed description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, wherein like reference numerals generally represent like components throughout the exemplary embodiments of the present invention.
[0018] Figure 1 A schematic diagram of the steps of the Mura data storage method of the present invention;
[0019] Figure 2 A schematic diagram of an embodiment of a mura data storage method of the present invention;
[0020] Figure 3 FIG. 4 is a schematic diagram of an embodiment of a mura data storage method of the present invention. DETAILED DESCRIPTION
[0021] As described in the background, the existing storage method of the Mura compensation value of the display panel requires a large storage space due to the large amount of data. If the storage space is limited, the accuracy has to be sacrificed to reduce the amount of data. Therefore, there are many disadvantages in terms of access speed and storage space occupation, which is not conducive to improving the performance of the display device. Therefore, the inventor studied a method that is more conducive to reducing the storage space occupation and speeding up the access speed in the experiment. Through the effective partitioning of multiple display panels and compressing the data according to the partitions, on the one hand, the storage space occupation is reduced, and on the other hand, the retrieval speed is accelerated in the data call of the Demura process.
[0022] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention, so that the advantages and features of the present invention can be more easily understood by those skilled in the art, thereby making a clearer and more explicit definition of the protection scope of the present invention. Obviously, the embodiments described in the present invention are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.
[0023] In this application, the use of "or" means "and / or" unless otherwise stated. Furthermore, the use of the term "include" and other forms such as "include" are not limiting. In addition, unless specifically stated otherwise, terms such as "element" or "component" encompass both elements and components that include one unit and elements and components that include more than one unit.
[0024] like Figure 1 As shown, the present invention provides a Demura data storage method and a display device, which include:
[0025] Dividing the pixel units of the display panel into a plurality of rectangular areas according to the Mura compensation value, wherein the Mura compensation value of the pixel units in the same rectangular area is within a set range;
[0026] Obtaining position information of the rectangular area and a mura compensation value of the rectangular area, wherein the position information includes starting row information and starting column information, and the length and width of the rectangular area;
[0027] After encoding the position information of the rectangular area, or encoding the mura compensation value of the rectangular area, the encoding step includes:
[0028] Sort the rectangular areas according to row information, and if the row information is the same, sort them according to column information;
[0029] Compress the rectangular area with the same row information and set the column increment.
[0030] Specifically, the largest rectangular area that meets the Mura compensation value requirements is found, and the division of the rectangular area includes the steps of: counting the Mura compensation values in a single dimension; and reducing the counted Mura compensation values in a second dimension. In this embodiment, optional, please refer to Figure 2 , taking two Mura compensation values 0 and 1 as an example, 0-6 in the figure represent the count values of pixel units whose Mura compensation values in the column direction are continuously 1. The steps of dividing the rectangular area are specifically described. In this embodiment, the pixel unit (1, 1) in the first row and first column of the display panel is first used as the starting pixel unit, and the Run-Length Encoding (RLE) algorithm and the properties of the monotone stack are used to degrade the solution of the maximum rectangle problem into first counting the same type of Mura compensation values in a single dimension. Figure 2 As shown, the red frame part represents taking the first row as the baseline, and counting the number of Mura compensation values that continuously meet the threshold range at and above the baseline in each column. From the first row, the Mura compensation values of the pixel units are: 0, 0, 1, 1, 0, 0, 0, 0.
[0031] The yellow frame represents the second row as the baseline. The number of Mura compensation values that continuously meet the threshold range at and above the baseline in each column is counted. At this time, there are the first row and the second row. The Mura compensation values of the pixel units are: 0, 1, 2, 2, 1, 1, 0, 0.
[0032] The blue frame part represents taking the third row as the baseline and counting the number of Mura compensation values that continuously meet the threshold range at and above the baseline in each column. At this time, there are the first row, the second row, and the third row. The Mura compensation values of the pixel units are 0, 2, 3, 3, 2, 2, 2, 0, respectively.
[0033] And so on, until the statistics of the entire map are completed.
[0034] The counted Mura compensation data is then reduced in the second dimension to calculate the area and position information of the largest rectangle.
[0035] Then, the position information of the rectangular area and the Mura compensation value of the rectangular area are obtained. The Mura compensation value of the rectangular area is the Mura compensation value obtained by weighting the Mura compensation values of the pixel units in the rectangular area. For example, the Mura compensation value of the rectangular area can be: the Mura compensation value of the starting pixel unit in the rectangular area, the average value of the Mura compensation values of the pixel units in the rectangular area, the average value or rounding up / down of the Mura compensation values of the pixel units in the rectangular area, the sum of the Mura compensation values of the pixel units in the rectangular area, or the Mura data obtained by weighted calculation based on the Mura compensation values of the pixel units in the rectangular area. In short, there are many possibilities for the Mura compensation value obtained according to a certain weighting algorithm, all of which are within the protection scope of the present invention, and the examples of the present invention do not limit the protection scope.
[0036] Optionally, the method includes the steps of adjusting the setting range of the Mura compensation value, i.e., the threshold, and then proceeding to the steps of: dividing the pixel units of the display panel into a plurality of rectangular areas according to the Mura compensation value, wherein the Mura compensation values of the pixel units in the same rectangular area are the same or within the set range; and obtaining the position information of the rectangular area and the Mura compensation value of the rectangular area. The threshold can be adjusted according to the display accuracy of the display panel or the threshold can be adaptively adjusted according to the storage space of the flash memory to a minimum value that meets the storage capacity.
[0037] The position information includes starting row information and starting column information, and the length and width of the rectangular area.
[0038] Optionally, the dividing into a plurality of rectangular areas includes:
[0039] Find the largest rectangular area that meets the Mura compensation value requirements from the pixel unit of the display panel; then find the largest rectangular area from the pixel units that have not been divided; until all pixel units are divided. The above is an embodiment of dividing the rectangular area. In addition, any method of dividing into several rectangular areas is applicable to the present invention and is within the protection scope of the present invention.
[0040] Then, the position information of the rectangular area is encoded or the Mura compensation value of the rectangular area is encoded.
[0041] In one embodiment, the encoding step includes:
[0042] Sort the rectangular areas according to row information, and if the row information is the same, sort them according to column information;
[0043] Compress the rectangular area with the same row information and set the increment only in the column direction.
[0044] In this embodiment, the step of removing the rectangular area including only one pixel unit without sorting is further included, thereby further compressing the data.
[0045] like Figure 3 As shown, the rectangular area position information [x, y, h, w, v] includes: the position coordinate information [x, y] of the upper left corner pixel unit, the height h of the rectangular area, the width w of the rectangular area, and the Mura compensation value v. Figure 3 The position information of the red rectangular area is: x=4, y=3, h=4, w=4, v=1.
[0046] The rectangle record information we obtain may be out of order. In this embodiment, preferably, first, the rectangles can be sorted according to their area to filter out rectangles smaller than a preset area. In this embodiment, the preset area is 2. Figure 3 It can be divided into 16 rectangular areas, arranged from largest to smallest as follows:
[0047] The rectangular region with area 16 includes:
[0048] Rectangular area [3, 4, 4, 4, 1];
[0049] The rectangular region with area 9 includes:
[0050] Rectangular area [6, 1, 3, 3, 0];
[0051] The rectangular region with area 5 includes:
[0052] The rectangular area [1, 1, 1, 5, 0],
[0053] The rectangular area [2, 2, 5, 1, 0],
[0054] Rectangular area [8, 4, 5, 1, 0];
[0055] The rectangular region with area 4 includes:
[0056] Rectangular area [1, 5, 4, 1, 0];
[0057] The rectangular region with area 3 includes:
[0058] The rectangular area [2, 8, 1, 3, 0],
[0059] Rectangular area [3, 3, 1, 3, 1];
[0060] The rectangular region with area 2 includes:
[0061] The rectangular area [1, 3, 2, 1, 1],
[0062] The rectangular area [4, 2, 1, 2, 0],
[0063] The rectangular area [7, 4, 2, 1, 0],
[0064] Rectangular area [7, 7, 2, 1, 0];
[0065] The rectangular region with area 1 includes:
[0066] The rectangular area [1, 2, 1, 1, 0],
[0067] The rectangular area [2, 7, 1, 1, 1],
[0068] The rectangular area [3, 2, 1, 1, 1],
[0069] The rectangular area [5, 8, 1, 1, 1],
[0070] The rectangular area [6, 8, 1, 1, 0],
[0071] The rectangular area [7, 6, 1, 1, 1].
[0072] In an optional embodiment, when the rectangular area of the statistical area exceeds 1, the single point can be screened out. In this case, the rectangular areas that can be statistically counted are reduced to the following 10, so that the data is further compressed:
[0073] The rectangular region with area 16 includes:
[0074] Rectangular area [3, 4, 4, 4, 1];
[0075] The rectangular region with area 9 includes:
[0076] Rectangular area [6, 1, 3, 3, 0];
[0077] The rectangular region with area 5 includes:
[0078] The rectangular area [1, 1, 1, 5, 0],
[0079] The rectangular area [2, 2, 5, 1, 0],
[0080] Rectangular area [8, 4, 5, 1, 0];
[0081] The rectangular region with area 4 includes:
[0082] Rectangular area [1, 5, 4, 1, 0];
[0083] The rectangular region with area 3 includes:
[0084] The rectangular area [2, 8, 1, 3, 0],
[0085] Rectangular area [3, 3, 1, 3, 1];
[0086] The rectangular region with area 2 includes:
[0087] The rectangular area [1, 3, 2, 1, 1],
[0088] The rectangular area [4, 2, 1, 2, 0],
[0089] The rectangular area [7, 4, 2, 1, 0],
[0090] The rectangular area [7, 7, 2, 1, 0].
[0091] Then, for these areas, you can first sort them by row, but not limited to, and then sort them by column if the rows are the same, and then get the [row, column]->[width, length, Mura compensation value] information of the rectangular area in the figure as follows:
[0092] [1, 1] -> [1, 5, 0]
[0093] [1, 3] -> [2, 1, 1]
[0094] [1, 5] -> [4, 1, 0]
[0095] [2, 2] -> [5, 1, 0]
[0096] [2, 8] -> [1, 3, 0]
[0097] [3, 3] -> [1, 3, 1]
[0098] [3, 4] -> [4, 4, 1]
[0099] [4, 2] -> [1, 2, 0]
[0100] [6, 1] -> [3, 3, 0]
[0101] [7, 4] -> [2, 1, 0]
[0102] [7, 7] -> [2, 1, 0]
[0103] [8, 4] -> [5, 1, 0]
[0104] Or sort according to the row and column information and the Mura value to obtain the [row, column, Mura compensation value]->[width, length] information of the rectangular area in the figure as follows:
[0105] [1, 1, 0] -> [1, 5]
[0106] [1, 3, 1] -> [2, 1]
[0107] [1, 5, 0] -> [4, 1]
[0108] [2, 2, 0] -> [5, 1]
[0109] [2, 8, 0] -> [1, 3]
[0110] [3, 3, 1] -> [1, 3]
[0111] [3, 4, 1] -> [4, 4]
[0112] [4, 2, 0] -> [1, 2]
[0113] [6, 1, 0] -> [3, 3]
[0114] [7, 4, 0] -> [2, 1]
[0115] [7, 7, 0] -> [2, 1]
[0116] [8, 4, 0] -> [5, 1]
[0117] Then, the data of the same row information in the left half is encoded and compressed, and the starting unit of each row is incremented only in the column direction, and the column increment is set. Specifically, the [row, column]->[Mura compensation value, width, length] information of the rectangular area in the figure and the corresponding encoded and compressed information after setting the column increment are as follows:
[0118] Row 1:
[0119] [1, 1]->[0, 1, 5] starting rectangular area
[0120] [1, 2]->[0, 1, 1] After position information encoding and compression, [0, 1]
[0121] [1, 3]->[1, 2, 1] After position information encoding and compression, [0, 1]
[0122] [1, 5]->[0, 4, 1] After position information encoding and compression, [0, 2]
[0123] Line 2:
[0124] [2, 2]->[0, 5, 1] starting rectangular area
[0125] [2, 7]->[1, 1, 1] After position information encoding and compression, [0, 5]
[0126] [2, 8]->[0, 1, 3] After position information encoding and compression, [0, 3]
[0127] Line 3:
[0128] [3, 2]->[1, 1, 1] starting rectangular area
[0129] [3, 3]->[1, 3, 1] After position information encoding and compression, [0, 1]
[0130] [3, 4]->[1, 4, 4] After position information encoding and compression, [0, 1]
[0131] Line 4:
[0132] [4, 2]->[0, 1, 2] starting rectangular area
[0133] Line 5:
[0134] [5, 8]->[1, 1, 1] starting rectangular area
[0135] Line 6:
[0136] [6, 1]->[0, 3, 3] starting rectangular area
[0137] [6, 8]->[0, 1, 1] After position information encoding and compression, [0, 7]
[0138] Line 7:
[0139] [7, 4]->[0, 2, 1] starting rectangular area
[0140] [7, 6]->[1, 1, 1] After position information encoding and compression, [0, 2]
[0141] [7, 7]->[0, 2, 1] After position information encoding and compression, [0, 5]
[0142] Line 8:
[0143] [8, 4]->[0, 5, 1] starting rectangular area
[0144] According to the characteristic that information is generally transmitted row by row, encoding and compression are performed. Since the display panel is usually displayed in the order of rows, the advantage of such encoding is that it conforms to the display transmission characteristics and is the same as the display order. Compared with the method of calling the Mura compensation value of the pixel unit in an irregular order in the prior art, the present invention can effectively call the Mura compensation value for Demura without slowing down the display speed. Since the pixel units are divided and effectively sorted according to the rectangular area, the Mura compensation value of the pixel unit that needs to be compensated can be quickly located for Demura compensation.
[0145] In this embodiment, after the above steps are completed, the data may be further compressed, for example:
[0146] Row 1:
[0147] [1, 1]->[0, 1, 5] starting rectangular area
[0148] [1, 2]->[0, 1, 1] After position information encoding and compression, [0, 1]
[0149] [1, 3]->[1, 2, 1] After position information encoding and compression, [0, 1]
[0150] [1, 5]->[0, 4, 1] After position information encoding and compression, [0, 2]
[0151] Continue to compress as:
[0152] Row 1:
[0153] [1, 1]->[0, 1, 5] starting rectangular area
[0154] [1, 2]->[0, 1, 1] After position information encoding and compression [1]
[0155] [1, 3]->[1, 2, 1] After position information encoding and compression [1]
[0156] [1, 5]->[0, 4, 1] After position information encoding and compression [2]
[0157] That is, when the rows are the same, only the column variables are retained in the left index, thereby further miniaturizing the data.
[0158] Furthermore, the position information on the right side may be further compressed. For example, in the case where the rectangular area is not screened out as a point, the position information of the rectangular area with only one pixel unit may be saved as its position coordinates without saving its length and width.
[0159] In another embodiment, it further includes: counting the areas of the rectangular regions, and the encoding step filters out the rectangular regions whose areas are smaller than a preset area.
[0160] For example, the rectangular regions are counted and sorted, and the rectangular regions with areas smaller than a preset area are screened out according to the sorting result. In addition, the rectangular regions with areas smaller than a preset area may be screened out by comparison without sorting.
[0161] In another embodiment, the rows, columns, and Mura compensation values may be incrementally compressed at the same time, for example, in the following form: [row, column, Mura compensation value]->[width, length], the left half is incrementally compressed, that is, the rectangular areas are first sorted according to the Mura compensation values, and the rectangular areas with the same Mura compensation values are sorted according to the row information, and the row information is sorted according to the column information after the Mura compensation values are sorted, and the row information is sorted according to the same column information. In this way, the position information of the rectangular areas with the same Mura compensation values can be effectively compressed, and the other areas except the initial rectangular areas are replaced by increments.
[0162] Finally, this information is encoded and stored in the storage area in the required order.
[0163] Then, the position information of the rectangular area is encoded, or the Mura compensation value of the rectangular area is encoded and stored in the flash memory.
[0164] The setting range of the Mura compensation value, that is, the threshold, is adjusted according to the display accuracy of the display panel, or the threshold is adaptively adjusted according to the storage space to a minimum value that meets the storage capacity, and the division and storage steps are continued.
[0165] When performing Demura pixel compensation, the corresponding encoding information is found and decoded according to the position of the pixel unit to be compensated, and the Mura compensation value is read to compensate the pixels of each pixel unit of the display device.
[0166] Take the pixel point (4, 4) in the fourth row and fourth column in the figure as an example. When performing demura pixel compensation, we locate the current point according to its position. Since the rectangular area in the storage area is sorted in row and column order, we only need to calculate the coverage of the rectangle according to the rectangular coordinates and width and height, and then calculate the coverage of the rectangular area where the point (4, 4) is located by comparison. Then we find that the corresponding rectangular coordinates are (3, 4), and the corresponding rectangular area information is [3, 4, 4, 4, 1], and then we get the mura compensation value of the point as 1.
[0167] In another embodiment, the rectangular region with the largest area that meets the Mura compensation value requirement may be found, and all permutations and combinations of rectangles that meet the Mura compensation value requirement in the region may be traversed by using an enumeration method to find the rectangle with the largest area.
[0168] The present invention organizes and sorts the rectangular information, which helps to further analyze and compress the data. The arranged data is more convenient for incremental encoding, and the size of the data to be stored is further compressed.
[0169] During decoding, the sorted data can be quickly retrieved.
[0170] When arranged in the order of rows first and columns later, it conforms to the characteristic of displaying information in rows, and facilitates rapid positioning compensation of display data.
[0171] The present invention also provides a display device using the above pixel compensation method, which may be an OLED display panel.
[0172] The above are only preferred embodiments of the present invention, and are not intended to limit the implementation methods and protection scope of the present invention. Those skilled in the art should be aware that all solutions obtained by equivalent substitutions and obvious changes made using the contents of this specification and illustrations should be included in the protection scope of the present invention.
Claims
1. A Demura data storage method, characterized in that: include: Dividing the pixel units of the display panel into a plurality of rectangular areas according to the Mura compensation value, wherein the Mura compensation value of the pixel units in the same rectangular area is within a set range; Obtaining position information of the rectangular area and a mura compensation value of the rectangular area, wherein the position information includes starting row information and starting column information, and the length and width of the rectangular area; Encode the position information of the rectangular area and store it; The step of encoding the position information of the rectangular area comprises: Sort the rectangular areas according to row information, and if the row information is the same, sort them according to column information; Compress the rectangular area with the same row information and set the column increment.
2. The Demura data storage method according to claim 1, characterized in that: In the case where the row information is the same, other rectangular areas except the initial rectangular area only retain the length and width in the column increment and the rectangular area position information.
3. The Demura data storage method according to claim 1, characterized in that: The position information of the rectangular area with only one pixel unit is saved as its position coordinates, but not its length and width.
4. The Demura data storage method according to claim 1, characterized in that: The division into a plurality of rectangular areas comprises: Find the largest rectangular area in the pixel unit of the display panel where the mura compensation value meets the requirements; Find the largest rectangular area whose mura compensation value meets the requirements from the undivided pixel units; Repeat this step until all pixel units are divided.
5. The Demura data storage method according to claim 1, characterized in that: The method further includes the steps of adjusting the setting range of the Mura compensation value according to the display accuracy of the display panel or adaptively adjusting the setting range according to the storage space to a minimum value that meets the storage capacity, and continuing the division and storage steps.
6. The Demura data storage method according to claim 1, characterized in that: Also includes: When performing Demura pixel compensation, the corresponding encoding information is found and decoded according to the position of the pixel unit to be compensated or according to the Mura compensation value, and the Mura compensation value is read to compensate the pixels of each pixel unit of the display device.
7. The Demura data storage method according to claim 1, characterized in that: Also includes: The area of the rectangular region is counted, and the encoding step screens out the rectangular region whose area is smaller than a preset area.
8. The Demura data storage method according to claim 7, characterized in that: Also includes: The rectangular regions are counted and sorted, and the rectangular regions with areas smaller than a preset area are screened out according to the sorting results.
9. A display device using the demura data storage method according to any one of claims 1 to 8.
Citation Information
Patent Citations
Data compression method capable of locally compensating brightness unevenness of display picture and storage device
CN112927640A
Demura data processing method based on self-adaptive rectangular blocks and display device
CN117995112A
Demura data storage method and display device
CN118098126A
