Pixel compensation method suitable for multiple backlight partitions

Abstract

The invention discloses a pixel compensation method suitable for multiple backlight partitions, which comprises the following steps: firstly, testing the illumination range of a single LED lamp to obtain a two-dimensional illumination distribution matrix E (x, y); converting the two-dimensional illumination distribution matrix E (x, y) into a one-dimensional illumination weight data matrix H (d); calculating a pixel distance d'between the to-be-compensated pixel and each LED lamp projection pixel in the backlight neighborhood of the to-be-compensated pixel; indexing a pre-stored one-dimensional illumination data matrix H (d) to obtain an illumination weight H (d ') ij of the pixel distance d' corresponding to each backlight partition in a backlight neighborhood, and calculating a pixel backlight value Brtpxl of the to-be-compensated pixel in a weighted summation mode; and taking the pixel backlight value Brtpxl as an index, obtaining a pixel compensation coefficient corresponding to the pixel to be compensated by looking up a table, and multiplying the original RGB data stream by the compensation coefficient to obtain a compensated pixel value.

Description

Technical Field

[0001] The present invention relates to the technical field of LED backlight display, and particularly to a pixel compensation method applicable to multiple backlight zones. Background Art

[0002] With the development of Mini-LED backlight technology, in order to improve the picture brightness and contrast, the backlight zone technology has gradually become the mainstream in the industry. However, since the backlight zone technology is different from the original global backlight technology, the backlight brightness of different backlight zones is different in each frame of the picture. Therefore, it is necessary to perform pixel compensation on the original RGB image data to ensure correct picture display.

[0003] As Figure 1 shown in the pixel compensation process under backlight zone display in the prior art, the original RGB image data undergoes zoned backlight control operations to obtain the brightness values of each backlight zone. The brightness values of each backlight zone are input into the zoned backlight controller to control the Mini-LED backlight panel for backlight illumination. Then, pixel brightness compensation is performed according to the brightness values of each backlight zone to obtain the compensated RGB image data, and the compensated RGB image data is input into the pixel display driver controller to control the liquid crystal panel for picture display.

[0004] When performing pixel compensation, since the backlight brightness of each pixel is not only affected by the backlight zone where it is located, but also affected by the adjacent backlight zones, and the weights of the influence of other backlight zones on the backlight illumination of this pixel are different. Therefore, as Figure 2 shown, if considering the backlight influence on pixels within a 5×5 backlight zone range, for any pixel in any backlight zone, 5×5 = 25 weight data need to be pre-stored. Taking the pixel array at 4K (3840x2160) resolution as an example, if there are 500 backlight zones set, the number of pixels in each backlight zone is 16,589, and the amount of weight data corresponding to one backlight zone is 415,000 (16,589×25). These weight data require a huge storage space for the display system, especially in the case of a high-resolution display panel and a small number of backlight zones, the defect is more prominent.

[0005] It can be seen that there is a need for a new pixel compensation method applicable to multiple backlight zones in the prior art to achieve data compression and reduce the demand for pre-stored data storage space. Summary of the Invention

[0006] The technical object to be achieved by the present invention is to provide a pixel compensation method applicable to multiple backlight zones.

[0007] Based on the above technical objectives, the present invention provides a pixel compensation method applicable to multiple backlight partitions, and the pixel compensation method includes:

[0008] S100. First, perform an illuminance range test on a single LED lamp to obtain a two-dimensional illuminance distribution matrix E(x, y);

[0009] S101. Convert the two-dimensional illuminance distribution matrix E(x, y) into a one-dimensional illuminance weight data matrix H(d); where d represents the pixel distance between the LED projection pixels and is an integer, and its value range is 0 ≤ d ≤ D; D is the largest integer not exceeding ;

[0010] S102. Calculate the pixel distance d' between the pixel to be compensated and each LED lamp projection pixel in its backlight neighborhood; the backlight neighborhood is a (2N + 1) × (2N + 1) backlight matrix, and N is a positive integer greater than or equal to 1;

