CN117995112B - Demura data processing method and display device based on self-adaptive rectangular partitioning - Google Patents
Demura data processing method and display device based on self-adaptive rectangular partitioning Download PDFInfo
- Publication number
- CN117995112B CN117995112B CN202410381144.XA CN202410381144A CN117995112B CN 117995112 B CN117995112 B CN 117995112B CN 202410381144 A CN202410381144 A CN 202410381144A CN 117995112 B CN117995112 B CN 117995112B
- Authority
- CN
- China
- Prior art keywords
- mura compensation
- rectangular area
- compensation value
- mura
- rectangular
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 17
- 238000000638 solvent extraction Methods 0.000 title claims abstract description 9
- 238000000034 method Methods 0.000 claims abstract description 24
- 238000003860 storage Methods 0.000 claims description 31
- 238000012545 processing Methods 0.000 claims description 4
- 230000003044 adaptive effect Effects 0.000 claims description 2
- 238000004519 manufacturing process Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 230000007547 defect Effects 0.000 description 3
- 238000005457 optimization Methods 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000002542 deteriorative effect Effects 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Landscapes
- Control Of Indicators Other Than Cathode Ray Tubes (AREA)
- Controls And Circuits For Display Device (AREA)
Abstract
The invention provides a Demura data processing method and a display device based on self-adaptive rectangular partitioning, comprising the following steps: dividing pixel units of the display panel into a plurality of rectangular areas according to Mura compensation values based on Mura continuity characteristics, wherein the Mura compensation values of the pixel units of the same rectangular area are the same or are within a set Mura compensation value range; the position information of the rectangular area, the Mura compensation value of the rectangular area are obtained and stored. The Mura compensation value obtained by the method is lossless, saves space, and when the threshold value=0, the algorithm records the Mura compensation value without precision loss, and saves the space for storing the Mura compensation value while maintaining the complete image information.
Description
Technical Field
The application relates to the field of image processing, in particular to a Demura data processing method and a display device based on self-adaptive rectangular partitioning.
Background
The related parameters of the light emitting units of the display screen deviate from the design values during the manufacturing process, resulting in deviations of the light emitting brightness from the ideal values, thereby deteriorating the display effect. Such a display defect caused by production and manufacture mainly shows a phenomenon in which the display brightness of a display screen deviates from a set value, thereby damaging the correct display of a picture, which is called Mura. The presence of Mura can degrade the display quality of the display screen and thus result in reduced product yields. Therefore, the deviation can be quantified in the production process of the display screen, then the brightness of the display panel is extracted by utilizing a Demura (Mura elimination) method, compensation data are calculated, the Mura defect occurring in the production of the display screen is externally compensated, the Mura defect is reduced or eliminated, and the display effect and the yield of the product are improved. For example, the Mura compensation value of each module is calculated and stored in an external storage unit, and in the display stage, the Mura compensation value of each module is read from the storage unit to perform pixel compensation. In this regard, since the number of modules is large, the storage information amount of the compensation data calculated by all modules is large, so that the requirement on the storage capacity of the storage unit and the like is large, and the real-time performance of pixel compensation is not improved.
The method Demura is to divide the effective display area of the display panel into a plurality of modules, calculate the Mura compensation value of each module and store the Mura compensation value in the external storage unit. Then, in the display stage, the Mura compensation values of the respective modules are read from the storage unit, and pixel compensation is performed. This approach to fixed segmentation of modules creates a requirement for massive information storage. There is also a concept of dividing a display panel based on a macroblock, and using an average value of brightness of pixels in a region as brightness values of all pixels of the region, for example, patent CN 113963663A. This approach, while spatially saving space, loses the accuracy of the pixel Mura compensation values, thereby reducing the effect of the compensation to some extent. Other algorithms also use attempts at Demura information extraction and storage by using cluster-based algorithms, such as patent CN 109672451A, which degrade Mura compensation values, thus still having the problem of losing accuracy and reducing compensation effects. Therefore, how to scientifically divide the display area into module areas and how to quickly extract and efficiently store Demura data is a problem to be solved in Demura technology in the current display application.
Disclosure of Invention
In order to solve the technical problems, the invention provides a Demura data processing method and a display device based on self-adaptive rectangular partitioning.
A Demura data processing method based on adaptive rectangular partitioning comprises the following steps:
Dividing a pixel unit of a display panel into a plurality of rectangular areas according to Mura compensation values, wherein the Mura compensation values of the pixel units of the same rectangular area are in a set range;
The position information of the rectangular area, the Mura compensation value of the rectangular area are obtained and stored.
In addition, a display device using the Demura data processing method is also provided.
The invention has the advantages that:
1. Based on the continuity characteristics of the Mura area of the display, the Mura area of the display can be quantified with a relatively small number of modules, thereby reducing the storage capacity requirements of the unit of storage of the recorded Demura information.
2. Adaptivity. When the Mura compensation value is a point data, that is, the threshold=0, the Mura compensation values of the pixel units in the rectangular area are the same, and then Demura is a lossless compression method, so that the data precision of the Mura compensation value is not lost. The threshold value can be adjusted according to actual demands, so that the size and storage of the final block meet the actual precision requirement or storage requirement.
3. The rectangular partitioning square rule is convenient for defining the area by using a small amount of data, and saves the storage space. The position of the rectangular area can be defined by the coordinates of the point position on the left upper side of the rectangle and the length and width of the rectangle. Without the need to record the Mura compensation value for each point.
4. Aiming at the characteristics of progressive scanning display of a display system, mapping and matching are conveniently carried out when Mura compensation values are read, and a basis is provided for an optimization algorithm when the data is decompressed in the later period. Because the algorithm is based on the self-adaptive rectangle for blocking, the position information of the upper left point of each rectangle is stored, and the method is very beneficial to sequencing and positioning based on the position information.
Drawings
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts throughout the exemplary embodiments of the invention.
FIG. 1 is a schematic diagram illustrating steps of a data processing method Demura according to the present invention;
FIG. 2 is a diagram illustrating an embodiment of a data processing method Demura according to the present invention;
FIG. 3 is a flowchart of a method for processing Demura data according to one embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described in the following with reference to the drawings 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, and thus the protection scope of the present invention is more clearly and clearly defined. It should be apparent that the described embodiments of the invention are only some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In the present application, the use of "or" means "and/or" unless stated otherwise. Furthermore, the use of the terms "include," "include," and "comprising," among other forms, are not limiting. In addition, unless specifically stated otherwise, terms such as "element" or "component" encompass both elements and components comprising one unit as well as elements and components comprising more than one unit.
As described in the background, people try to perform pixel compensation by using a Demura method of clustering, but the existing clustering algorithm cannot represent Mura information of a display with less information, still needs a larger storage space, and is inconvenient to quickly read data when Demura is performed. The inventor finds that the Mura area has the characteristic of continuity in the research, and based on the characteristic, the inventor researches to divide the pixel unit of the display panel into a plurality of rectangular areas by using a maximum rectangular method, so that the pixel unit is subjected to data compression, the storage space is further saved, the display accuracy is improved, and the calculation speed of Demura values is accelerated.
The invention provides a Demura data processing method based on self-adaptive rectangular partitioning, as shown in figure 1, comprising the following steps: dividing the pixel units of the display panel into a plurality of rectangular areas according to the Mura compensation values, wherein the Mura compensation values of the pixel units of the same rectangular area are in a set range, if the Mura compensation value is one point data, namely the threshold value is 0, the Mura compensation values of the pixel units of the rectangular area are the same; and obtaining the position information of the rectangular area, the Mura compensation value of the rectangular area and storing the Mura compensation value.
In this embodiment, optionally, the position information of the rectangular area includes coordinates of one vertex of the rectangular area and a length and a width of the rectangular area.
In this embodiment, optionally, the dividing into a plurality of rectangular areas includes: finding out a rectangular area with the largest area meeting the requirement of Mura compensation value from the pixel units of the display panel; finding a rectangular area with the largest area meeting the requirement of Mura compensation value from the undivided pixel units; until all pixel units are divided.
A specific embodiment of the present invention will be described with reference to fig. 2 and 3.
In this embodiment, referring to fig. 2, for example, the pixel unit including 2 Mura offset values 0,1, in which 0-6 indicates the count of pixel units with Mura offset values of 1 in the row direction. In this embodiment, the method specifically includes the steps of:
the minimum value of the Mura compensation value, i.e., i=min, is set first, and in this embodiment, min=1.
Next, a threshold th is set, in this embodiment, th=0.
Next, pixel units with Mura compensation values within the minimum value min=1 to i+th, i.e. Mura (I, i=th), are found, and the area W where the pixel units are located is defined, as indicated by the reference numerals 1-6 in fig. 2.
Next, a rectangular region R having the largest surface is found in the region W by counting.
As indicated by the numerals in fig. 2, specifically, the pixel units whose Mura compensation values are continuously 1 are counted. Mura compensation data is statistically counted in a single dimension of a row from a 1 st row 1 st column pixel cell (1, 1) in the display panel as a starting pixel cell using a Run-Length Encoding (RLE) like algorithm and properties of a monotonic stack. Then, from line to plane, as shown in fig. 2, first, the number of Mura compensation values continuously conforming to the Mura compensation value range in the reference line and above in each 1 column is counted with the 1 st line as the reference line, specifically, in this embodiment, the pixel units with the Mura compensation value of 1 are counted, and from the 1 st line, the continuous counts of the pixel units with the Mura compensation value of 1 in the direction of the column where the pixel units are located are sequentially: 0,0,1,1,0,0,0,0.
Continuing, counting the number of Mura compensation values continuously conforming to the Mura compensation value range in the reference line and above in each 1 column by taking the 2 nd row as the reference line, specifically counting the pixel units with the Mura compensation value of 1 in the embodiment, wherein the pixel units with the Mura compensation value of 1 in the 1 st row and the 2 nd row are sequentially counted in the direction of the column where the pixel units are located, wherein the continuous counts of the pixel units with the Mura compensation value of 1 in the 1 st row are as follows: 0,1,2,2,1,1,0,0.
Continuing, taking the 3 rd row as a datum line, counting the number of the Mura compensation values which continuously meet the range of the Mura compensation values in the datum line and above in each 1 column, for example, specifically counting the pixel units with the Mura compensation value of 1, wherein the 1 st row, the 2 nd row and the 3 rd row exist at the moment, and the continuous counts of the pixel units with the Mura compensation value of 1 in the column direction of the pixel units are sequentially as follows: 0,2,3,3,2,2,2,0.
And analogizing is performed until the statistics of the whole graph are completed.
After counting, the following group numbers were obtained:
0，0，1，1，0，0，0，0
0，1，2，2，1，1，0，0
0，2，3，3，2，2，2，0
0，0，4，4，3，3，2，0
0，0，5，5，4，4，3，1
0，0，0，6，5，5，4，0
0，0，0，0，0，6，0，0
0，0，0，0，0，0，0，0
The counted results are reduced in the second dimension. Each element in the array is traversed to find the position of the first smaller number on the left and the position of the first smaller number on the right, respectively, by taking the element as the height.
Specifically, in the array formed in the count result for the first dimension, if the element is high, the wider the width that can be expanded, the larger the rectangular area with the element high, for each element. Taking this element as the height, these elements extending to both sides must be greater than or equal to its value in order to satisfy the condition of forming a rectangle. In other words, the maximum rectangle may be determined as long as a boundary that does not satisfy the condition is found. Specifically, the position left0 of the first number smaller than it and the position right0 of the first number smaller than it are found, respectively, and then the width right0-left0-1 of the continuous array sandwiched between these two numbers (excluding left0 and right 0) is the width of the largest rectangle that can be formed with the rectangle whose element is high.
For example, specifically, from the pixel units (1, 3), extending rightward as a result of the count 1, a rectangular area corresponding to the red dotted line is found. From the pixel units (2, 2), extending rightward as a result of the count 1, a rectangular area corresponding to the yellow dotted line is found. From the pixel units (3, 2), a rectangular area corresponding to the blue dotted line is found by extending the count result 2 to the right. From the pixel units (4, 3), a rectangular area corresponding to the green dotted line is found by extending the count result 4 to the right. Traversing all the arrays in turn, and counting all the found rectangular areas.
Thus, the area and position information of the maximum rectangle is calculated for each column of Mura compensation data. The location information of the largest rectangular area in all columns is found, which will be the location information of the largest rectangular area required in the second dimension. The position information of the maximum rectangular area is thus obtained including the upper left point coordinates (x, y), the width and length (v, h) and the Mura offset value m of the rectangular area, and R x, y, v, h, m is stored.
That is, the concept of a stack, assuming that the number of lines counted by the first dimension is high (height), the i-th number from the left is represented as height [ i ], and the number to be pushed in is the position of the array, i.e., i. For the position data in the stack, the property that the height [ i ] corresponding to the position must be monotonically increased in value is required to be satisfied, namely, the height [ i ] corresponding to the position i of each push-in is strictly greater than the height data corresponding to the stack top number, if not, the position data corresponding to the height value greater than the height [ i ] is carried out the pop operation until the height value corresponding to the element at the stack top is strictly less than the height [ i ], and the position left0 corresponding to the first height value smaller than the first height value at the left side of the stack top element is recorded. i is pushed onto the stack. When i is popped by a following element, the element popped i is the position right0 of the first element smaller than the first element on the right of the height [ i ]. The width of the largest rectangle is right0-left0-1, and the corresponding rectangular area [ i ] =height [ i ] (right 0-left 0-1). Thus, by this method, the maximum rectangular area with the height of each element can be obtained separately by traversing the array only once. And obtaining the maximum rectangular area obtained by each element, and obtaining the maximum rectangular area solved by the method.
Further, in order to make each element in the array obtained through the first dimension count have a corresponding left and right boundary, auxiliary data of non-actual data can be added at the left and right ends of the array, and the auxiliary data can be but is not limited to 0, so as to help the algorithm to judge the boundary of the array. The above monotonic stack and constant optimization method are preferred methods in this embodiment, and in addition, a dynamic programming technique may be used to preprocess the brightness of each pixel in the screen, and then construct a two-dimensional array, where each element represents the size of the same rectangle as the Mura compensation value in the lower right corner of the pixel unit. The array is calculated by a dynamic programming algorithm, and the largest rectangle is found. It is also possible to use to divide the screen into smaller sub-areas and then recursively find the same rectangle for the Mura compensation value in each sub-area, combining the results of the sub-areas to find the largest rectangle for the whole screen. Or a hash table is used to store each Mura compensation value and its corresponding pixel location. Then, find the same rectangle of Mura compensation values by traversing all possible rectangular areas and checking if the Mura compensation values within each rectangle are the same. Are within the scope of the present invention.
In the case where the threshold value is not 0, the Mura compensation value of the pixel unit in the rectangular area is not unique, and is a value within the threshold value range, so the Mura compensation value in the rectangular area is a Mura compensation value weighted according to the Mura compensation value of the pixel unit in the rectangular area, for example, the Mura compensation value in the rectangular area may be: the Mura compensation value of the pixel unit at the upper left point in the rectangular area starts from the average value of the Mura compensation value of the pixel unit in the rectangular area, the average value of the Mura compensation value of the pixel unit in the rectangular area or the up/down rounding is achieved, the sum of the Mura compensation values of the pixel unit in the rectangular area or the Mura data obtained by weighting calculation according to the Mura compensation value of the pixel unit in the rectangular area is in any one of a plurality of possibilities, all of which are within the protection scope of the invention, and the examples of the invention do not limit the protection scope.
It should be noted that the above method for dividing the rectangular area is not unique, and in other embodiments, an enumeration method may be used to traverse all the rectangular arrangements and combinations meeting the requirement of the Mura compensation value in the area to find the rectangle with the largest area.
Next, the largest rectangular region R, i.e., W-R, is removed from the region W as a new region W, and the above-described step of finding the largest rectangle is continued until the region W is entirely divided into rectangular regions, i.e., w=0.
Next, the Mura compensation value is adjusted, and a threshold is increased, i.e., i=i=th, and the steps are continued: dividing the pixel units of the display panel into a plurality of rectangular areas according to the Mura compensation values, wherein the Mura compensation values of the pixel units of the same rectangular area are the same or are within a set range; and obtaining the position information of the rectangular area and the Mura compensation value of the rectangular area. Until the Mura compensation value reaches the maximum value max or the display area is entirely divided into rectangular areas.
Compared with the clustering mode in the prior art, the method has the advantages that the areas are divided by dividing the rectangular blocks, the square rules are adopted, a small amount of data are conveniently used for defining the areas, and the storage space is saved. In this embodiment, the position of the rectangular area can be defined by the coordinates of the point at the top left of the rectangle and the length and width of the rectangle, and the Mura compensation value of the pixel unit at the top left of the rectangle is recorded as the Mura compensation value of the rectangular area. Without the need to record the location information of each point and the Mura compensation value. Therefore, the method can occupy less storage space and can be called more quickly, and the method further accelerates the dividing speed of the region and the rationality of dividing the region by utilizing the mode of finding the largest rectangular region first.
In this embodiment, optionally, the method further includes the steps of: and adjusting the threshold value according to the display precision of the display panel or carrying out threshold value self-adaptive adjustment according to the storage space, adjusting the minimum value to be in line with the storage capacity, and continuing the steps of dividing and storing. When the threshold=0, that is, the Mura compensation values of the pixel units in the rectangular area are the same, the Demura data processing method is lossless compression, and the data precision of the Mura compensation values is not lost. The threshold may also be adjusted according to actual requirements, such as storage space, so that the size and storage of the final chunk meets the actual precision or storage requirements.
In this embodiment, optionally, the Mura compensation value is read from the storage space to compensate the pixel of each pixel unit of the display device, and the display device displays through the compensated pixel.
In another embodiment, the dividing the pixel units of the display panel into a plurality of rectangular areas according to the Mura compensation values includes dividing the pixel units of a certain area in the display panel into a plurality of areas according to the Mura compensation values. For example, a certain pixel unit is clustered, and then rectangular regions are divided from the clustered regions.
Then, the position information of each rectangular area and the Mura compensation value are stored in the storage unit.
Wherein, still include the step: and adjusting the threshold according to the display precision of the display panel or carrying out threshold self-adaptive adjustment according to the storage space of the storage unit, continuing the steps of dividing and storing, and adjusting the minimum value to be in line with the storage capacity.
The Demura data processing method of the invention is convenient for mapping and matching when the Mura compensation value is read, and provides a basis for an optimization algorithm when the data is decompressed in the later period. Because the algorithm is based on the self-adaptive rectangle for blocking, the position information of the upper left point of each rectangle is stored, and the method is very beneficial to sequencing and positioning based on the position information.
The invention also provides a display device using the pixel compensation method. Specifically, the display panel can be an OLED display panel.
The foregoing is merely illustrative of the preferred embodiments of the present invention and is not intended to limit the embodiments and scope of the present invention, and it should be appreciated by those skilled in the art that equivalent substitutions and obvious variations may be made using the description and illustrations herein, which should be included in the scope of the present invention.
Claims (7)
1. A method for Demura data processing based on adaptive rectangular partitioning, comprising:
dividing a pixel unit of a display panel into a plurality of rectangular areas according to Mura compensation values based on the characteristic of the continuity of the Mura areas, wherein the Mura compensation values of the pixel units of the same rectangular area are in a set range;
The dividing into a plurality of rectangular areas comprises the following steps:
Finding out a rectangular area with the largest area meeting the requirement of Mura compensation value from the pixel units of the display panel; finding a rectangular area with the largest area in the undivided area meeting the requirement of the Mura compensation value from undivided pixel units; until all pixel units are divided;
And obtaining and storing the position information of the rectangular area and the Mura compensation value of the rectangular area, wherein the position information of the rectangular area comprises the coordinate of one vertex of the rectangular area and the length and width of the rectangular area.
2. The Demura data processing method of claim 1, wherein said finding a rectangular area with a largest area meeting Mura compensation value requirements is: traversing all rectangle arrangement combinations meeting the requirement of Mura compensation values in the region, and finding out the rectangle with the largest area.
3. The Demura data processing method of claim 1, wherein said finding a rectangular area having a largest area meeting Mura compensation value requirements comprises the steps of:
Counting the Mura compensation value in a single dimension;
the counted results are reduced in the second dimension.
4. A method of processing Demura data as claimed in claim 3, wherein the reduction of the counted results in the second dimension is performed for the counted results in the first dimension, and the element is extended to both sides for each element with the element as the height.
5. The Demura data processing method as in claim 1 further comprising the step of: and adjusting the setting range according to the display precision of the display panel or performing self-adaptive adjustment of the setting range according to the storage space, obtaining the minimum value conforming to the storage capacity by adjustment, and continuing the steps of dividing and storing.
6. The Demura data processing method as in claim 1 further comprising the step of: and reading the Mura compensation value from the storage to compensate the pixel of each pixel unit of the display device, and displaying the display device through the compensated pixel.
7. A display device using the Demura data processing method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410381144.XA CN117995112B (en) | 2024-04-01 | 2024-04-01 | Demura data processing method and display device based on self-adaptive rectangular partitioning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410381144.XA CN117995112B (en) | 2024-04-01 | 2024-04-01 | Demura data processing method and display device based on self-adaptive rectangular partitioning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117995112A CN117995112A (en) | 2024-05-07 |
| CN117995112B true CN117995112B (en) | 2024-05-31 |
Family
ID=90887733
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410381144.XA Active CN117995112B (en) | 2024-04-01 | 2024-04-01 | Demura data processing method and display device based on self-adaptive rectangular partitioning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117995112B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107610659A (en) * | 2017-09-05 | 2018-01-19 | 惠科股份有限公司 | Method for eliminating uneven brightness of panel between horizontal or vertical substrates |
| WO2018201512A1 (en) * | 2017-05-03 | 2018-11-08 | 深圳市华星光电技术有限公司 | Method of compensating mura defect of display panel, and display panel |
| CN112927640A (en) * | 2019-12-05 | 2021-06-08 | 敦泰电子股份有限公司 | Data compression method and storage device for locally compensating uneven brightness of display picture |
| CN114245514A (en) * | 2021-12-15 | 2022-03-25 | 广州中大中鸣科技有限公司 | Self-adaptive color temperature adjusting method and device, electronic equipment and storage medium |
| CN114999385A (en) * | 2022-06-20 | 2022-09-02 | 上海大学 | Memory-saving compensation method for rapidly dividing Mura area |
| WO2022252477A1 (en) * | 2021-05-31 | 2022-12-08 | 京东方科技集团股份有限公司 | Method and apparatus for driving display panel, and display device |
| CN115512647A (en) * | 2022-09-16 | 2022-12-23 | 深圳市艾比森光电股份有限公司 | Method, device, system and medium for evaluating pixel saturation of LED display screen |
| CN117437308A (en) * | 2022-07-15 | 2024-01-23 | 格兰菲智能科技有限公司 | Data compression and decompression method and system for DEMURA compensation value |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005316408A (en) * | 2004-03-30 | 2005-11-10 | Sanyo Electric Co Ltd | Device for generating correction value for display uneveness |
| US10170063B2 (en) * | 2017-05-03 | 2019-01-01 | Shenzhen China Star Optoelectronics Technology Co., Ltd | Mura compensation method for display panel and display panel |
| CN113393811B (en) * | 2020-03-12 | 2022-06-28 | 咸阳彩虹光电科技有限公司 | Luminance unevenness compensation method and device and display panel |
-
2024
- 2024-04-01 CN CN202410381144.XA patent/CN117995112B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018201512A1 (en) * | 2017-05-03 | 2018-11-08 | 深圳市华星光电技术有限公司 | Method of compensating mura defect of display panel, and display panel |
| CN107610659A (en) * | 2017-09-05 | 2018-01-19 | 惠科股份有限公司 | Method for eliminating uneven brightness of panel between horizontal or vertical substrates |
| CN112927640A (en) * | 2019-12-05 | 2021-06-08 | 敦泰电子股份有限公司 | Data compression method and storage device for locally compensating uneven brightness of display picture |
| WO2022252477A1 (en) * | 2021-05-31 | 2022-12-08 | 京东方科技集团股份有限公司 | Method and apparatus for driving display panel, and display device |
| CN114245514A (en) * | 2021-12-15 | 2022-03-25 | 广州中大中鸣科技有限公司 | Self-adaptive color temperature adjusting method and device, electronic equipment and storage medium |
| CN114999385A (en) * | 2022-06-20 | 2022-09-02 | 上海大学 | Memory-saving compensation method for rapidly dividing Mura area |
| CN117437308A (en) * | 2022-07-15 | 2024-01-23 | 格兰菲智能科技有限公司 | Data compression and decompression method and system for DEMURA compensation value |
| CN115512647A (en) * | 2022-09-16 | 2022-12-23 | 深圳市艾比森光电股份有限公司 | Method, device, system and medium for evaluating pixel saturation of LED display screen |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117995112A (en) | 2024-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10224955B2 (en) | Data compression and decompression method of demura table, and mura compensation method | |
| JP5233014B2 (en) | Method and apparatus | |
| EP3035683A1 (en) | Method and device for image compression, having enhanced matching of fixed-width, variable-length pixel sample strings | |
| US7054503B2 (en) | Image processing system, image processing method, and image processing program | |
| US20140376882A1 (en) | Computing device with video analyzing function and video analyzing method | |
| US9300840B2 (en) | Image processing device and computer-readable storage medium storing computer-readable instructions | |
| CN117995112B (en) | Demura data processing method and display device based on self-adaptive rectangular partitioning | |
| CN114943729A (en) | Cell counting method and system for high-resolution cell image | |
| KR20230017601A (en) | Apparatus and Method for Low-power Region of Interest Detection | |
| US10121252B2 (en) | Image processing apparatus and image processing method | |
| CN109391818B (en) | DCT (discrete cosine transformation) -based fractal image compression method for rapid search | |
| US20200065251A1 (en) | Memory-adaptive processing method for convolutional neural network and system thereof | |
| CN111488839B (en) | Target detection method and target detection system | |
| CN111372079B (en) | VVC inter-frame CU deep rapid dividing method | |
| US20200304831A1 (en) | Feature Encoding Based Video Compression and Storage | |
| US20150010087A1 (en) | Image Processing Method and Apparatus | |
| CN105141963A (en) | Image motion estimation method and device | |
| CN111510767B (en) | Video watermark identification method and identification device thereof | |
| CN115511690A (en) | Image processing method and image processing chip | |
| CN113689466B (en) | Feature point-based plane tracking method and system | |
| US9542716B1 (en) | Non raster row pixel processing | |
| CN117710235B (en) | Image target enhancement method, device, computer equipment and storage medium | |
| CN117896482B (en) | Intelligent data storage method of vehicle event data recorder | |
| CN109698977B (en) | Video image restoration method and device | |
| CN113709482B (en) | Method for determining coding unit division mode in hardware-oriented intra-frame coding mode |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |