Backlight module control method and device, display module and storage medium
By calculating the pixel partition and backlight data corresponding to each backlight partition, the problem of increased development cycle and cost of MiniLED backlight modules is solved, and compatibility and efficiency improvements are achieved for multiple specifications.
Patent Information
- Application Number
- CN202310646630.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-06-01
- Publication Date
- 2024-12-03
AI Technical Summary
In MiniLED backlight modules, due to product differentiation, multiple specifications of backlight partition modules require separate development of dimming methods, resulting in increased development cycle and cost.
By obtaining the number of horizontal pixels of the image to be displayed, the number of vertical pixels, the number of parallel scanning channels, and the number of backlight horizontal and vertical partitions of the backlight module, the pixel partition corresponding to each backlight partition is determined and calculated based on the pixel value. Backlight data, update backlight partition data in real time to adapt to backlight modules of different specifications.
Without changing the system software and drivers, the development cycle and development cost of MiniLED partition backlight display module products is reduced, and compatibility with multiple backlight partition specifications is achieved.
Smart Images

Figure CN119068832A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of display, and in particular to a control method and device of a backlight module, a display module and a storage medium. Background Art
[0002] In a display module using sub-millimeter light emitting diodes (Mini Light Emitting Diode, MiniLED) as the backlight module, in order to achieve excellent display effects in display indicators such as contrast, high dynamic range imaging (High Dynamic Range Imaging, HDR), and color, the backlight module can be divided into multiple backlight partitions, and the lighting of each backlight partition can be controlled by the backlight partition dimming method.
[0003] However, due to product differentiation, there are backlight partition modules of various specifications, so it is necessary to develop a dimming method separately for each specification of the backlight module, which increases the development cycle and development cost of product development. Summary of the invention
[0004] The present invention provides a control method and device of a backlight module, a display module and a storage medium to solve the deficiencies in the related art.
[0005] According to a first aspect of an embodiment of the present invention, a method for controlling a backlight module is provided, wherein the backlight module includes a plurality of backlight partitions, and the method includes:
[0006] Acquire the number of horizontal pixels and the number of vertical pixels of the image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module;
[0007] Determine a pixel partition corresponding to each backlight partition in the image to be displayed according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions;
[0008] According to the pixel value of each pixel in the pixel partition, backlight data of the backlight partition corresponding to the pixel partition is determined.
[0009] In some embodiments, the pixel partition is determined according to pixel horizontal partition and pixel vertical partition;
[0010] Determining the pixel partition corresponding to each backlight partition in the image to be displayed according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions includes:
[0011] Determine the width of the horizontal pixel partition according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels and the number of horizontal backlight partitions, and determine the width of the vertical pixel partition according to the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions;
[0012] Determine the number of pixel horizontal partitions of different widths arranged on pixel rows according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of backlight horizontal partitions, and determine the number of pixel vertical partitions of different widths arranged on pixel columns according to the number of vertical pixels of the image and the number of backlight vertical partitions;
[0013] Determine a horizontal arrangement sequence of pixel horizontal partitions of different widths, and a vertical arrangement sequence of pixel vertical partitions of different widths;
[0014] A pixel partition corresponding to each backlight partition in the image to be displayed is determined according to the horizontal arrangement sequence and the vertical arrangement sequence.
[0015] In some embodiments, determining the width of the horizontal pixel partition according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels and the number of horizontal backlight partitions, and determining the width of the vertical pixel partition according to the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions, comprises:
[0016] If the number of horizontal pixels of the image and the number of parallel scanning channels are non-integer multiples of the number of horizontal backlight partitions, a first horizontal width and a second horizontal width of the horizontal pixel partition are determined by using a rounding function according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, wherein the first horizontal width and the second horizontal width are integer clock cycles, and the difference between the first horizontal width and the second horizontal width is 1 clock cycle;
[0017] If the number of horizontal pixels of the image and the number of parallel scanning channels are integer multiples of the number of horizontal backlight partitions, determining a third horizontal width of the pixel horizontal partition according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, wherein the third horizontal width is an integer number of clock cycles;
[0018] If the number of vertical pixels of the image and the number of vertical backlight partitions are non-integer multiples, determining a first vertical width and a second vertical width of the vertical pixel partition according to the number of vertical pixels of the image and the number of vertical backlight partitions and using a rounding function;
[0019] If the number of vertical pixels of the image and the number of vertical backlight partitions are integer multiples, a third vertical width of the pixel vertical partition is determined according to the number of vertical pixels of the image and the number of vertical backlight partitions.
[0020] In some embodiments, determining the first horizontal width and the second horizontal width of the pixel horizontal partition using a rounding function according to the number of horizontal pixels of the image, the number of parallel scanning channels, and the number of horizontal backlight partitions includes:
[0021] Determine the number of horizontal scans of the image according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels;
[0022] Determine a first horizontal width of a pixel horizontal partition using a floor function according to the number of horizontal scans of the image and the number of backlight horizontal partitions;
[0023] According to the number of horizontal scans of the image and the number of backlight horizontal partitions, a second horizontal width of the pixel horizontal partition is determined by using an upward rounding function;
[0024] The method of determining the first vertical width and the second vertical width of the pixel vertical partition according to the number of vertical pixels of the image and the number of backlight vertical partitions by using a rounding function comprises:
[0025] Determine a first vertical width of a pixel vertical partition by using a floor function according to the number of vertical pixels of the image and the number of backlight vertical partitions;
[0026] According to the number of vertical pixels of the image and the number of vertical backlight partitions, a first vertical width and a second vertical width of the vertical partition of the pixel are determined by using a round-up function.
[0027] In some embodiments, the pixel horizontal partition includes a first pixel horizontal partition and a second pixel horizontal partition, the width of the first pixel horizontal partition is a first horizontal width, and the width of the second pixel horizontal partition is a second horizontal width;
[0028] The step of determining the number of arrangement of pixel horizontal partitions of different widths on the pixel row according to the number of horizontal pixels of the image, the number of parallel scanning channels, and the number of backlight horizontal partitions includes:
[0029] Determine the difference between the product of the second horizontal width and the number of backlight horizontal partitions and the number of horizontal scans of the image as the number of arrangements of the first pixel horizontal partitions on the pixel row, wherein the number of horizontal scans of the image is determined according to the number of horizontal pixels of the image and the number of parallel scanning channels;
[0030] The difference between the number of the backlight horizontal partitions and the product of the number of horizontal scanning times of the image and the first horizontal width is determined as the number of the second pixel horizontal partitions arranged on the pixel row.
[0031] In some embodiments, the pixel vertical partition includes a first pixel vertical partition and a second pixel vertical partition, the first pixel vertical partition is a first vertical width, and the second pixel vertical partition is a second vertical width;
[0032] The step of determining the number of arrangement of vertical pixel partitions of different widths on the pixel columns according to the number of vertical pixels of the image and the number of vertical backlight partitions comprises:
[0033] Determine the difference between the product of the second vertical width and the number of the backlight vertical subareas and the number of the image vertical pixels as the number of the first pixel vertical subareas arranged on the pixel column;
[0034] The difference between the number of vertical pixels of the image and the product of the first vertical width and the number of backlight vertical partitions is determined as the number of second pixel vertical partitions arranged on the pixel column.
[0035] In some embodiments, the pixel horizontal partitions include a first pixel horizontal partition and a second pixel horizontal partition, the first pixel horizontal partition and the second pixel horizontal partition having different widths;
[0036] The step of determining a horizontal arrangement sequence of pixel horizontal partitions of different widths comprises:
[0037] Determining an arrangement ratio according to a ratio of the number of the first pixel horizontal subareas arranged on the pixel row to the number of the second pixel horizontal subareas arranged on the pixel row;
[0038] The arrangement ratio is rounded down and then added to the unit clock period to obtain an arrangement period;
[0039] If the arrangement period is not equal to the set period, half of the arrangement ratio is rounded down and added to the unit clock period to obtain an arrangement half period; if the arrangement period is equal to the set period, the unit clock period is determined as the arrangement half period;
[0040] The arrangement remainder is obtained by subtracting the arrangement ratio from the arrangement number of the first pixel horizontal partitions on the pixel row and multiplying the arrangement ratio by the arrangement number of the second pixel horizontal partitions on the pixel row;
[0041] For each pixel horizontal partition, according to the relationship between the serial number of the pixel horizontal partition, the remainder of the arrangement period and the arrangement half period, determine the position where the current pixel horizontal partition serial number is located to arrange the first pixel horizontal partition or the second pixel horizontal partition, and when the set conditions are met, arrange the first pixel horizontal partition at the position where the next pixel horizontal partition serial number is located, and the set conditions include that the serial number of the pixel horizontal partition and the remainder of the arrangement period are zero, and the sum of the arrangement remainders is greater than the number of arrangements of the second pixel horizontal partitions on the pixel row.
[0042] In some embodiments, determining the position where the current pixel horizontal partition sequence number is located to arrange the first pixel horizontal partition or the second pixel horizontal partition according to the sequence number of the pixel horizontal partition and the relationship between the remainder of the arrangement period and the arrangement half period includes:
[0043] If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are equal to the arrangement half period, determining the position where the pixel horizontal partition is located and arranging the second pixel horizontal partition;
[0044] If the serial number of the pixel horizontal partition and the remainder of the arrangement period are not equal to the arrangement half period, the position where the pixel horizontal partition is located is determined to arrange the first pixel horizontal partition.
[0045] In some embodiments, in the horizontal arrangement sequence, 0 is used to identify the first pixel horizontal partition, and 1 is used to identify the second pixel horizontal partition, and the method further includes:
[0046] Initialize a sequence of set length and the number of pixel horizontal partitions;
[0047] If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are equal to the arrangement half period, and it is not the first time to fill the sequence, then after shifting the filled sequence to the lower position by a unit length, fill the highest position of the sequence with 1;
[0048] If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are not equal to the arrangement half period, and it is not the first time to fill the sequence, the filled sequence is shifted to the lower position by a unit length, and then the highest position of the sequence is filled with 0;
[0049] If the remainder of the sequence number of the pixel horizontal partition and the arrangement period is 0, and the sum of the arrangement remainders is greater than the number of the second pixel horizontal partitions arranged on the pixel row, the filled sequence is shifted to the lower bit by a unit length, 0 is filled in the highest bit of the sequence, and the number of backlight horizontal partitions is updated;
[0050] If the sequence number of the pixel horizontal partition is equal to the updated number of backlight horizontal partitions, the filled valid bits are shifted to the lowest bit of the sequence to obtain the horizontal arrangement sequence.
[0051] In some embodiments, determining the backlight data of the backlight partition corresponding to the pixel partition according to the pixel value of each pixel in the pixel partition includes:
[0052] According to the pixel value of each pixel in the pixel partition, obtaining the maximum pixel value and the total pixel value in the pixel partition;
[0053] Determining the pixel average value according to the divided quantization parameter of the pixel partition and the pixel sum;
[0054] Determining basic backlight data of a backlight partition corresponding to the pixel partition according to the maximum pixel value, the pixel average value and their respective weights;
[0055] The basic backlight data corresponding to all backlight partitions are filtered to obtain target backlight data for each backlight partition.
[0056] In some embodiments, the division quantization parameter is determined by:
[0057] Acquire a maximum number of pixels in a horizontal direction and a maximum number of pixels in a vertical direction of a pixel partition, wherein the maximum number of pixels in the horizontal direction is determined according to a width of the pixel partition in the horizontal direction and the number of parallel scanning channels;
[0058] Determining quantization bits according to the maximum number of pixels in the horizontal direction and the maximum number of pixels in the vertical direction;
[0059] A division quantization parameter corresponding to the pixel partition is determined according to the number of pixels in the pixel partition and the quantization bit.
[0060] In some embodiments, the pixel partitions include different types of pixel partitions, wherein a first type of pixel partition has a first horizontal width and a first vertical width, a second type of pixel partition has a first horizontal width and a second vertical width, a third type of pixel partition has a second horizontal width and a first vertical width, and a fourth type of pixel partition has a second horizontal width and a second vertical width;
[0061] If the type of the pixel partition is the first type, determining a first number of pixels in the pixel partition of the first type according to the first horizontal width and the first vertical width, and determining a first division quantization parameter corresponding to the pixel partition of the first type according to the first number of pixels and the quantization bit;
[0062] If the type of the pixel partition is the second type, determining a second number of pixels in the pixel partition of the second type according to the first horizontal width and the second vertical width, and determining a second division quantization parameter corresponding to the pixel partition of the second type according to the second number of pixels and the quantization bit;
[0063] If the type of the pixel partition is the third type, determining a third number of pixels in the pixel partition of the third type according to the second horizontal width and the first vertical width, and determining a third division quantization parameter corresponding to the pixel partition of the third type according to the third number of pixels and the quantization bit;
[0064] If the type of the pixel partition is the fourth type, the fourth number of pixels in the fourth type of pixel partition is determined according to the second horizontal width and the second vertical width, and the fourth division quantization parameter corresponding to the fourth type of pixel partition is determined according to the fourth number of pixels and the quantization bit.
[0065] In some embodiments, each pixel in the pixel partition corresponds to a plurality of counters, the counters comprising: a clock number counter in a pixel horizontal partition, a pixel row number counter in a pixel vertical partition, a pixel horizontal partition number counter, and a pixel vertical partition number counter; the method further comprises:
[0066] When a data enable signal is received, the clock number counter in the pixel horizontal partition is updated, and when the value corresponding to the clock number counter in the pixel horizontal partition is equal to the width of the pixel horizontal partition, the clock number counter in the pixel horizontal partition is reset;
[0067] When resetting the clock number counter in the pixel horizontal partition, updating the pixel horizontal partition number counter, and when the value corresponding to the pixel horizontal partition number counter is equal to the number of backlight horizontal partitions, resetting the pixel horizontal partition number counter;
[0068] When resetting the pixel horizontal partition number counter, updating the pixel row number counter in the pixel vertical partition, and when the value corresponding to the pixel row number counter in the pixel vertical partition is equal to the number of pixel rows in the pixel vertical partition, resetting the pixel row number counter in the pixel vertical partition;
[0069] When the pixel row number counter in the pixel vertical partition is reset, the pixel vertical partition number counter is updated, and when the value corresponding to the pixel vertical partition number counter is equal to the number of backlight vertical partitions, the pixel vertical partition number counter is reset.
[0070] In some embodiments, the width of the horizontal pixel partition is determined by:
[0071] Get the lowest bit of the horizontal arrangement sequence;
[0072] If the value corresponding to the least significant bit is 0, the width of the pixel horizontal partition is the first horizontal width;
[0073] If the value corresponding to the least significant bit is 1, the width of the pixel horizontal partition is the second horizontal width;
[0074] When the clock number counter in the pixel horizontal partition is reset, the horizontal arrangement sequence is right-shifted by 1 bit.
[0075] In some embodiments, obtaining a maximum pixel value and a total pixel value in the pixel partition according to the pixel value of each pixel in the pixel partition includes:
[0076] In the process of scanning the image to be displayed, determining the target pixel partition to which the currently scanned pixel belongs according to the pixel horizontal partition number counter and the pixel vertical partition number counter corresponding to the currently scanned pixel;
[0077] Acquire a maximum value of candidate pixels and a sum of candidate pixels from a storage area corresponding to the target pixel partition;
[0078] If the pixel value corresponding to the currently scanned pixel is greater than the maximum value of the candidate pixel, the maximum value of the candidate pixel is updated to the pixel value corresponding to the currently scanned pixel;
[0079] The candidate pixel sum is updated using the pixel value corresponding to the currently scanned pixel.
[0080] In some embodiments, filtering the basic backlight data corresponding to all backlight partitions to obtain target backlight data for each backlight partition includes:
[0081] Filling operation is performed on the basic backlight data corresponding to all backlight partitions;
[0082] The basic backlight data after the filling operation is filtered using a preset filter core to obtain target backlight data for each backlight partition, wherein the number of filtering times for each row of basic backlight data is determined according to the number of horizontal backlight partitions, and the number of rows for filtering is determined according to the number of vertical backlight partitions.
[0083] In some embodiments, the method further comprises:
[0084] Cache the image to be displayed in a video frame cache device;
[0085] When the backlight data of all the backlight partitions are acquired, the backlight data of all the backlight partitions are controlled to be output synchronously with the image to be displayed.
[0086] According to a second aspect of an embodiment of the present invention, a control device for a backlight module is provided, wherein the backlight module includes a plurality of backlight partitions, and the device includes:
[0087] An acquisition unit, used to acquire the number of horizontal pixels and the number of vertical pixels of the image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module;
[0088] A calculation unit is used to determine the pixel partition corresponding to each backlight partition in the image to be displayed according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions, and determine the backlight data of the backlight partition corresponding to the pixel partition according to the pixel value of each pixel in the pixel partition.
[0089] According to a third aspect of an embodiment of the present invention, there is provided a display module, comprising:
[0090] Display panel and backlight module;
[0091] The backlight module is controlled by any of the methods described above.
[0092] According to a third aspect of an embodiment of the present invention, there is provided a storage medium storing computer instructions, wherein the computer instructions are used to enable a computer to execute any of the above methods.
[0093] According to the above embodiments, without changing the system software and the driver, the backlight data of the backlight partition is updated in real time according to the number of horizontal pixels and the number of vertical pixels of the image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module, so as to adapt to backlight modules with a variety of different backlight partition specifications, thereby reducing the development cycle and development cost of display module products based on MiniLED partition backlight.
[0094] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0095] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.
[0096] Figure 1The figure is a flow chart of a method for controlling a backlight module according to an embodiment of the present invention.
[0097] Figure 2 1 is a diagram showing an architecture of a control method for a backlight module according to an embodiment of the present invention.
[0098] Figure 3 is a schematic diagram of determining the horizontal arrangement sequence in Example 1 according to an embodiment of the present invention.
[0099] Figure 4A FIG. 4 is a flow chart showing a method for determining a horizontal arrangement sequence according to an embodiment of the present invention.
[0100] Figure 4B is a schematic diagram of determining the horizontal arrangement sequence in Example 1 according to an embodiment of the present invention.
[0101] Figure 5 It is a schematic diagram showing the arrangement of image and pixel partitions and the counting of four counters according to an embodiment of the present invention.
[0102] Figure 6 FIG. 4 is a schematic diagram of RAM reading and writing logic according to an embodiment of the present invention.
[0103] Figure 7 FIG. 4 is a schematic diagram of backlight data storage according to an embodiment of the present invention.
[0104] Figure 8 is a schematic diagram of a filter kernel according to an embodiment of the present invention. DETAILED DESCRIPTION
[0105] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Instead, they are merely examples of devices and methods consistent with some aspects of the present invention as detailed in the appended claims.
[0106] The display module includes a display panel and a backlight module. The display panel can adopt a liquid crystal display (LCD), and the backlight module can adopt MiniLED. In order to obtain a better display effect, the backlight module can be divided into multiple backlight partitions, and the backlight partitions can be controlled to light up one by one.
[0107] During the product development stage, a variety of backlight partitions of different specifications will be developed. When replacing the MiniLED backlight of the display module, the backlight partitions of different specifications will cause the partition light control modules in the display system to be incompatible and adaptable. It is usually necessary to invest in development work for the new backlight module, but this method cannot achieve rapid iteration and upgrade of the product, nor can it effectively control the project development cost.
[0108] In view of this, the present invention provides a control method for a backlight module, which modifies the calculation logic of the control method according to the basic parameter information input in real time to adapt to display modules with a variety of different backlight partition specifications, thereby improving development efficiency, shortening development cycle, and reducing development costs. Wherein, the basic parameter information includes: the number of horizontal pixels and the number of vertical pixels of the image, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module.
[0109] The following embodiments will illustrate the present invention with reference to the accompanying drawings.
[0110] Figure 1 is a flow chart of a control method of a backlight module according to an embodiment of the present invention. Figure 1 As shown, the control method of the backlight module includes the following steps 101 to 103.
[0111] In step 101, the number of horizontal pixels and the number of vertical pixels of the image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module are obtained.
[0112] In order to control backlight modules of different specifications, the present invention obtains the above basic parameter information through a designated interface before determining the backlight data. The specifications of the backlight module can be determined according to the number of backlight horizontal partitions and the number of backlight vertical partitions in the basic parameter information, such as 120*85, 64*90, 110*90, etc. Among them, the number of horizontal pixels of the image and the number of vertical pixels of the image can be determined by the video resolution.
[0113] In one implementation, considering the actual usage scenario and the actual hardware resource cost, the range of each parameter in the input basic parameter information can be limited. For example, the video input resolution can be limited to support 2K / 4K / 8K@60HZ; the number of parallel scanning channels can be between 1-16; the number of backlight horizontal partitions and the number of backlight vertical partitions can be between 1-120 respectively.
[0114] In step 102, the pixel partition corresponding to each backlight partition in the image to be displayed is determined according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions.
[0115] The pixel partitions in the image to be displayed include two dimensions: horizontal direction and vertical direction. In this embodiment, the pixel partitions in the horizontal direction are referred to as pixel horizontal partitions, and the pixel partitions in the vertical direction are referred to as pixel vertical partitions.
[0116] The pixel partitions in the image to be displayed correspond to the backlight partitions one by one, so the number of backlight horizontal partitions is equal to the number of pixel horizontal partitions, and the number of backlight vertical partitions is equal to the number of pixel vertical partitions. The width of the pixel horizontal partition can be determined according to the quantitative relationship between the number of image horizontal pixels and the number of parallel scanning channels and the number of backlight horizontal partitions; and the width of the pixel vertical partition can be determined according to the multiple relationship between the number of image vertical pixels and the number of backlight vertical partitions.
[0117] When the number of horizontal pixel partitions and the width of the horizontal pixel partitions, as well as the number of vertical pixel partitions and the width of the vertical pixel partitions are determined, the specifications of the pixel partitions in the image to be displayed can be determined. Then, a corresponding relationship between each pixel partition in the image to be displayed and the backlight partition in the backlight module is established, that is, the pixel partition corresponding to each backlight partition in the image to be displayed is determined.
[0118] In step 103, backlight data of a backlight partition corresponding to the pixel partition is determined according to the pixel value of each pixel in the pixel partition.
[0119] It can be seen from the above steps that the present invention can modify the basic parameter information through the specified interface when the display module is running, and determine the backlight data of each backlight partition according to the modified basic parameter information. It can adapt to and be compatible with backlight partitions of different sizes in real time without changing the system software and driver, thereby reducing the development cycle and development cost of display module products based on MiniLED partition backlight.
[0120] In some embodiments, determining the backlight data of the backlight partition corresponding to the pixel partition based on the pixel value of each pixel in the pixel partition may include: obtaining the pixel maximum value and the pixel sum in the pixel partition based on the pixel value of each pixel in the pixel partition; determining the pixel average value based on the division quantization parameter of the pixel partition and the pixel sum; determining basic backlight data of the backlight partition corresponding to the pixel partition based on the pixel maximum value and the pixel average value and their respective weights; and filtering the basic backlight data corresponding to all backlight partitions to obtain target backlight data for each backlight partition.
[0121] Since the backlight calculation can only be output after a complete frame of image transmission is completed, the backlight will lag behind the image by one frame, resulting in inaccurate pixel compensation and the problem of asynchronous display of the image and backlight. Therefore, the image to be displayed is frame cached to ensure that the image to be displayed and the backlight data used for pixel compensation are synchronized, thereby obtaining a more accurate and better synchronized backlight control effect. That is, the method also includes: caching the image to be displayed to a video frame cache device; when the backlight data of all backlight partitions are obtained, controlling the backlight data of all backlight partitions to be output synchronously with the image to be displayed.
[0122] Figure 2 is a schematic diagram of a control method for a backlight module according to an embodiment of the present invention. Figure 2 As shown, the complete control process of the present invention can be divided into: parameter calculation part, partition backlight calculation part and video synchronization part.
[0123] In the parameter calculation part, the derived parameters required by the partition backlight calculation part are calculated and generated according to the currently input basic parameter information. The derived parameters include: the width information of the horizontal pixel partition, the width information of the vertical pixel partition, the division quantization parameter, the quantization bit, the horizontal arrangement sequence and the vertical arrangement sequence.
[0124] The partitioned backlight calculation part includes a basic backlight calculation part and a backlight smoothing filtering part. In the basic backlight calculation part: the image to be displayed is arranged according to the backlight partitions, and the basic backlight data of the pixel partitions corresponding to the backlight partitions are extracted. The basic backlight data can be determined by weighted calculation of the mean algorithm and the maximum value algorithm; in the backlight smoothing filtering part: smoothing filtering is performed using the set filter kernel to obtain the target backlight data that can be output for display.
[0125] In the video synchronization part, the image to be displayed is cached. In this embodiment, a double data rate synchronous dynamic random access memory (Double Data Rate, DDR) can be used as a video frame cache device.
[0126] Those skilled in the art should understand that, in this embodiment, the video data and the image to be displayed have the same meaning.
[0127] In the process of controlling the backlight module of the present invention, the changes of basic parameters include the size of video data (resolution), the video data transmission rate (number of parallel scanning channels), the number of pixels in each backlight partition, etc. The control method is usually implemented using FPGA (Field Programmable Gate Array). Due to the characteristics of FPGA fixed-point calculation and the fixed calculation structure of the algorithm circuit, the FPGA implementation architecture will be affected. Therefore, in the implementation using FPGA, the algorithm can be optimized as follows:
[0128] 1. Analyze the basic parameters and summarize the parameters of subsequent calculation modules to obtain derived parameter data.
[0129] Before calculating the basic backlight data of the pixel partition, the derived parameters used in the control process are obtained in advance based on the basic parameters of the backlight specifications and video specifications, which can reduce the calculation complexity inside the partition backlight calculation part and improve the efficiency and speed of the video and backlight calculation. In other words, all parameter calculations in the parameter calculation part are calculated in advance at the beginning of the frame (i.e., the blank period between frames), which can avoid the non-real-time performance caused by the high delay of the divider. The derived parameters can be directly used for calculation in the pixel transmission stage to ensure the real-time performance of the calculation.
[0130] For users, they can input video data of different resolutions within the set range, as well as backlight partition information of different layout specifications, and can also modify the above basic parameter information during operation. The FPGA completes the calculation of the derived parameters at the beginning of the frame and uses the derived parameters for control during the pixel transmission stage.
[0131] 2. Adopt a computing architecture that is adapted to the highest amount of video data, and achieve backward compatibility of data calculation through parameter control.
[0132] For example, the RAM instance size is implemented according to the maximum partition situation (120*120).
[0133] 3. When the basic parameters of the external input change, dynamically adjust the sequence flag and pixel counter.
[0134] Specifically, it includes using a horizontal arrangement sequence to identify the width of a horizontal pixel partition, using a vertical arrangement sequence to identify the width of a vertical pixel partition, and using four counters to determine the pixel partition to which the currently scanned pixel belongs. When the basic parameters of the external input change, the horizontal arrangement sequence and the vertical arrangement sequence will be dynamically adjusted, and the number of backlight horizontal partitions and the number of backlight vertical partitions in the basic parameters, as well as the dynamic adjustment of the horizontal arrangement sequence and the vertical arrangement sequence, will affect the value ranges of different counters, thereby affecting the pixel partition to which the currently scanned pixel belongs.
[0135] The following embodiments will specifically explain the calculation logic of each part mentioned above.
[0136] In some embodiments, determining the pixel partition corresponding to each backlight partition in the image to be displayed based on the quantitative relationship between the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the number of backlight horizontal partitions and the number of backlight vertical partitions may include the following steps 1021 to 1024.
[0137] In step 1021, the width of the horizontal pixel partition is determined according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels and the number of horizontal backlight partitions, and the width of the vertical pixel partition is determined according to the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions.
[0138] Since video data transmission is transmitted in parallel according to multiple (for example, N) channels per clock cycle, in order to reduce the amount of calculation, when dividing the backlight partitions, the clock count is used as the division unit in the horizontal direction, that is, the width of each backlight partition in the horizontal direction is KH clock cycles; the pixel is used as the division unit in the vertical direction, that is, the width of each backlight partition in the vertical direction is KV pixel rows. Among them, N is the number of parallel scanning channels, N∈1-16. When determining the width of the pixel partition in the horizontal direction and the width of the pixel partition in the vertical direction, it can be discussed based on the image resolution and whether the backlight partition can be divided evenly.
[0139] In the horizontal direction, according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels and the number of horizontal backlight partitions, the width of the horizontal pixel partition can be divided into the following two cases:
[0140] In the first case, if the number of horizontal pixels of the image and the number of parallel scanning channels are non-integer multiples of the number of horizontal backlight partitions, a rounding function is used to determine the first horizontal width and the second horizontal width of the horizontal pixel partition according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, wherein the first horizontal width and the second horizontal width are integer clock cycles.
[0141] In the second case, if the number of horizontal pixels of the image and the number of parallel scanning channels are integer multiples of the number of horizontal backlight partitions, a third horizontal width of the horizontal pixel partition is determined according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, wherein the third horizontal width is an integer number of clock cycles.
[0142] That is, when the number of horizontal pixels of the image and the number of horizontal backlight partitions are not divisible in value, in order to prevent the width of each horizontal pixel partition from being a non-integer value, the width of the horizontal pixel partition is divided into two cases where the width difference is 1, that is, the first horizontal width and the second horizontal width differ by one clock cycle. When the number of horizontal pixels of the image and the number of horizontal backlight partitions are divisible in value, the width of each horizontal pixel partition is an integer number of clock cycles.
[0143] Similarly, in the vertical direction, according to the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions, the width of the vertical pixel partition may also include the following two cases:
[0144] In the first case, if the number of vertical pixels of the image and the number of vertical backlight partitions are non-integer multiples, the first vertical width and the second vertical width of the vertical pixel partition are determined according to the number of vertical pixels of the image and the number of vertical backlight partitions and by using a rounding function;
[0145] In the second case, if the number of vertical pixels of the image and the number of vertical backlight partitions are integer multiples, the third vertical width of the pixel vertical partition is determined according to the number of vertical pixels of the image and the number of vertical backlight partitions.
[0146] That is to say, when the number of vertical pixels of the image and the number of vertical backlight partitions are not divisible in value, in order to prevent the width of each vertical pixel partition from being a non-integer value, the width of the vertical pixel partition is divided into two cases where the width difference is 1, that is, the first vertical width and the second vertical width differ by one pixel row. When the number of vertical pixels of the image and the number of vertical backlight partitions are divisible in value, the width of each vertical pixel partition is an integer number of pixel rows.
[0147] In this embodiment, the determining the first horizontal width and the second horizontal width of the horizontal pixel partition by using a rounding function according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions may include: determining the number of horizontal scans of the image according to a multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels; determining the first horizontal width of the horizontal pixel partition by using a rounding-down function according to the number of horizontal scans of the image and the number of horizontal backlight partitions; determining the second horizontal width of the horizontal pixel partition by using a rounding-up function according to the number of horizontal scans of the image and the number of horizontal backlight partitions.
[0148] In this embodiment, determining the first vertical width and the second vertical width of the pixel vertical partition according to the number of vertical pixels of the image and the number of backlight vertical partitions by using a rounding function may include:
[0149] According to the number of vertical pixels of the image and the number of backlight vertical partitions, a first vertical width of the pixel vertical partition is determined using a floor function; according to the number of vertical pixels of the image and the number of backlight vertical partitions, a ceiling function is used to determine the second vertical width of the pixel vertical partition.
[0150] Example 1: In this embodiment, the resolution of the image to be displayed is 4K, that is, the number of horizontal pixels of the image is 4096, the number of vertical pixels of the image is 2160, the backlight partition is 120*85, that is, the number of horizontal backlight partitions is 120, the number of vertical backlight partitions is 85, and the number of parallel scanning channels is 8, to illustrate the above-mentioned determination of the width of the pixel partition.
[0151] Since the number of horizontal pixels of the image 4096 is not divisible by the number of horizontal backlight partitions 120, in this example, there are two widths of horizontal pixel partitions. Considering that the horizontal direction is divided in clock cycles, the number of horizontal image scans can be calculated according to Formula 1, and then the first horizontal width of the horizontal pixel partition can be determined using the floor function according to Formula 2, and then the second horizontal width of the horizontal pixel partition can be determined using the ceiling function according to Formula 3.
[0152] VDCLKH=VDHAC / VDCHNL Formula 1
[0153] KH1 = Floor (VDCLKH / BLHAC) Formula 2
[0154] KH2 = Ceil (VDCLKH / BLHAC) Formula 3
[0155] Among them, VDCLKH is the number of horizontal image scans, VDHAC is the number of horizontal image pixels, VDCHNL is the number of parallel scanning channels, KH1 is the first horizontal width of the pixel horizontal partition, KH2 is the second horizontal width of the pixel horizontal partition, BLHAC is the number of backlight horizontal partitions, Floor() is the floor rounding function, and Ceil() is the ceiling rounding function.
[0156] Through the above calculation, it can be determined that the first horizontal width KH1 is 4, that is, the pixel horizontal partition includes 32 pixel columns in this case, and the second horizontal width KH2 is 5, that is, the pixel horizontal partition includes 40 pixel columns in this case.
[0157] Since the number of image vertical pixels 2160 is not divisible by the number of backlight vertical partitions 85, in this example, there are also two types of pixel vertical partitions of width. In this case, the first vertical width of the pixel vertical partition can be determined by using a floor function according to Formula 4, and then the second vertical width of the pixel vertical partition can be determined by using a ceiling function according to Formula 5.
[0158] KV1 = Floor ((VDVAC) / BLVAC) Formula 4
[0159] KV2 = Ceil ((VDVAC) / BLVAC) Formula 5
[0160] Among them, KV1 is the first vertical width of the pixel vertical partition, KV2 is the second vertical width of the pixel vertical partition, VDVAC is the number of image vertical pixels, and BLVAC is the number of backlight vertical partitions.
[0161] Through the above calculation, it can be determined that the first vertical width KV1 is 25, that is, the vertical pixel partition in this case includes 25 pixel rows, and the second vertical width KV2 is 26, that is, the vertical pixel partition in this case includes 26 pixel rows.
[0162] Example 2: Taking the resolution of the image to be displayed as 4K, that is, the number of horizontal pixels of the image is 4096, the number of vertical pixels of the image is 2160, the backlight partition is 120*90, that is, the number of horizontal backlight partitions is 120, the number of vertical backlight partitions is 90, and the number of parallel scanning channels is 8 as an example, in this case, the number of vertical pixels of the image 2160 and the number of vertical backlight partitions 90 are divisible by each other. Therefore, in the vertical direction, the pixel vertical partition has only one width, that is, each pixel vertical partition includes 24 pixel rows.
[0163] In Example 1, the number of horizontal pixels of the image and the number of horizontal backlight partitions, as well as the number of vertical pixels of the image and the number of vertical backlight partitions are not divisible, and in Example 2, the number of horizontal pixels of the image and the number of horizontal backlight partitions are not divisible, but the number of vertical pixels of the image and the number of vertical backlight partitions are divisible. In actual applications, there will be four combinations of each other, and the calculation principle is the same, which will not be repeated here.
[0164] It can be known from step 1021 that the number of horizontal pixels of the image and the number of horizontal backlight partitions are divisible or not divisible. In the divisible case, there is only one pixel horizontal partition with one width, and the number of pixel horizontal partitions with this width is equal to the number of horizontal backlight partitions. In the not divisible case, there are two pixel horizontal partitions with two widths, and the number of pixel horizontal partitions with each width can be determined according to step 1022. Similarly, the number of pixel vertical partitions with each width in the vertical direction can also be determined.
[0165] In step 1022, the number of pixel horizontal partitions of different widths arranged on pixel rows is determined based on the number of horizontal pixels of the image, the number of parallel scanning channels and the number of backlight horizontal partitions, and the number of pixel vertical partitions of different widths arranged on pixel columns is determined based on the number of vertical pixels of the image and the number of backlight vertical partitions.
[0166] For ease of description, the pixel horizontal partition of the first horizontal width is called the first pixel horizontal partition, the pixel horizontal partition of the second horizontal width is called the second pixel horizontal partition, the pixel vertical partition of the first vertical width is called the first pixel vertical partition, and the pixel vertical partition of the second vertical width is called the second pixel vertical partition.
[0167] In order to obtain the number of arrangements of the first pixel horizontal partition and the second pixel horizontal partition, an equation can be constructed according to known conditions, as shown in Formula 6, and then the number of arrangements of the first pixel horizontal partition and the second pixel horizontal partition can be solved. Specifically, the equation is constructed according to the fact that the sum of the number of arrangements of the first pixel horizontal partition and the number of arrangements of the second pixel horizontal partition is equal to the number of backlight horizontal partitions, the sum of the number of arrangements of the first pixel horizontal partition multiplied by the width of the first pixel horizontal partition and the number of arrangements of the second pixel horizontal partition multiplied by the width of the second pixel horizontal partition is equal to the number of horizontal scans of the image, and the difference between the width of the first pixel horizontal partition and the width of the second pixel horizontal partition is equal to 1, and the equation can be solved to obtain the number of arrangements of the first pixel horizontal partition and the second pixel horizontal partition.
[0168]
[0169] In Formula 6, xH is the number of arrangements of the first pixel horizontal partitions, and yH is the number of arrangements of the second pixel horizontal partitions.
[0170] In this embodiment, determining the number of pixel horizontal partitions of different widths arranged on a pixel row based on the number of horizontal pixels of the image, the number of parallel scanning channels and the number of backlight horizontal partitions may include: determining the number of the first pixel horizontal partitions arranged on a pixel row as the difference between the product of the second horizontal width and the number of backlight horizontal partitions and the number of horizontal scan times of the image; determining the number of the second pixel horizontal partitions arranged on the pixel row as the difference between the number of backlight horizontal partitions and the product of the number of horizontal scan times of the image and the first horizontal width, wherein the number of horizontal scan times of the image is determined based on the number of horizontal pixels of the image and the number of parallel scanning channels.
[0171] Formula 6 is transformed to obtain Formula 7, and the number of arrangement of the first pixel horizontal partitions and the second pixel horizontal partitions is determined according to Formula 7.
[0172]
[0173] Continuing with the above Example 1, using Formula 7, it can be obtained that the number of arrangements xH of the first pixel horizontal partitions is 88, and the number of arrangements yH of the second pixel horizontal partitions is 32.
[0174] Similarly, determining the number of pixel vertical partitions of different widths arranged in the pixel column based on the number of vertical pixels of the image and the number of backlight vertical partitions may include: determining the difference between the product of the second vertical width and the number of backlight vertical partitions and the number of vertical pixels of the image as the number of the first pixel vertical partitions arranged in the pixel column; and determining the difference between the number of vertical pixels of the image and the product of the first vertical width and the number of backlight vertical partitions as the number of the second pixel vertical partitions arranged in the pixel column.
[0175] In this embodiment, the arrangement quantity of the first pixel vertical partition and the second pixel vertical partition may be determined by Formula 8.
[0176]
[0177] In Formula 8, xV is the number of arrangement of the first pixel vertical partitions, and yV is the number of arrangement of the second pixel vertical partitions.
[0178] After obtaining the number of arranged pixel horizontal partitions of different widths in the horizontal direction according to step 1022, in order to evenly partition the first pixel horizontal partition and the second pixel horizontal partition in the horizontal direction, it is necessary to determine the horizontal arrangement sequence SEQH of the pixel horizontal partitions of different widths; similarly, after obtaining the number of arranged pixel vertical partitions of different widths in the vertical direction, in order to evenly partition the first pixel vertical partition and the second pixel vertical partition in the vertical direction, it is necessary to determine the horizontal arrangement sequence SEQV of the pixel vertical partitions of different widths.
[0179] In step 1023, a horizontal arrangement sequence of pixel horizontal partitions of different widths and a vertical arrangement sequence of pixel vertical partitions of different widths are determined.
[0180] In this embodiment, determining the horizontal arrangement sequence of pixel horizontal partitions of different widths may include:
[0181] Determining an arrangement ratio according to a ratio of the number of the first pixel horizontal subareas arranged on the pixel row to the number of the second pixel horizontal subareas arranged on the pixel row;
[0182] The arrangement ratio is rounded down and then added to the unit clock period to obtain an arrangement period;
[0183] If the arrangement period is not equal to the set period, half of the arrangement ratio is rounded down and added to the unit clock period to obtain an arrangement half period; if the arrangement period is equal to the set period, the unit clock period is determined as the arrangement half period;
[0184] The arrangement remainder is obtained by subtracting the arrangement ratio from the arrangement number of the first pixel horizontal partitions on the pixel row and multiplying the arrangement ratio by the arrangement number of the second pixel horizontal partitions on the pixel row;
[0185] For each pixel horizontal partition, according to the relationship between the serial number of the pixel horizontal partition, the remainder of the arrangement period and the arrangement half period, determine the position where the current pixel horizontal partition serial number is located to arrange the first pixel horizontal partition or the second pixel horizontal partition, and when the set conditions are met, arrange the first pixel horizontal partition at the position where the next pixel horizontal partition serial number is located, and the set conditions include that the serial number of the pixel horizontal partition and the remainder of the arrangement period are zero, and the sum of the arrangement remainders is greater than the number of arrangements of the second pixel horizontal partitions on the pixel row.
[0186] In this embodiment, the arrangement ratio can be determined using Formula 9, then the arrangement period can be determined using Formula 10, then the arrangement half period can be determined using Formula 11, and finally the arrangement remainder can be determined using Formula 12.
[0187]
[0188] Th=floor(zh)+1 Formula 10
[0189]
[0190] rmdh=xH-floor(zh)*yH Formula 12
[0191] In the above formula, zh is the arrangement ratio, Th is the arrangement period, and Th half is the permutation half period, and rmdh is the permutation remainder.
[0192] In this embodiment, determining the position where the current pixel horizontal partition sequence number is located to arrange the first pixel horizontal partition or the second pixel horizontal partition according to the sequence number of the pixel horizontal partition and the relationship between the remainder of the arrangement period and the arrangement half period may include:
[0193] If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are equal to the arrangement half period, determining the position where the pixel horizontal partition is located and arranging the second pixel horizontal partition;
[0194] If the serial number of the pixel horizontal partition and the remainder of the arrangement period are not equal to the arrangement half period, the position where the pixel horizontal partition is located is determined to arrange the first pixel horizontal partition.
[0195] In the case of non-divisibility, the size of the pixel horizontal partition in the horizontal direction includes two cases. When the number of the first pixel horizontal partition is greater than the number of the second pixel horizontal partition, that is, when xH>yH, it can be defined that the first pixel horizontal partition with a width of the first horizontal width KH1 is identified by '0' in the horizontal arrangement sequence SEQH, and the second pixel horizontal partition with a width of the second horizontal width KH2 is identified by '1'. At the same time, according to the total number of pixel horizontal partitions, it can be determined that the horizontal arrangement sequence SEQH is a maximum of 120, so the horizontal sorting sequence can be initialized to 120 bits '0'.
[0196] Taking the calculation of the horizontal arrangement sequence as an example, in the following example, let i count from 1 to the number of backlight horizontal partitions BLHAC, and let j count from 0 to the number of backlight horizontal partitions BLHAC-1, and calculate the arrangement of each pixel horizontal partition, where i is the serial number of the pixel horizontal partition, and j is the serial number of the horizontal arrangement sequence.
[0197] Determine the remainder of count i with respect to Th, and select '0' or '1' to fill the sequence according to the remainder value.
[0198] 1. When mod(i,Th)=Th half In the case of , the jth bit of the horizontal arrangement sequence SEQH is filled with '1';
[0199] 2. When mod(i, Th) = other values, the jth bit of the horizontal arrangement sequence SEQH is filled with '0';
[0200] 3. When mod(i, Th) = other values and mod(i, Th) = 0, according to rmdh cnt =rmdh cnt +rmdh accumulates the remainders of the permutations to obtain the sum of the remainders of the permutations rmdh cnt , where rmdh cnt The initial value is equal to 0, and the remainder is accumulated according to the permutation and rmdh cnt The value of further determines whether additional padding bits are needed:
[0201] If rmdh cnt ≥yH, additional padding bits are required, that is, fill '0' at the j+1th bit of the horizontal arrangement sequence SEQH, and according to rmdh cnt =rmdh cnt -yH fix rmdhcnt At the same time, the counting period BLHAC of i is reduced by one to ensure that the total number of bits filled in the horizontal arrangement sequence is equal to BLHAC.
[0202] If rmdh cnt <yH, no additional padding bits are required, that is, no processing is performed.
[0203] If xh<yh, the calculation method of the horizontal arrangement sequence is similar, that is, the '0' and '1', as well as xH and yH in the above judgment logic are exchanged.
[0204] Continuing with Example 1, the process of determining the horizontal arrangement sequence of pixel horizontal partitions of different widths is described. The arrangement ratio determined by Formula 9 is 2.75, the arrangement period Th determined by Formula 10 is 3, and the arrangement half period Th determined by Formula 11 is half is 2, and the permutation remainder rmdh determined according to formula 12 is 24.
[0205] Figure 3 is a schematic diagram of determining the horizontal arrangement sequence in Example 1 according to an embodiment of the present invention, such as Figure 3 As shown, based on the above parameters obtained, the horizontal arrangement sequence is determined.
[0206] When i=1, j=0, mod(1,3)=1, since 1 is not equal to the arrangement half period Th half , so in the case of other values, in the jth position of the horizontal arrangement sequence SEQH (i.e. Figure 3 0th position in ), fill with '0'.
[0207] In the case of i=2, j=1, mod(2,3)=2, since 2 is equal to the arrangement half period Th half In this case, at the jth position (i.e. Figure 3 The first bit in the byte is filled with '1'.
[0208] In the case of i=3, j=2, mod(3,3)=0, since 0 is not equal to the arrangement half period Th half In this case, the jth position of the horizontal arrangement sequence SEQH (i.e. Figure 3 The second position in is filled with '0'.
[0209] Since mod(3,3)=0 when i=3 and j=2, in this case, the permutation remainders are accumulated to determine whether additional padding bits are needed. When i=3, the permutation remainder rmdh is 0.75*32=24. cnt =0, according to rmdh cnt =rmdh cnt+rmdh to get the sum of the remainder of the permutation rmdh cnt =24. Since 24<32, no processing is done.
[0210] In the case of i=4, j=3, mod(4,3)=1, since 1 is not equal to the arrangement half period Th half In this case, the jth position of the horizontal arrangement sequence SEQH (i.e. Figure 3 The third bit in is filled with '0'.
[0211] In the case of i=5, j=4, mod(5,3)=2, since 2 is equal to the arrangement half period Th half In this case, the jth bit, ie, the 4th bit of the horizontal arrangement sequence SEQH is filled with '1'.
[0212] When i=6, j=5, mod(6,3)=0, since 0 is not equal to the arrangement half period Th half In this case, the jth bit, ie, the 5th bit of the horizontal arrangement sequence SEQH is filled with '0'.
[0213] Since mod(6,3)=0 when i=6, in this case, the permutation remainders are accumulated to determine whether additional padding bits are needed. When i=6, the permutation remainder rmdh is 0.75*32=24. When i=3, rmdh cnt =24, according to rmdh cnt =rmdh cnt +rmdh to get the sum of the remainder of the permutation rmdh cnt =48, since 48>32, the j+1th bit of the horizontal arrangement sequence SEQH, that is, the 6th bit is filled with '0', and according to rmdh cnt =rmdh cnt -yH fix rmdh cnt , the corrected rmdh cnt =16.
[0214] When i=7, j=7, and so on, a horizontal arrangement sequence SEQH is obtained.
[0215] When the FPGA is used to determine the horizontal arrangement sequence SEQH by the above method, and the value of each bit in the horizontal arrangement sequence SEQH is subsequently read, addressing operations are involved, which will occupy a large amount of computing resources. In order to reduce computing resources, the present invention starts filling data from one end of the sequence when determining the horizontal arrangement sequence SEQH, that is, it can be filled from the highest bit or from the lowest bit. For example, when filling from the highest bit, when performing each filling except the first filling, the filled sequence is first shifted to the lower bit unit length (that is, shifted to the right by 1 bit) so that the latest bit data is filled in the highest bit. Since the actual number of pixel horizontal partitions is not necessarily equal to the maximum value of the preset backlight horizontal partition number (for example, 120), therefore, after the filling operation is performed, the filled sequence is bit-shifted and sunk to the bottom according to the difference between the number of pixel horizontal partitions and the maximum value of the number of backlight horizontal partitions.
[0216] Therefore, the method of the present invention further comprises:
[0217] Initialize a sequence of set length and the number of pixel horizontal partitions;
[0218] If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are equal to the arrangement half period, and it is not the first time to fill the sequence, then after shifting the filled sequence to the lower position by a unit length, fill the highest position of the sequence with 1;
[0219] If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are not equal to the arrangement half period, and it is not the first time to fill the sequence, the filled sequence is shifted to the lower position by a unit length, and then the highest position of the sequence is filled with 0;
[0220] If the remainder of the sequence number of the pixel horizontal partition and the arrangement period is 0, and the sum of the arrangement remainders is greater than the number of the second pixel horizontal partitions arranged on the pixel row, the filled sequence is shifted to the lower bit by a unit length, 0 is filled in the highest bit of the sequence, and the number of backlight horizontal partitions is updated;
[0221] If the sequence number of the pixel horizontal partition is equal to the updated number of backlight horizontal partitions, the filled valid bits are shifted to the lowest bit of the sequence to obtain the horizontal arrangement sequence.
[0222] Figure 4A is a flow chart showing determination of a horizontal arrangement sequence according to an embodiment of the present invention. Figure 4A As shown, in this embodiment, let i count from 1 to BLHAC, and calculate the arrangement of each pixel horizontal partition:
[0223] Determine the remainder of count i with respect to Th, and select '0' or '1' to fill the sequence according to the remainder value. Each time filling, the previous sequence is moved 1 bit to the lower position, and the latest sequence data fills the highest position.
[0224] 1. When mod(i,Th)=Th half In the case of , the highest bit of the horizontal arrangement sequence SEQH is filled with '1';
[0225] 2. When mod(i, Th) = other values, the highest bit of the horizontal arrangement sequence SEQH is filled with '0';
[0226] 3. When mod(i, Th) = other values and mod(i, Th) = 0, the remainders of the permutations are accumulated and calculated rmdh cnt =rmdh cnt +rmdh, and add the remainder according to the arrangement and rmdh cnt The value of determines whether additional padding bits are needed:
[0227] If rmdh cnt ≥yH, the highest bit of the horizontal arrangement sequence SEQH is filled with '0', and according to rmdh cnt =rmdh cnt -yH fix rmdh cnt At the same time, the i-th counting cycle BLHAC is reduced by one to ensure that the total number of bits filled in the horizontal arrangement sequence is equal to BLHAC.
[0228] If rmdh cnt <yH, no processing is done.
[0229] After i counting is completed, the bit is shifted to the bottom, and the filled valid bit is shifted to the lowest bit of the sequence, which is the number of shifts seqh shiftcnt The value is: seqh shiftcnt =120-BLHAC.
[0230] Figure 4B is a schematic diagram of determining the horizontal arrangement sequence in Example 1 according to an embodiment of the present invention. Figure 3 The horizontal arrangement sequence determined by the method shown is as follows Figure 4B shown.
[0231] In the case of i=1, mod(1,3)=1, since 1 is not equal to the arrangement half period Th half , so if it belongs to other values, fill the highest bit of the sequence with '0', that is, Figure 4B As shown, the 119th bit is filled with '0'.
[0232] In the case of i=2, mod(2,3)=2, since 2 is equal to the arrangement half period Th half , and it is not the first filling, then shift the filled sequence to the right by 1 bit and fill the highest bit of the sequence with '1', that is, Figure 4B As shown, the 119th bit is filled with '1'.
[0233] In the case of i=3, mod(3,3)=0, since 0 is not equal to the arrangement half period Th half , and it is not the first filling, then shift the filled sequence to the right by 1 bit and fill the highest bit of the sequence with '0', that is, Figure 4B As shown, the 119th bit is filled with '0'.
[0234] Since when i=3, although mod(3,3)=0, the accumulated sum of the permutation remainders does not meet the preset condition, no additional padding bits are required.
[0235] By analogy, until i equals the updated number of backlight horizontal partitions, the filled valid bits are shifted to the lowest bit of the sequence to obtain the horizontal arrangement sequence SEQH. For example, when the number of backlight horizontal partitions is 70, the filled valid bits need to be shifted 50 bits to the right to the lowest bit of the sequence.
[0236] The above embodiment introduces the case where the number is not divisible. In the case where the number is divisible, there is only one width of the horizontal pixel partition. In this case, the length of the horizontal arrangement sequence can be set to the number of backlight horizontal partitions, and all values in the horizontal arrangement sequence are '0' or '1'.
[0237] Similarly, the arrangement direction of the sequence SEQV in the vertical direction can be calculated. Since the calculation principle is the same, it will not be repeated here.
[0238] In step 1024, a pixel partition corresponding to each backlight partition in the image to be displayed is determined according to the horizontal arrangement sequence and the vertical arrangement sequence.
[0239] When performing basic backlight statistics, it is necessary to calculate the mean of all pixels in each pixel partition. This process involves division. Since FPGA requires dozens of clock cycles to delay division, it is impossible to obtain results in real time. Therefore, the present invention uses an iterative method to convert division into multiplication for calculation, that is, according to the division quantization parameter and pixel sum of the pixel partition, the pixel average value of the pixel partition is determined. Specifically, the pixel average value of the pixel partition can be determined by formula 13.
[0240] Bavg=(Bsum*DIVPARAM)>>DIVBIT Formula 13
[0241] In Formula 13, Bavg is the pixel average, Bsum is the pixel sum, DIVPARAM is the division quantization parameter, and DIVBIT is the quantization bit. The DIVPARAM can be determined according to Formula 14.
[0242]
[0243] In this embodiment, the division quantization parameter can be determined in the following manner: obtaining the maximum number of pixels in the horizontal direction and the maximum number of pixels in the vertical direction of the pixel partition; determining the quantization bit based on the maximum number of pixels in the horizontal direction and the maximum number of pixels in the vertical direction; determining the division quantization parameter corresponding to the pixel partition based on the number of pixels in the pixel partition and the quantization bit.
[0244] In this embodiment, according to the quantization error statistics, the accuracy can be satisfied if the integer bits after quantization are 16 bits. Therefore, in this embodiment, the quantization bits can be determined by formula 16.
[0245] DIVBIT=bitnum(Kh*VDCHNL*Kv)+16 Formula 16
[0246] In Formula 16, DIVBIT is the quantization bit, bitnum() is the binary bit width operation for obtaining data, and in Formula 16, Kh takes the maximum number of pixels in the horizontal direction, and Kv takes the maximum number of pixels in the vertical direction. Taking the pixel partition in Example 1 as an example, Kh takes the maximum number of pixels in the horizontal direction of the pixel partition, which is 5*8=40, and Kv takes the maximum number of pixels in the vertical direction of the pixel partition, which is 26.
[0247] In the present invention, the bit width is dynamically calculated by the number of pixels in the horizontal and vertical directions of the pixel partition, which can save resources compared to setting a fixed bit width (in order to adapt to different scenarios, the fixed bit width is usually set to a larger value, which will cause a waste of resources).
[0248] In one implementation, since the pixel partitions may have two widths in both the horizontal and vertical directions, such as Example 1, in this case, different types of pixel partitions may be obtained by combining the pixel partition width in the horizontal direction and the pixel partition width in the vertical direction, wherein the first type of pixel partition has a first horizontal width and a first vertical width, the second type of pixel partition has a first horizontal width and a second vertical width, the third type of pixel partition has a second horizontal width and a first vertical width, and the fourth type of pixel partition has a second horizontal width and a second vertical width.
[0249] Since different types of pixel partitions have different numbers of pixels, the division quantization parameters corresponding to different types of pixel partitions are also different. Therefore, determining the division quantization parameter corresponding to the pixel partition according to the number of pixels in the pixel partition and the quantization bit may include:
[0250] If the type of the pixel partition is the first type, determining a first number of pixels in the pixel partition of the first type according to the first horizontal width and the first vertical width, and determining a first division quantization parameter corresponding to the pixel partition of the first type according to the first number of pixels and the quantization bit;
[0251] If the type of the pixel partition is the second type, determining a second number of pixels in the pixel partition of the second type according to the first horizontal width and the second vertical width, and determining a second division quantization parameter corresponding to the pixel partition of the second type according to the second number of pixels and the quantization bit;
[0252] If the type of the pixel partition is the third type, determining a third number of pixels in the pixel partition of the third type according to the second horizontal width and the first vertical width, and determining a third division quantization parameter corresponding to the pixel partition of the third type according to the third number of pixels and the quantization bit;
[0253] If the type of the pixel partition is the fourth type, the fourth number of pixels in the fourth type of pixel partition is determined according to the second horizontal width and the second vertical width, and the fourth division quantization parameter corresponding to the fourth type of pixel partition is determined according to the fourth number of pixels and the quantization bit.
[0254] In this example, the division quantization parameters corresponding to different types of pixel partitions can be determined by formula 17.
[0255]
[0256] In Formula 17, DIVPARAM1 is the division quantization parameter corresponding to the first type of pixel partition, DIVPARAM2 is the division quantization parameter corresponding to the second type of pixel partition, DIVPARAM3 is the division quantization parameter corresponding to the third type of pixel partition, and DIVPARAM4 is the division quantization parameter corresponding to the fourth type of pixel partition.
[0257] In actual application, after the derived parameters used in the control process are obtained according to the basic parameters of the backlight specification and the video specification, the size of each pixel partition and the number of total pixel partitions are dynamically adjusted by the derived parameters, and the basic backlight data and target backlight data of the pixel partition are calculated in real time. The following embodiment will specifically introduce the process of calculating the basic backlight data and the target backlight data.
[0258] In this embodiment, the maximum value of pixels in the pixel partition can be determined by formula 18.
[0259] BLmax=max(Pmax(i,j)) i∈m,j∈n Formula 18
[0260] Pmax(i,j)=max(R(i,j),G(i,j),B(i,j)) Formula 19
[0261] In the above formula, BLmax is the maximum pixel value in the pixel partition, Pmax(i,j) is the maximum pixel value of the i-th row and j-th column, R(i,j) is the red pixel value of the i-th row and j-th column, G(i,j) is the green pixel value of the i-th row and j-th column, B(i,j) is the blue pixel value of the i-th row and j-th column, m is the number of pixels in the pixel partition in the horizontal direction, and n is the number of pixels in the pixel partition in the vertical direction.
[0262]
[0263] In formula 20, BLavg is the pixel average value of the pixel partition, is the sum of pixels in the pixel partition, DIVPARAM is the division quantization parameter, and DIVBIT is the quantization bit.
[0264] In this embodiment, the basic backlight data of the backlight partition corresponding to the pixel partition can be determined by formula 21.
[0265] BL=α*BLavg+(1-α)*BLmax Formula 21
[0266] In Formula 21, BL is the basic backlight data and α is the weight.
[0267] This embodiment adopts a maximum value and average value weighted algorithm to determine the basic backlight data of the backlight partition, which can not only adjust the proportion of the maximum value and average value in the basic backlight data through the weighting coefficient, but also retain the advantages of the two algorithms and make up for the disadvantages of the two algorithms to a certain extent.
[0268] In this embodiment, the partition backlight calculation module is responsible for extracting the backlight brightness of each pixel partition from the image to be displayed to control the lighting of the MLED partition backlight. The partition backlight calculation module is divided into two parts: a basic backlight calculation module and a backlight smoothing filter module.
[0269] In order to adapt to the real-time changing basic parameter information, the basic backlight calculation module has been improved in terms of counting and storage, which will be introduced in the following embodiments respectively.
[0270] In terms of counting, in actual calculation, the size of each pixel partition is not unique. There are two widths, KH1 and KH2, in the horizontal direction, and two widths, KV1 and KV2, in the vertical direction. And each frame faces the situation of updating the parameter. Therefore, four counters are needed to identify the partition of the current pixel, and then the partition size of the current pixel partition is obtained from the SEQH and SEQV sequences. Among them, the four counters are: a clock number counter in the horizontal pixel partition, a pixel row number counter in the vertical pixel partition, a pixel horizontal partition number counter, and a pixel vertical partition number counter. In this case, the method also includes:
[0271] When a data enable signal is received, the clock number counter in the pixel horizontal partition is updated, and when the value corresponding to the clock number counter in the pixel horizontal partition is equal to the width of the pixel horizontal partition, the clock number counter in the pixel horizontal partition is reset;
[0272] When resetting the clock number counter in the pixel horizontal partition, updating the pixel horizontal partition number counter, and when the value corresponding to the pixel horizontal partition number counter is equal to the number of backlight horizontal partitions, resetting the pixel horizontal partition number counter;
[0273] When resetting the pixel horizontal partition number counter, updating the pixel row number counter in the pixel vertical partition, and when the value corresponding to the pixel row number counter in the pixel vertical partition is equal to the number of pixel rows in the pixel vertical partition, resetting the pixel row number counter in the pixel vertical partition;
[0274] When the pixel row number counter in the pixel vertical partition is reset, the pixel vertical partition number counter is updated, and when the value corresponding to the pixel vertical partition number counter is equal to the number of backlight vertical partitions, the pixel vertical partition number counter is reset.
[0275] Among them, the data enable signal is referred to as DE (dataenable) signal, which is a valid data selection signal, also known as a valid data signal. In the LCD circuit, there are many symbols for it, such as dsp, dsptmg, den, de, etc. The de signal is a high-level valid signal, and the video data signal corresponding to the high-level period of the DE signal is considered to be a valid data signal.
[0276] In this embodiment, different counters correspond to different symbols:
[0277] Clock count counter in pixel horizontal partition: CLK hcnt ;
[0278] Pixel row counter in vertical pixel partition: CLK vcnt ;
[0279] Pixel horizontal partition number counter: BLK hcnt ;
[0280] Pixel vertical partition number counter: BLK vcnt .
[0281] In other words, the counting rules are as follows:
[0282] ①CLK hcnt : The count is incremented by DE effective high level; count the clock cycles scanned in each row to the maximum width CLK of the current pixel horizontal partition hcnt _ max In case the counter CLK hcnt Reset to 1;
[0283] ②BLK hcnt : By CLK hcnt The count is incremented when reset; the number of pixel horizontal partitions scanned in each row is counted to the backlight horizontal partition number BLHAC, and the CLK in the last pixel horizontal partition in the row is triggered. hcnt In case of reset, the counter BLK hcn Reset to 1;
[0284] ③CLK vcnt : By BLK hcnt The count is triggered to increase by one when the count is reset; the number of pixel rows scanned in each frame is counted to the maximum width of the current pixel vertical partition CLK vcnt_max In case the counter CLK vcnt Reset to 1;
[0285] ④BLK vcnt : By CLK vcntWhen the count is reset, the count is incremented; when the number of pixel partition rows scanned in each frame reaches the total number of backlight vertical partitions BLVAC, the counter BLK vcnt Reset to 1;
[0286] ⑤ The maximum width of the horizontal pixel partition and the maximum width of the vertical pixel partition in the above 1 and 3 are not unique values, and need to be obtained based on the derived parameters SEQH and SEQV.
[0287] When reading the SEQH sequence, it can be read from a specified end, for example, it can be read from the lowest bit. When performing each read except the first read, the remaining bits are first shifted to the high bit, thereby avoiding the addressing operation and reducing the occupation of computing resources. Specifically including:
[0288] If the current SEQH lowest bit value is '0', the current CLK hcnt Count maximum value CLK hcnt_max =KH1;
[0289] If the current SEQH lowest bit value is '1', the current CLK hcnt Count maximum value CLK hcnt_max =KH2;
[0290] After the parameter calculation module completes the parameter calculation at the beginning of each frame, SEQH obtains the current latest arrangement sequence; whenever CLK hcnt When the count is reset, i.e. when the next pixel horizontal partition is switched: the SEQH sequence is shifted right by 1 bit.
[0291] In the application process, in order to avoid the loss of values in the SEQH sequence due to shifting after scanning a row, a copy can be cached before executing the above reading process.
[0292] Similarly, the vertical direction judgment logic is the same as that of the horizontal direction.
[0293] Figure 5 The figure is a schematic diagram showing the arrangement of image and pixel partitions and the counting of four counters according to an embodiment of the present invention. During the data validity period, each pixel in each pixel partition is traversed in a 'Z-shaped' manner to perform data statistics and calculations. Figure 5 As shown, the image 500 can be divided into a plurality of pixel partitions. By partially enlarging the pixel partition 501, it can be seen that one pixel partition includes a plurality of clock cycles in the horizontal direction and a plurality of pixel rows in the vertical direction. A clock cycle 502 includes a plurality of pixel columns. If it is assumed that the number of parallel scanning channels is equal to 8, then one clock cycle includes 8 pixel columns.
[0294] In terms of storage, the backlight calculation in the basic backlight module requires data cache storage, mainly because the backlight is calculated based on pixel partitions, and the data stream is not transmitted sequentially according to each pixel partition. Therefore, it is necessary to cache the intermediate calculation results of each pixel partition during the row scanning calculation process. The target backlight data of a pixel partition can only be calculated after all rows and columns of a pixel partition are completely scanned and calculated.
[0295] In the present invention, the memory RAM instantiates 4 storage spaces in total, which are divided into two groups for storing intermediate calculation results: the maximum value of candidate pixels and the sum of candidate pixels. Two RAMs are instantiated in each group using a ping-pong strategy. The purpose of the ping-pong strategy is to separate the RAM writing backlight data and the RAM clearing operation, such as Figure 6 As shown, when the reading and writing of RAM1 is triggered after the backlight partition data is calculated in the current frame, RAM2 will synchronously write '0', so that the backlight data written in the previous frame in all addresses of RAM2 can be cleared, thereby eliminating the residual data of the previous frame and will not cause interference when reading and writing RAM during the calculation of the backlight partition data of the next frame.
[0296] During the video pixel scanning transmission process, the above CLK hcnt ,CLK vcnt BLK hcnt BLK vcnt Four counters are used to determine the address that the RAM should read or write. Continuing with Example 1, assuming that CLK hcnt =2,CLK vcnt =3,BLK hcnt =45,BLK vcnt =5, indicating that the current pixel belongs to the pixel partition of the 5th row and the 45th column, and is located in the 3rd row and the 2nd clock cycle of the pixel partition.
[0297] The effective storage capacity of RAM is equal to the maximum number of partitions, and each address stores the maximum value of pixels or the sum of all pixels in each pixel partition. Since a pixel partition row contains multiple pixel rows, when a pixel partition column is scanned in each pixel row, the maximum value of candidate pixels and the sum of candidate pixels in the current pixel row of the current pixel partition can be calculated. For each pixel partition, first read out the maximum value of candidate pixels and the sum of candidate pixels stored in RAM for the current pixel partition (i.e., the value determined according to the pixel row scanned by the current pixel partition), and after performing maximum value judgment and cumulative calculation with the current pixel value, update the maximum value of candidate pixels and the sum of candidate pixels and store them in the address space of the current pixel partition in RAM, and then enter the next pixel partition in the current row to continue execution.
[0298] During the pixel row scanning process, according to CLK hcntDetermine whether the current pixel row of the current partition has completed the temporary value calculation; according to BLK hcnt and BLK vcnt Update the RAM partition read and write addresses to ensure that the temporary row of the current pixel row in the current partition is read from and written to the correct RAM partition address.
[0299] After the basic backlight calculation is completed, the basic backlight data can be smoothed and filtered to make the backlight transition more uniform.
[0300] Before filtering the basic backlight data, the data can be padded (Padding) to add a row or column of '0' above, below, left, and right of the basic backlight data image. The padding operation can be achieved by controlling the write RAM address of the basic backlight data received: the address space is instantiated as a filter RAM with (BLHAC+2) columns and (BLVAC+2) rows. When writing the received basic backlight data into the filter RAM, the second row and second column of the filter RAM are used as the starting point to write, thereby achieving the padding effect. The storage of the basic backlight data in the filter RAM is as follows: Figure 7 shown.
[0301] After completing the basic backlight data storage, filtering starts from the valid backlight write address, that is, the second row and second column is the filtering starting point, the filtering row step and column step are both 1 pixel, and BLHAC filtering is completed for each row, and BLVAC rows are executed in total.
[0302] In the present invention, the backlight filtering can adopt 3*3 weighted maximum filtering, such as Figure 8 The figure shows the 3*3 filter kernel coefficient, where the center value coefficient is 1 and the surrounding filter coefficient is β. The filter kernel coefficient is multiplied by the basic backlight value, and the maximum value is selected from the 9 values obtained as the output value of the center area backlight, that is, the target backlight data.
[0303] At this point, the smoothing filtering of the partition backlight is completed, that is, the partition backlight calculation is completed, and the backlight and the image to be displayed can be controlled to be output synchronously.
[0304] The real-time configurable control method proposed in the present invention supports real-time online adjustment of backlight partition parameters and video specification parameters, provides users with a universal backlight partition dimming method, has better compatibility and portability, reduces project development cycle and cost, and provides a technical basis for the iterative development of MLED display products.
[0305] After the user updates the basic parameter information, the present invention can calculate the derived parameters according to the updated basic parameter information, and adjust the parameters when calculating the backlight data corresponding to the backlight partition according to the derived parameters, so that the present invention can switch to the new parameter mode to work normally.
[0306] The present invention also provides a control device for a backlight module, wherein the backlight module includes a plurality of backlight partitions, and the device includes:
[0307] An acquisition unit, used to acquire the number of horizontal pixels and the number of vertical pixels of the image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module;
[0308] A calculation unit is used to determine the pixel partition corresponding to each backlight partition in the image to be displayed according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions, and determine the backlight data of the backlight partition corresponding to the pixel partition according to the pixel value of each pixel in the pixel partition.
[0309] In this embodiment, the specific implementation process of the acquisition unit and the calculation unit has been specifically described in the above embodiments and will not be repeated here.
[0310] This embodiment may also include a display module, which includes a display panel and a backlight module; the backlight module is controlled by the method described in any one of the above embodiments. The display device including the display module in this embodiment may be: electronic paper, mobile phone, tablet computer, television, laptop computer, digital photo frame, navigator, or any other product or component with display function.
[0311] It should be noted that in the accompanying drawings, the sizes of layers and regions may be exaggerated for clarity of illustration. It is also understood that when an element or layer is referred to as being "on" another element or layer, it may be directly on the other element, or there may be an intermediate layer. In addition, it is understood that when an element or layer is referred to as being "under" another element or layer, it may be directly under the other element, or there may be more than one intermediate layer or element. In addition, it is also understood that when a layer or element is referred to as being "between" two layers or two elements, it may be the only layer between the two layers or two elements, or there may also be more than one intermediate layer or element. Similar reference numerals throughout the text indicate similar elements.
[0312] In the present invention, the terms "first" and "second" are used for descriptive purposes only and cannot be understood as indicating or implying relative importance. The term "plurality" refers to two or more than two, unless otherwise clearly defined.
[0313] Those skilled in the art will readily appreciate other embodiments of the present invention after considering the specification and practicing the disclosure disclosed herein. The present invention is intended to cover any variations, uses or adaptations of the present invention that follow the general principles of the present invention and include common knowledge or customary techniques in the art that are not disclosed by the present invention. The description and examples are to be considered exemplary only, and the true scope and spirit of the present invention are indicated by the following claims.
[0314] It should be understood that the present invention is not limited to the exact construction that has been described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present invention is limited only by the appended claims.
Claims
1. A method for controlling a backlight module, characterized in that: The backlight module includes a plurality of backlight partitions, and the method includes: Acquire the number of horizontal pixels and the number of vertical pixels of the image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module; Determine a pixel partition corresponding to each backlight partition in the image to be displayed according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions; According to the pixel value of each pixel in the pixel partition, backlight data of the backlight partition corresponding to the pixel partition is determined.
2. The method according to claim 1, characterized in that The pixel partitioning is determined according to the pixel horizontal partitioning and the pixel vertical partitioning; Determining the pixel partition corresponding to each backlight partition in the image to be displayed according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions includes: Determine the width of the horizontal pixel partition according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels and the number of horizontal backlight partitions, and determine the width of the vertical pixel partition according to the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions; Determine the number of pixel horizontal partitions of different widths arranged on pixel rows according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of backlight horizontal partitions, and determine the number of pixel vertical partitions of different widths arranged on pixel columns according to the number of vertical pixels of the image and the number of backlight vertical partitions; Determine a horizontal arrangement sequence of pixel horizontal partitions of different widths, and a vertical arrangement sequence of pixel vertical partitions of different widths; A pixel partition corresponding to each backlight partition in the image to be displayed is determined according to the horizontal arrangement sequence and the vertical arrangement sequence.
3. The method according to claim 2, characterized in that The step of determining the width of the horizontal pixel partition according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels and the number of horizontal backlight partitions, and determining the width of the vertical pixel partition according to the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions, comprises: If the number of horizontal pixels of the image and the number of parallel scanning channels are non-integer multiples of the number of horizontal backlight partitions, a first horizontal width and a second horizontal width of the horizontal pixel partition are determined by using a rounding function according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, wherein the first horizontal width and the second horizontal width are integer clock cycles, and the difference between the first horizontal width and the second horizontal width is 1 clock cycle; If the number of horizontal pixels of the image and the number of parallel scanning channels are integer multiples of the number of horizontal backlight partitions, determining a third horizontal width of the pixel horizontal partition according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, wherein the third horizontal width is an integer number of clock cycles; If the number of vertical pixels of the image and the number of vertical backlight partitions are non-integer multiples, determining a first vertical width and a second vertical width of the vertical pixel partition according to the number of vertical pixels of the image and the number of vertical backlight partitions and using a rounding function; If the number of vertical pixels of the image and the number of vertical backlight partitions are integer multiples, a third vertical width of the pixel vertical partition is determined according to the number of vertical pixels of the image and the number of vertical backlight partitions.
4. The method according to claim 3, characterized in that The method of determining the first horizontal width and the second horizontal width of the pixel horizontal partition by using a rounding function according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions comprises: Determine the number of horizontal scans of the image according to the multiple relationship between the number of horizontal pixels of the image and the number of parallel scanning channels; Determine a first horizontal width of a pixel horizontal partition using a floor function according to the number of horizontal scans of the image and the number of backlight horizontal partitions; According to the number of horizontal scans of the image and the number of backlight horizontal partitions, a second horizontal width of the pixel horizontal partition is determined by using an upward rounding function; The method of determining the first vertical width and the second vertical width of the pixel vertical partition according to the number of vertical pixels of the image and the number of backlight vertical partitions by using a rounding function comprises: Determine a first vertical width of a pixel vertical partition by using a floor function according to the number of vertical pixels of the image and the number of backlight vertical partitions; According to the number of vertical pixels of the image and the number of vertical backlight partitions, a first vertical width and a second vertical width of the vertical partition of the pixel are determined by using a round-up function.
5. The method according to claim 2, characterized in that: The pixel horizontal partitions include a first pixel horizontal partition and a second pixel horizontal partition, the width of the first pixel horizontal partition is a first horizontal width, and the width of the second pixel horizontal partition is a second horizontal width; The step of determining the number of arrangement of pixel horizontal partitions of different widths on the pixel row according to the number of horizontal pixels of the image, the number of parallel scanning channels, and the number of backlight horizontal partitions includes: Determine the difference between the product of the second horizontal width and the number of backlight horizontal partitions and the number of horizontal scans of the image as the number of arrangements of the first pixel horizontal partitions on the pixel row, wherein the number of horizontal scans of the image is determined according to the number of horizontal pixels of the image and the number of parallel scanning channels; The difference between the number of the backlight horizontal partitions and the product of the number of horizontal scanning times of the image and the first horizontal width is determined as the number of the second pixel horizontal partitions arranged on the pixel row.
6. The method according to claim 2, characterized in that The pixel vertical partition includes a first pixel vertical partition and a second pixel vertical partition, the first pixel vertical partition has a first vertical width, and the second pixel vertical partition has a second vertical width; The step of determining the number of arrangement of vertical pixel partitions of different widths on the pixel columns according to the number of vertical pixels of the image and the number of vertical backlight partitions comprises: Determine the difference between the product of the second vertical width and the number of the backlight vertical subareas and the number of the image vertical pixels as the number of the first pixel vertical subareas arranged on the pixel column; The difference between the number of vertical pixels of the image and the product of the first vertical width and the number of backlight vertical partitions is determined as the number of second pixel vertical partitions arranged on the pixel column.
7. The method according to claim 2, characterized in that The pixel horizontal partitions include a first pixel horizontal partition and a second pixel horizontal partition, the first pixel horizontal partition and the second pixel horizontal partition having different widths; The step of determining a horizontal arrangement sequence of pixel horizontal partitions of different widths comprises: Determine an arrangement ratio according to a ratio of the number of the first horizontal pixel subareas arranged on the pixel row to the number of the second horizontal pixel subareas arranged on the pixel row; The arrangement ratio is rounded down and then added to the unit clock period to obtain an arrangement period; If the arrangement period is not equal to the set period, half of the arrangement ratio is rounded down and added to the unit clock period to obtain an arrangement half period; if the arrangement period is equal to the set period, the unit clock period is determined as the arrangement half period; The arrangement remainder is obtained by subtracting the arrangement ratio from the arrangement number of the first pixel horizontal partitions on the pixel row and multiplying the arrangement ratio by the arrangement number of the second pixel horizontal partitions on the pixel row; For each pixel horizontal partition, according to the relationship between the serial number of the pixel horizontal partition, the remainder of the arrangement period and the arrangement half period, determine the position where the current pixel horizontal partition serial number is located to arrange the first pixel horizontal partition or the second pixel horizontal partition, and when the set conditions are met, arrange the first pixel horizontal partition at the position where the next pixel horizontal partition serial number is located, and the set conditions include that the serial number of the pixel horizontal partition and the remainder of the arrangement period are zero, and the sum of the arrangement remainders is greater than the number of arrangements of the second pixel horizontal partitions on the pixel row.
8. The method according to claim 7, characterized in that The step of determining the position of the current pixel horizontal partition sequence number to arrange the first pixel horizontal partition or the second pixel horizontal partition according to the sequence number of the pixel horizontal partition and the relationship between the remainder of the arrangement period and the arrangement half period comprises: If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are equal to the arrangement half period, determining the position where the pixel horizontal partition is located and arranging the second pixel horizontal partition; If the serial number of the pixel horizontal partition and the remainder of the arrangement period are not equal to the arrangement half period, the position where the pixel horizontal partition is located is determined to arrange the first pixel horizontal partition.
9. The method according to claim 8, characterized in that In the horizontal arrangement sequence, 0 is used to identify the first pixel horizontal partition, and 1 is used to identify the second pixel horizontal partition, and the method further includes: Initialize a sequence of set length and the number of pixel horizontal partitions; If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are equal to the arrangement half period, and it is not the first time to fill the sequence, then after shifting the filled sequence to the lower position by a unit length, fill the highest position of the sequence with 1; If the sequence number of the pixel horizontal partition and the remainder of the arrangement period are not equal to the arrangement half period, and it is not the first time to fill the sequence, the filled sequence is shifted to the lower position by a unit length, and then the highest position of the sequence is filled with 0; If the remainder of the sequence number of the pixel horizontal partition and the arrangement period is 0, and the sum of the arrangement remainders is greater than the number of the second pixel horizontal partitions arranged on the pixel row, the filled sequence is shifted to the lower bit by a unit length, 0 is filled in the highest bit of the sequence, and the number of backlight horizontal partitions is updated; If the sequence number of the pixel horizontal partition is equal to the updated number of backlight horizontal partitions, the filled valid bits are shifted to the lowest bit of the sequence to obtain the horizontal arrangement sequence.
10. The method according to claim 1, characterized in that The determining, according to the pixel value of each pixel in the pixel partition, the backlight data of the backlight partition corresponding to the pixel partition comprises: According to the pixel value of each pixel in the pixel partition, obtaining the maximum pixel value and the total pixel value in the pixel partition; Determining the pixel average value according to the divided quantization parameter of the pixel partition and the pixel sum; Determining basic backlight data of a backlight partition corresponding to the pixel partition according to the maximum pixel value, the pixel average value and their respective weights; The basic backlight data corresponding to all backlight partitions are filtered to obtain target backlight data for each backlight partition.
11. The method according to claim 10, characterized in that The division quantization parameter is determined in the following manner: Acquire a maximum number of pixels in a horizontal direction and a maximum number of pixels in a vertical direction of a pixel partition, wherein the maximum number of pixels in the horizontal direction is determined according to a width of the pixel partition in the horizontal direction and the number of parallel scanning channels; Determining quantization bits according to the maximum number of pixels in the horizontal direction and the maximum number of pixels in the vertical direction; A division quantization parameter corresponding to the pixel partition is determined according to the number of pixels in the pixel partition and the quantization bit.
12. The method according to claim 11, characterized in that The pixel partitions include different types of pixel partitions, wherein a first type of pixel partition has a first horizontal width and a first vertical width, a second type of pixel partition has a first horizontal width and a second vertical width, a third type of pixel partition has a second horizontal width and a first vertical width, and a fourth type of pixel partition has a second horizontal width and a second vertical width; The determining, according to the number of pixels in the pixel partition and the quantization bit, a division quantization parameter corresponding to the pixel partition comprises: If the type of the pixel partition is the first type, determining a first number of pixels in the pixel partition of the first type according to the first horizontal width and the first vertical width, and determining a first division quantization parameter corresponding to the pixel partition of the first type according to the first number of pixels and the quantization bit; If the type of the pixel partition is the second type, determining a second number of pixels in the pixel partition of the second type according to the first horizontal width and the second vertical width, and determining a second division quantization parameter corresponding to the pixel partition of the second type according to the second number of pixels and the quantization bit; If the type of the pixel partition is the third type, determining a third number of pixels in the pixel partition of the third type according to the second horizontal width and the first vertical width, and determining a third division quantization parameter corresponding to the pixel partition of the third type according to the third number of pixels and the quantization bit; If the type of the pixel partition is the fourth type, the fourth number of pixels in the fourth type of pixel partition is determined according to the second horizontal width and the second vertical width, and the fourth division quantization parameter corresponding to the fourth type of pixel partition is determined according to the fourth number of pixels and the quantization bit.
13. The method according to claim 10, characterized in that Each pixel in the pixel partition corresponds to a plurality of counters, the counters comprising: a clock number counter in a pixel horizontal partition, a pixel row number counter in a pixel vertical partition, a pixel horizontal partition number counter and a pixel vertical partition number counter; the method further comprises: When a data enable signal is received, the clock number counter in the pixel horizontal partition is updated, and when the value corresponding to the clock number counter in the pixel horizontal partition is equal to the width of the pixel horizontal partition, the clock number counter in the pixel horizontal partition is reset; When resetting the clock number counter in the pixel horizontal partition, updating the pixel horizontal partition number counter, and when the value corresponding to the pixel horizontal partition number counter is equal to the number of backlight horizontal partitions, resetting the pixel horizontal partition number counter; When resetting the pixel horizontal partition number counter, updating the pixel row number counter in the pixel vertical partition, and when the value corresponding to the pixel row number counter in the pixel vertical partition is equal to the number of pixel rows in the pixel vertical partition, resetting the pixel row number counter in the pixel vertical partition; When the pixel row number counter in the pixel vertical partition is reset, the pixel vertical partition number counter is updated, and when the value corresponding to the pixel vertical partition number counter is equal to the number of backlight vertical partitions, the pixel vertical partition number counter is reset.
14. The method according to claim 13, characterized in that The width of the pixel horizontal partition is determined by: Get the lowest bit of the horizontal arrangement sequence; If the value corresponding to the least significant bit is 0, the width of the pixel horizontal partition is the first horizontal width; If the value corresponding to the least significant bit is 1, the width of the pixel horizontal partition is the second horizontal width; When the clock number counter in the pixel horizontal partition is reset, the horizontal arrangement sequence is right-shifted by 1 bit.
15. The method according to claim 13, characterized in that The obtaining, according to the pixel value of each pixel in the pixel partition, the maximum pixel value and the total pixel value in the pixel partition comprises: In the process of scanning the image to be displayed, determining the target pixel partition to which the currently scanned pixel belongs according to the pixel horizontal partition number counter and the pixel vertical partition number counter corresponding to the currently scanned pixel; Acquire a maximum value of candidate pixels and a sum of candidate pixels from a storage area corresponding to the target pixel partition; If the pixel value corresponding to the currently scanned pixel is greater than the maximum value of the candidate pixel, the maximum value of the candidate pixel is updated to the pixel value corresponding to the currently scanned pixel; The candidate pixel sum is updated using the pixel value corresponding to the currently scanned pixel.
16. The method according to claim 10, characterized in that The filtering process is performed on the basic backlight data corresponding to all backlight partitions to obtain the target backlight data of each backlight partition, including: Filling operation is performed on the basic backlight data corresponding to all backlight partitions; The basic backlight data after the filling operation is filtered using a preset filter core to obtain target backlight data for each backlight partition, wherein the number of filtering times for each row of basic backlight data is determined according to the number of horizontal backlight partitions, and the number of rows for filtering is determined according to the number of vertical backlight partitions.
17. The method according to claim 1, characterized in that The method further comprises: Cache the image to be displayed in a video frame cache device; When the backlight data of all the backlight partitions are acquired, the backlight data of all the backlight partitions are controlled to be output synchronously with the image to be displayed.
18. A control device for a backlight module, characterized in that: The backlight module includes a plurality of backlight partitions, and the device includes: An acquisition unit, used to acquire the number of horizontal pixels and the number of vertical pixels of the image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and the number of vertical backlight partitions of the backlight module; A calculation unit is used to determine the pixel partition corresponding to each backlight partition in the image to be displayed according to the number of horizontal pixels of the image, the number of vertical pixels of the image, the number of parallel scanning channels, and the quantitative relationship between the number of horizontal backlight partitions and the number of vertical backlight partitions, and determine the backlight data of the backlight partition corresponding to the pixel partition according to the pixel value of each pixel in the pixel partition.
19. A display module, characterized in that: include: Display panel and backlight module; The backlight module is controlled by the method according to any one of claims 1 to 17.
20. A storage medium, characterized in that: Computer instructions are stored, and the computer instructions are used to make a computer execute the method according to any one of claims 1 to 17.
Citation Information
Cited By
Pixel matching method and device, electronic equipment, storage medium and program product
CN119960220A