[0011] S103. Index the pre-stored one-dimensional illuminance data matrix H(d) to obtain the illuminance weight H(d') corresponding to the pixel distance d' for each backlight partition in the backlight neighborhood ij , -N ≤ i ≤ N, -N ≤ j ≤ N, and then calculate the pixel backlight value Brt of the pixel to be compensated by weighted summation pxl ;

[0012] S104. Using the pixel backlight value Brt pxl as an index, look up the corresponding pixel compensation coefficient for the pixel to be compensated in a table, and multiply the original RGB data stream by this compensation coefficient to obtain the compensated pixel value.

[0013] In one embodiment, the specific conversion process of converting the two-dimensional illuminance distribution matrix E(x, y) into a one-dimensional illuminance weight data matrix H(d) includes:

[0014] If 0 ≤ d ≤ M, then

[0015] If M + 1 ≤ d ≤ D, then H(d) is obtained by interpolation of the data on the diagonal of E(x, y), that is:

[0016]

[0017] Where:

[0018]

[0019]

[0020] The d + is the smallest integer greater than or equal to , that is, for Rounding up, denoted as the said d - is the largest integer less than or equal to , that is, rounding down Rounding down, denoted as

[0021] In one embodiment, the pixel backlight value Brt of the pixel to be compensated is calculated by weighted summation pxl The calculation method includes:

[0022]

[0023] In one embodiment, N = 2, that is, the backlight neighborhood is a 5×5 backlight partition matrix;

[0024] In one embodiment, the compensation coefficient is data preset according to the brightness level coding.

[0025] Other features and advantages of the present invention will be described in the subsequent specification, and part of them will become obvious from the specification, or be understood by implementing the present invention. The objectives and other advantages of the present invention can be achieved and obtained through the structures specifically pointed out in the specification, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] The drawings are used to provide further understanding of the present invention, and constitute a part of the specification. They are used together with the embodiments of the present invention to explain the present invention, and do not constitute a limitation to the present invention. In the drawings:

[0027] Figure 1 is a schematic flow chart of the pixel compensation process of the LED multi-zone backlight in the prior art;

[0028] Figure 2 is a schematic diagram of the weight distribution of the 5×5 backlight partition in the multi-zone backlight pixel compensation in the prior art;

[0029] Figure 3 is a schematic flow chart of the pixel compensation method applicable to multi-backlight partitions of the present invention;

[0030] Figure 4 is a schematic diagram of the illuminance test and the distribution of the illuminance influence range of the present invention;

[0031] Figure 5 is a schematic diagram of the two-dimensional illuminance distribution matrix of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0032] To make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the drawings.

[0033] It should be understood that when an element or layer is referred to as being "on", "adjacent to", "connected to", or "coupled to" another element or layer, it can be directly on, adjacent to, connected or coupled to the other element or layer, or intervening elements or layers may be present. In contrast, when an element is referred to as being "directly on", "directly adjacent to", "directly connected to", or "directly coupled to" another element or layer, there are no intervening elements or layers. It should be understood that although the terms first, second, third, etc. may be used to describe various elements, components, regions, layers, and / or portions, these elements, components, regions, layers, and / or portions should not be limited by these terms. These terms are only used to distinguish one element, component, region, layer, or portion from another element, component, region, layer, or portion. Thus, without departing from the teachings of the present invention, the first element, component, region, layer, or portion discussed below may be referred to as the second element, component, region, layer, or portion. And when discussing the second element, component, region, layer, or portion, it does not imply that a first element, component, region, layer, or portion necessarily exists in the present invention.

[0034] Spatial relationship terms such as "under", "below", "beneath", "underneath", "above", "over", etc. are used herein for convenience in describing the relationship of one element or feature shown in the figures to other elements or features. It should be understood that, in addition to the orientation shown in the figures, spatial relationship terms are intended to also include different orientations of the device in use and operation. For example, if the device in the figures is flipped, then an element or feature described as "under" or "beneath" or "underneath" another element or feature will be oriented "over" the other element or feature. Thus, the exemplary terms "under" and "beneath" can include both an upper and a lower orientation. The device may be otherwise oriented (rotated 90 degrees or other orientations) and the spatial descriptors used herein are to be interpreted accordingly.

[0035] The purpose of the terms used herein is only to describe specific embodiments and is not a limitation of the present invention. As used herein, the singular forms "a", "an", and "the" are also intended to include the plural forms unless the context clearly dictates otherwise. It should also be understood that the terms "comprising" and / or "including", when used in this specification, specify the presence of the stated features, integers, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups. As used herein, the term "and / or" includes any and all combinations of the associated listed items.

[0036] Example 1

[0037] As Figures 3-4The pixel compensation method for multi-backlight zones applicable to the present invention shown in the figure includes the following steps:

[0038] S100: First, perform the illuminance range test of a single LED lamp to obtain the two-dimensional illuminance distribution matrix E(x, y). Here, x and y respectively represent the horizontal pixel number and the vertical pixel number of the projected pixel of the single LED lamp on the display panel. The horizontal pixel size and the vertical pixel size included in the two-dimensional illuminance data are the same, and the absolute value of the maximum pixel number is denoted as M. For example, Figure 4 as shown in the figure, when the value of M is 400, the value ranges of x and y in E(x, y) are -M ≤ x ≤ M and -M ≤ y ≤ M.

[0039] S101: Use central symmetry to convert the two-dimensional illuminance data E(x, y) into a one-dimensional illuminance weight data matrix H(d) and store it. The d represents the pixel distance between the LED projected pixels and is an integer, and its value range is 0 ≤ d ≤ D. The D is the largest integer not exceeding and the specific conversion method is as follows:

[0040] If 0 ≤ d ≤ M, then

[0041] If M + 1 ≤ d ≤ D, then H(d) is obtained by interpolating the data on the diagonal of E(x, y), that is:

[0042]

[0043] Where:

[0044]

[0045] Here, d + is the smallest integer greater than or equal to that is, rounding up is denoted as d - is the largest integer less than or equal to that is, rounding down is denoted as

[0046] S102: Calculate the pixel distance d' between the pixel to be compensated and each LED projected pixel in its backlight neighborhood. The backlight neighborhood is a (2N + 1) × (2N + 1) backlight matrix, where N is a positive integer greater than or equal to 1. In this embodiment, N = 2, that is, the backlight neighborhood is a 5 × 5 backlight zone matrix. At the same time, the pixel to be compensated is located in the central backlight zone of the backlight neighborhood.

[0047] S103. Obtain the illumination weight H(d') corresponding to the pixel distance d' for each backlight partition in the backlight neighborhood from the pre-stored one-dimensional illumination data matrix H(d), and then calculate the pixel backlight value Brt of the pixel to be compensated by means of weighted summation. Taking the 5×5 backlight partition matrix as an example, the calculation method is as follows: ij , and then calculate the pixel backlight value Brt of the pixel to be compensated by means of weighted summation pxl . Taking the 5×5 backlight partition matrix as an example, the calculation method is as follows:

[0048] -N≤i≤N; -N≤j≤N;

[0049] where Brt zone (i, j) is the brightness value of the backlight partition whose horizontal partition distance from the backlight partition where the pixel to be compensated is located is i and the vertical partition distance is j, and this brightness value is the brightness value of each backlight partition generated by the partition backlight control operation.

[0050] S104. Using the pixel backlight value Brt pxl as an index, obtain the corresponding pixel compensation coefficient of the pixel to be compensated by looking up a table, and multiply the original RGB data stream by this compensation coefficient to obtain the compensated pixel value. In this embodiment, the compensation coefficient is pre-set data. For example, when the brightness level is pre-set to 10bit, there are correspondingly 10 2 pxl = 1024 kinds of brightness encodings. If the calculated pixel backlight value Brt 9 is 2

[0051] As described above, the above embodiments are only used to illustrate the technical solutions of the present application, rather than limiting them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions recorded in the foregoing embodiments, or perform equivalent replacements on some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A pixel compensation method applicable to multiple backlight zones, characterized in that: The pixel compensation method includes: S100. First, perform the illuminance range test of a single LED lamp to obtain a two-dimensional illuminance distribution matrix E(x, y); S101. Convert the two-dimensional illuminance distribution matrix E(x, y) into a one-dimensional illuminance weight data matrix H(d); where d represents the pixel distance between LED projection pixels and is an integer, and its value range is 0 ≤ d ≤ D; D is the largest integer not exceeding ​ S102. Calculate the pixel distance d' between the pixel to be compensated and each LED lamp projection pixel in its backlight neighborhood; the backlight neighborhood is a (2N + 1)×(2N + 1) backlight matrix, and N is a positive integer greater than or equal to 1; S103. Obtain the illumination weight H(d') corresponding to the pixel distance d' for each backlight partition in the backlight neighborhood from the pre-stored one-dimensional illumination data matrix H(d). ij , where -N ≤ i ≤ N, -N ≤ j ≤ N, and then calculate the pixel backlight value Brt of the pixel to be compensated by weighted summation. pxl ; S104, using the pixel backlight value Brt pxl as an index, obtain the corresponding pixel compensation coefficient of the pixel to be compensated by looking up a table, and multiply the original RGB data stream by this compensation coefficient to obtain the compensated pixel value.

2. The pixel compensation method according to claim 1, wherein: The specific conversion process of converting the two-dimensional illuminance distribution matrix E(x, y) into a one-dimensional illuminance weight data matrix H(d) includes: If 0 ≤ d ≤ M, then If M + 1 ≤ d ≤ D, then H(d) is obtained by interpolating the data on the diagonal of E(x, y), that is: Where: The said d + is the smallest integer greater than or equal to , that is, rounding up is expressed as The said d - is the largest integer less than or equal to , that is, rounding down is expressed as 3. The pixel compensation method according to claim 1, wherein: The method for calculating the pixel backlight value Brt of the pixel to be compensated by weighted summation pxl includes:

4. The pixel compensation method according to claim 1, wherein: N = 2, that is, the backlight neighborhood is a 5×5 backlight partition matrix.

5. The pixel compensation method according to claim 1, characterized in that: The compensation coefficient is data preset according to the brightness level coding.

Images