Backlight module control method and apparatus, and display module and storage medium
By calculating and updating the backlight data of MiniLED backlight modules in real time and adapting to multiple specifications, the problems of increased development cycle and cost of MiniLED backlight modules are solved, achieving faster iteration and higher compatibility.
Patent Information
- Application Number
- PCT/CN2024/095459
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-06-01
- Filing Date
- 2024-05-27
- Publication Date
- 2024-12-05
AI Technical Summary
In the prior art, the multiple specifications of MiniLED backlight modules lead to an increase in development cycle and development costs, and it is difficult to quickly adapt to backlight partitions of different specifications, affecting product iteration and upgrade.
By obtaining the number of horizontal pixels, vertical pixels, and parallel scanning channels of the image to be displayed, as well as the number of backlight partitions of the backlight module, the pixel partition corresponding to each backlight partition is determined, and the backlight data is calculated based on the pixel value to achieve real-time Updated and adapted to multiple backlit partition specifications.
Without changing the system software and drivers, the development cycle and development cost of MiniLED partition backlit display modules is reduced, and the rapid iteration and compatibility of the product is improved.
Smart Images

Figure CN2024095459_05122024_PF_FP_ABST
Abstract
Description
A backlight module control method, device, display module and storage medium
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This patent application claims priority to Chinese patent application number 2023106466305, filed on June 1, 2023, entitled “A control method, device, display module and storage medium for a backlight module”, the full text of which is incorporated herein by reference. Technical Field
[0003] The present invention relates to the field of display, and in particular to a control method and device for a backlight module, a display module and a storage medium. Background Art
[0004] 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 terms of 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 backlight partition dimming method can be used to control the lighting of each backlight partition.
[0005] However, due to product differentiation, there are backlight partition modules of various specifications. Therefore, a dimming method needs to be developed separately for each specification of the backlight module, which increases the development cycle and development cost of product development.
[0006] Summary of the Invention
[0007] The present invention provides a control method and device for a backlight module, a display module and a storage medium to solve the deficiencies in the related art.
[0008] 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 multiple backlight partitions, and the method includes: obtaining the number of horizontal pixels and the number of vertical pixels of an image to be displayed, the number of parallel scanning channels, and the number of backlight horizontal partitions and the number of backlight vertical partitions of the backlight module; determining the pixel partition corresponding to each backlight partition in the image to be displayed according to 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 horizontal partitions and the number of vertical partitions; and 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.
[0009] In some embodiments, the pixel partition is determined according to the pixel horizontal partition and the pixel vertical partition; the pixel partition corresponding to each backlight partition in the image to be displayed is determined according to the 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, including: determining the width of the pixel horizontal partition according to the relationship between the number of horizontal pixels of the image and the number of parallel scanning channels and the number of backlight horizontal partitions, and determining the width of the pixel horizontal partition according to the relationship between the number of vertical pixels of the image and the number of backlight vertical partitions. Determine the width of the vertical pixel partitions; determine the number of pixel horizontal partitions of different widths arranged on pixel rows based on 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 based on the number of vertical pixels of the image and the number of backlight vertical partitions; determine the horizontal arrangement sequence of pixel horizontal partitions of different widths and the vertical arrangement sequence of pixel vertical partitions of different widths; determine the pixel partition corresponding to each backlight partition in the image to be displayed based on the horizontal arrangement sequence and the vertical arrangement sequence.
[0010] In some embodiments, the width of the pixel horizontal 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 pixel vertical partition is determined according to the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions, including: 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, then according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, a first horizontal width and a second horizontal width of the pixel horizontal partition are determined by using a rounding function, 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. period; 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, then the third horizontal width of the pixel horizontal 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; if the number of vertical pixels of the image and the number of vertical backlight partitions are non-integer multiples, then the first vertical width and the second vertical width of the pixel vertical partition are determined according to the number of vertical pixels of the image and the number of vertical backlight partitions and a rounding function; if the number of vertical pixels of the image and the number of vertical backlight partitions are integer multiples, then 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.
[0011] In some embodiments, determining the first horizontal width and second horizontal width of a pixel horizontal partition using a rounding function based on the number of horizontal image pixels, the number of parallel scanning channels, and the number of horizontal backlight partitions includes: determining the number of horizontal image scans based on the multiple relationship between the number of horizontal image pixels and the number of parallel scanning channels; determining the first horizontal width of the pixel horizontal partition using a floor function based on the number of horizontal image scans and the number of horizontal backlight partitions; and determining the second horizontal width of the pixel horizontal partition using a ceiling function based on the number of horizontal image scans and the number of horizontal backlight partitions. Determining the first vertical width and second vertical width of a pixel vertical partition based on the number of vertical image pixels and the number of vertical backlight partitions using a rounding function includes: determining the first vertical width of the pixel vertical partition using a floor function based on the number of vertical image pixels and the number of vertical backlight partitions; and determining the second vertical width of the pixel vertical partition using a ceiling function based on the number of vertical image pixels and the number of vertical backlight partitions.
[0012] 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; determining the number of pixel horizontal partitions of different widths arranged on the 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 includes: determining the number of the first pixel horizontal partitions arranged on the pixel row by the difference between the product of the second horizontal width and the number of backlight horizontal partitions and the number of horizontal image scans, wherein the number of horizontal image scans is determined based on the number of horizontal pixels of the image and the number of parallel scanning channels; determining the number of the second pixel horizontal partitions arranged on the pixel row by the difference between the number of backlight horizontal partitions and the product of the number of horizontal image scans and the first horizontal width.
[0013] 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; determining the number of pixel vertical partitions of different widths arranged on the pixel column based on the number of image vertical pixels and the number of backlight vertical partitions includes: determining the difference between the product of the second vertical width and the number of backlight vertical partitions and the number of image vertical pixels as the number of the first pixel vertical partitions arranged on the pixel column; determining the difference between the number of image vertical pixels 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 on the pixel column.
[0014] In some embodiments, the pixel horizontal partition includes a first pixel horizontal partition and a second pixel horizontal partition, and the first pixel horizontal partition and the second pixel horizontal partition have different widths; the horizontal arrangement sequence of the pixel horizontal partitions with different widths is determined, including: determining an arrangement ratio according to a ratio of the number of arrangement of the first pixel horizontal partition on the pixel row to the number of arrangement of the second pixel horizontal partition on the pixel row; rounding down the arrangement ratio and adding it to a unit clock cycle to obtain an arrangement period; if the arrangement period is not equal to a set period, rounding down half of the arrangement ratio and adding it to a unit clock cycle to obtain an arrangement half period; if the arrangement period is equal to the set period, determining the unit clock period as the arrangement half period; using the first arrangement ratio; The number of pixel horizontal partitions arranged on the pixel row is subtracted, and the product of the arrangement ratio rounded down and the number of the second pixel horizontal partitions arranged on the pixel row is obtained to obtain the arrangement remainder; for each pixel horizontal partition, according to the relationship between the serial number of the pixel horizontal partition and 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 if 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 the second pixel horizontal partitions arranged on the pixel row.
[0015] In some embodiments, the position where the current pixel horizontal partition number is located is determined to arrange the first pixel horizontal partition or the second pixel horizontal partition based on the relationship between the serial number of the pixel horizontal partition and the remainder of the arrangement period and the arrangement half period, including: if the serial number of the pixel horizontal partition and the remainder of the arrangement period are equal to the arrangement half period, then the position where the pixel horizontal partition is located is determined to arrange 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, then the position where the pixel horizontal partition is located is determined to arrange the first pixel horizontal partition.
[0016] 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. The method further includes: initializing a sequence of a set length and a sequence number of the pixel horizontal partition; 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 that the sequence is filled, shifting the filled sequence toward the lower bit by a unit length, and then filling the highest bit 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 that the sequence is filled, shifting the filled sequence toward the lower bit by a unit length, and then filling the highest bit of the sequence with 0; if the sequence number of the pixel horizontal partition and the remainder of the arrangement period is 0, and the sum of the arrangement remainders is greater than the arrangement number of the second pixel horizontal partition on the pixel row, shifting the filled sequence toward the lower bit by a unit length, and then filling the highest bit of the sequence with 0, and updating the number of backlight horizontal partitions; if the sequence number of the pixel horizontal partition is equal to the updated number of backlight horizontal partitions, shifting the filled valid bit to the lowest bit of the sequence to obtain the horizontal arrangement sequence.
[0017] 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 includes: obtaining the maximum pixel 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 the basic backlight data of the backlight partition corresponding to the pixel partition based on the maximum pixel 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.
[0018] In some embodiments, the division quantization parameter is determined by: obtaining the maximum number of pixels in the horizontal direction and the maximum number of pixels in the vertical direction of the pixel partition, wherein the maximum number of pixels in the horizontal direction is determined according to the width of the pixel partition in the horizontal direction and the number of parallel scanning channels; determining the quantization bit according to 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 according to the number of pixels in the pixel partition and the quantization bit.
[0019] In some embodiments, the pixel partition includes different types of pixel partitions, 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; if the type of the pixel partition is the first type, then according to the first horizontal width and the first vertical width, the first number of pixels in the first type of pixel partition is determined, and according to the first number of pixels and the quantization bit, the first division quantization parameter corresponding to the first type of pixel partition is determined; if the type of the pixel partition is the second type, then according to the first horizontal width and the second vertical width, Determine the second number of pixels in the second type of pixel partition, and determine the second division quantization parameter corresponding to the second type of pixel partition based on the second number of pixels and the quantization bit; if the type of the pixel partition is the third type, determine the third number of pixels in the third type of pixel partition based on the second horizontal width and the first vertical width, and determine the third division quantization parameter corresponding to the third type of pixel partition based on the third number of pixels and the quantization bit; if the type of the pixel partition is the fourth type, determine the fourth number of pixels in the fourth type of pixel partition based on the second horizontal width and the second vertical width, and determine the fourth division quantization parameter corresponding to the fourth type of pixel partition based on the fourth number of pixels and the quantization bit.
[0020] In some embodiments, each pixel in the pixel partition corresponds to a plurality of counters, and the counters include: 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 includes: updating the clock number counter in the pixel horizontal partition when a data enable signal is received, and resetting the clock number counter in the pixel horizontal partition when a value corresponding to the clock number counter in the pixel horizontal partition is equal to a width of the pixel horizontal partition; updating the pixel horizontal partition number counter when resetting the clock number counter in the pixel horizontal partition, and resetting the clock number counter in the pixel horizontal partition when resetting the clock number counter in the pixel horizontal partition When the value corresponding to the horizontal partition number counter is equal to the number of backlight horizontal partitions, the pixel horizontal partition number counter is reset; when the pixel horizontal partition number counter is reset, the pixel row number counter in the pixel vertical partition is updated, 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, the pixel row number counter in the pixel vertical partition is reset; 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.
[0021] In some embodiments, the width of the pixel horizontal partition is determined by: obtaining the lowest bit of the horizontal arrangement sequence; if the value corresponding to the lowest bit is 0, the width of the pixel horizontal partition is the first horizontal width; if the value corresponding to the lowest bit is 1, the width of the pixel horizontal partition is the second horizontal width; when resetting the clock number counter in the pixel horizontal partition, the horizontal arrangement sequence is shifted right by 1 bit.
[0022] In some embodiments, obtaining the maximum pixel value and the total pixel value in the pixel partition based on the pixel value of each pixel in the pixel partition includes: in the process of scanning the image to be displayed, determining the target pixel partition to which the currently scanned pixel belongs based on the pixel horizontal partition number counter and the pixel vertical partition number counter corresponding to the currently scanned pixel; obtaining the maximum candidate pixel value and the total candidate pixel value from the storage area corresponding to the target pixel partition; if the pixel value corresponding to the currently scanned pixel is greater than the maximum candidate pixel value, updating the maximum candidate pixel value to the pixel value corresponding to the currently scanned pixel; and updating the total candidate pixel value using the pixel value corresponding to the currently scanned pixel.
[0023] In some embodiments, the filtering processing is performed on the basic backlight data corresponding to all backlight partitions to obtain the target backlight data of each backlight partition, including: performing a filling operation on the basic backlight data corresponding to all backlight partitions; filtering the basic backlight data after the filling operation using a preset filter core to obtain the target backlight data of 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 on which filtering is performed is determined according to the number of vertical backlight partitions.
[0024] In some embodiments, the method further includes: caching the image to be displayed to a video frame buffer device; and when backlight data of all backlight partitions are acquired, controlling the backlight data of all backlight partitions to be output synchronously with the image to be displayed.
[0025] 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 multiple backlight partitions, and the device includes: an acquisition unit for acquiring the number of horizontal pixels and vertical pixels of an image to be displayed, the number of parallel scanning channels, and the number of backlight horizontal partitions and the number of backlight vertical partitions of the backlight module; a calculation unit for 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 horizontal partitions and the number of vertical partitions, and 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.
[0026] According to a third aspect of an embodiment of the present invention, a display module is provided, comprising: a display panel and a backlight module; the backlight module is controlled by any of the methods described above.
[0027] According to a third aspect of an embodiment of the present invention, a storage medium is provided, storing computer instructions, wherein the computer instructions are used to enable a computer to execute any one of the above methods.
[0028] According to the above embodiments, without changing the system software and driver, the backlight data of the backlight partition is updated in real time according to the number of horizontal pixels and 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.
[0029] 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
[0030] 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.
[0031] FIG1 is a flow chart of a method for controlling a backlight module according to an embodiment of the present invention.
[0032] FIG. 2 is an architecture diagram of a control method for a backlight module according to an embodiment of the present invention.
[0033] FIG3 is a schematic diagram showing a horizontal arrangement sequence in determining Example 1 according to an embodiment of the present invention.
[0034] FIG. 4A is a flow chart showing a method for determining a horizontal arrangement sequence according to an embodiment of the present invention.
[0035] FIG4B is a schematic diagram illustrating determining a horizontal arrangement sequence in Example 1 according to an embodiment of the present invention.
[0036] FIG5 is a schematic diagram showing an image and pixel partitioning arrangement and counting conditions of four counters according to an embodiment of the present invention.
[0037] FIG6 is a schematic diagram showing RAM reading and writing logic according to an embodiment of the present invention.
[0038] FIG. 7 is a schematic diagram showing backlight data storage according to an embodiment of the present invention.
[0039] FIG8 is a schematic diagram showing a filter kernel according to an embodiment of the present invention. DETAILED DESCRIPTION
[0040] Exemplary embodiments will be described in detail herein, with examples illustrated in the accompanying drawings. In the following description, when referring to the drawings, like numbers in different figures represent like or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments are not intended to represent all possible embodiments consistent with the present invention. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present invention, as detailed in the appended claims.
[0041] 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.
[0042] 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. Usually, development work needs to be invested in new backlight modules. However, this method cannot achieve rapid iteration and upgrading of products, nor can it effectively control project development costs.
[0043] In view of this, the present invention provides a backlight module control method that modifies the control method's calculation logic based on real-time input of basic parameter information to adapt to display modules with various backlight partition specifications, thereby improving development efficiency, shortening development cycles, and reducing development costs. The basic parameter information includes: the number of horizontal and vertical image pixels, the number of parallel scanning channels, and the number of horizontal and vertical backlight partitions of the backlight module.
[0044] The following embodiments will illustrate the present invention with reference to the accompanying drawings.
[0045] FIG1 is a flow chart of a method for controlling a backlight module according to an embodiment of the present invention. As shown in FIG1 , the method for controlling the backlight module includes steps 101 to 103 .
[0046] In step 101, the number of horizontal pixels and vertical pixels of an 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.
[0047] To control backlight modules of different specifications, the present invention obtains the aforementioned basic parameter information through a designated interface before determining backlight data. The specifications of the backlight module can be determined based on the number of horizontal and vertical backlight partitions in the basic parameter information, such as 120*85, 64*90, or 110*90. The number of horizontal and vertical image pixels can be determined by the video resolution.
[0048] In one embodiment, considering actual usage scenarios and actual hardware resource costs, 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 scan channels can be between 1-16; and the number of backlight horizontal partitions and the number of backlight vertical partitions can be between 1-120 respectively.
[0049] 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.
[0050] The pixel partitioning in the image to be displayed includes two dimensions: horizontal and vertical directions. In this embodiment, the pixel partitioning in the horizontal direction is referred to as pixel horizontal partitioning, and the pixel partitioning in the vertical direction is referred to as pixel vertical partitioning.
[0051] The pixel partitions in the image to be displayed correspond one-to-one to the backlight partitions. Therefore, the number of horizontal backlight partitions equals the number of horizontal pixel partitions, and the number of vertical backlight partitions equals the number of vertical pixel partitions. The width of the horizontal pixel partitions can be determined based on the relationship between the number of horizontal image pixels and the number of parallel scanning channels, and the number of horizontal backlight partitions. The width of the vertical pixel partitions can also be determined based on the multiple relationship between the number of vertical image pixels and the number of vertical backlight partitions.
[0052] By determining the number and width of the horizontal pixel partitions, as well as the number and width of the vertical pixel partitions, the specifications of the pixel partitions in the image to be displayed can be determined. A correspondence between each pixel partition in the image to be displayed and the backlight partitions in the backlight module is then established, i.e., the pixel partition in the image to be displayed corresponding to each backlight partition is determined.
[0053] 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.
[0054] 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.
[0055] 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 the 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 the target backlight data of each backlight partition.
[0056] Because backlight calculations can only be output after a complete frame of image transmission is complete, the backlight will lag behind the image by one frame, resulting in inaccurate pixel compensation and asynchrony between the image and backlight display. Therefore, frame caching is performed on the image to be displayed to ensure that the image to be displayed and the backlight data used for pixel compensation remain synchronized, thereby achieving a more accurate and synchronized backlight control effect. Specifically, the method further includes: caching the image to be displayed in a video frame buffer device; and upon obtaining backlight data for all backlight partitions, controlling the backlight data for all backlight partitions to be output synchronously with the image to be displayed.
[0057] FIG2 is an architecture diagram of a backlight module control method according to an embodiment of the present invention. As shown in FIG2 , the complete control process of the present invention can be divided into: a parameter calculation part, a partitioned backlight calculation part, and a video synchronization part.
[0058] In the parameter calculation part, the derived parameters required for the partition backlight calculation part are calculated based on 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.
[0059] 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 partition, and the basic backlight data of the pixel partition corresponding to the backlight partition is 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: the set filter kernel is used to perform smoothing filtering to obtain the target backlight data that can be output for display.
[0060] In the video synchronization part, the image to be displayed is buffered. In this embodiment, a double data rate synchronous dynamic random access memory (DDR) can be used as a video frame buffer device.
[0061] Those skilled in the art should understand that, in this embodiment, video data and the image to be displayed have the same meaning.
[0062] In the process of controlling the backlight module, the basic parameters that change include the video data size (resolution), the video data transmission rate (number of parallel scanning channels), and the number of pixels in each backlight partition. The control method is typically implemented using an FPGA (Field Programmable Gate Array). Due to the fixed-point calculation characteristics of FPGAs and the fixed calculation structure of the algorithm circuit, this affects the FPGA implementation architecture. Therefore, when using FPGAs for implementation, the following optimization designs can be performed on the algorithm:
[0063] 1. Analyze basic parameters and summarize parameters of subsequent calculation modules to obtain derived parameter data.
[0064] Before calculating the basic backlight data for each pixel partition, derived parameters used in the control process are pre-determined based on the basic parameters of the backlight and video specifications. This reduces the computational complexity within the partitioned backlight calculations and improves the efficiency and speed of video and backlight calculations. In other words, all parameter calculations within the parameter calculation section are pre-calculated at the start of the frame (i.e., during the blank period between frames). This avoids the non-real-time performance caused by the high latency of the divider. Derived parameters can be directly used for calculations during the pixel transmission phase to ensure real-time performance.
[0065] Users can input video data of varying resolutions within a set range, as well as backlight partition information with varying layout specifications. These basic parameters can also be modified during operation. The FPGA calculates the derived parameters at the start of a frame and uses them for control during the pixel transfer phase.
[0066] 2. Adopt a computing architecture that is adapted to the highest video data volume, and achieve backward compatibility of data calculation through parameter control.
[0067] For example, the RAM instance size is implemented as (120*120) according to the maximum partition case.
[0068] 3. When the basic parameters of the external input change, dynamically adjust the sequence flag and pixel counter.
[0069] Specifically, it includes using a horizontal arrangement sequence to identify the width of the horizontal pixel partition, using a vertical arrangement sequence to identify the width of the 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. 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 range of different counters, thereby affecting the pixel partition to which the currently scanned pixel belongs.
[0070] The following embodiments will specifically describe the calculation logic of each part mentioned above.
[0071] 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.
[0072] In step 1021, the width of the horizontal pixel partition is determined based on 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 based on the multiple relationship between the number of vertical pixels of the image and the number of vertical backlight partitions.
[0073] Since video data is transmitted in parallel using multiple (e.g., N) channels per clock cycle, to reduce computational complexity, backlight partitions are divided horizontally using clock counts, with each backlight partition being KH clock cycles wide. Vertically, partitions are divided vertically using pixels, with each backlight partition being KV pixel rows wide. N is the number of parallel scanning channels, and ranges from 1 to 16. The horizontal and vertical widths of pixel partitions can be determined based on image resolution and whether the backlight partitions are divisible by even numbers.
[0074] 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 partitions can be divided into the following two cases:
[0075] In the first case, if the number of horizontal image pixels and the number of parallel scanning channels are non-integer multiples of the number of backlight horizontal subareas, a rounding function is used to determine the first horizontal width and the second horizontal width of the pixel horizontal subarea based on the number of horizontal image pixels, the number of parallel scanning channels, and the number of backlight horizontal subareas, where the first horizontal width and the second horizontal width are integer clock cycles.
[0076] In a 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 pixel horizontal partition is determined based on 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.
[0077] That is, when the number of image horizontal pixels and the number of backlight horizontal subareas are not evenly divisible, to prevent the width of each pixel horizontal subarea from being a non-integer value, the width of the pixel horizontal subarea 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 image horizontal pixels and the number of backlight horizontal subareas are evenly divisible, the width of each pixel horizontal subarea is an integer number of clock cycles.
[0078] 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:
[0079] In the first case, if the number of vertical pixels of the image and the number of backlight vertical partitions are non-integer multiples, the first vertical width and the second vertical width of the pixel vertical partition are determined according to the number of vertical pixels of the image and the number of backlight vertical partitions and using a rounding function;
[0080] 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.
[0081] That is, when the number of vertical pixels in the image and the number of vertical backlight partitions are not evenly divisible, 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 in the image and the number of vertical backlight partitions are evenly divisible, the width of each vertical pixel partition is an integer number of pixel rows.
[0082] In this embodiment, the 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 backlight horizontal 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 pixel horizontal partition by using a rounding-down function according to the number of horizontal scans of the image and the number of backlight horizontal partitions; determining the second horizontal width of the pixel horizontal partition by using a rounding-up function according to the number of horizontal scans of the image and the number of backlight horizontal partitions.
[0083] 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 and using a rounding function may include:
[0084] According to the number of vertical pixels of the image and the number of backlight vertical partitions, a floor function is used to determine the first vertical width of the pixel vertical partition; 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.
[0085] Example 1. This embodiment takes 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*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 as an example to illustrate the above-mentioned determination of the width of the pixel partition.
[0086] Since the number of horizontal image pixels (4096) and the number of backlight horizontal partitions (120) are not divisible evenly, in this example, there are two types of pixel horizontal partitions. Considering that the horizontal direction is divided in clock cycles, the number of horizontal image scans can be calculated according to Formula 1. Then, the first horizontal width of the pixel horizontal partition can be determined using the floor function according to Formula 2. Then, the second horizontal width of the pixel horizontal partition can be determined using the ceiling function according to Formula 3. VDCLKH=VDHAC / VDCHNL Formula 1 KH1=Floor(VDCLKH / BLHAC) Formula 2 KH2=Ceil(VDCLKH / BLHAC) Formula 3
[0087] Where VDCLKH is the number of horizontal image scans, VDHAC is the number of horizontal image pixels, VDCHNL is the number of parallel scan 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.
[0088] 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.
[0089] Since the number of vertical image pixels (2160) and the number of backlight vertical partitions (85) are not divisible evenly, in this example, there are also two vertical pixel partitions with different widths. In this case, the first vertical width of the vertical pixel partition can be determined using the floor function according to Formula 4, and then the second vertical width of the vertical pixel partition can be determined using the ceiling function according to Formula 5. KV1 = Floor((VDVAC) / BLVAC) Formula 4 KV2 = Ceil((VDVAC) / BLVAC) Formula 5
[0090] 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 vertical pixels of the image, and BLVAC is the number of backlight vertical partitions.
[0091] 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.
[0092] 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 vertical pixel partition has only one width, that is, each vertical pixel partition includes 24 pixel rows.
[0093] In Example 1, the number of horizontal image pixels and the number of horizontal backlight subareas, as well as the number of vertical image pixels and the number of vertical backlight subareas, are not evenly divisible. In Example 2, the number of horizontal image pixels and the number of horizontal backlight subareas are not evenly divisible, but the number of vertical image pixels and the number of vertical backlight subareas are evenly divisible. In actual applications, there are four possible combinations of these situations, and the calculation principles are the same, so I will not elaborate on them here.
[0094] As can be seen from step 1021, the number of horizontal pixels in the image and the number of horizontal backlight partitions can be divisible or not. In the divisible case, there is only one horizontal pixel partition with one width, and the number of horizontal pixel partitions with this width is equal to the number of horizontal backlight partitions. In the not divisible case, there are two horizontal pixel partitions with two widths, and the number of horizontal pixel partitions with each width can be determined according to step 1022. Similarly, the number of vertical pixel partitions with each width can also be determined.
[0095] In step 1022, the number of pixel horizontal partitions of different widths arranged on the 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 the pixel columns is determined based on the number of vertical pixels of the image and the number of backlight vertical partitions.
[0096] 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.
[0097] To obtain the number of first and second pixel horizontal partitions arranged, an equation can be constructed based on known conditions, as shown in Formula 6, and then the number of first and second pixel horizontal partitions arranged can be solved. Specifically, the equation is constructed based on the following: the sum of the number of first and second pixel horizontal partitions arranged is equal to the number of backlight horizontal partitions; the sum of the number of first and second pixel horizontal partitions arranged is equal to the width of the first and second pixel horizontal partitions, and the sum of the number of first and second pixel horizontal partitions arranged is equal to the number of horizontal scans of the image; and the difference between the width of the first and second pixel horizontal partitions is equal to 1. Solving the equation can obtain the number of first and second pixel horizontal partitions arranged.
[0098] 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.
[0099] 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 first pixel horizontal partitions arranged on a pixel row by the difference between the product of the second horizontal width and the number of backlight horizontal partitions and the number of horizontal image scans; and determining the number of second pixel horizontal partitions arranged on a pixel row by the difference between the number of backlight horizontal partitions and the product of the number of horizontal image scans and the first horizontal width, wherein the number of horizontal image scans is determined based on the number of horizontal pixels of the image and the number of parallel scanning channels.
[0100] 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.
[0101] Continuing with Example 1, using Formula 7, it can be obtained that the number xH of the first horizontal pixel partitions is 88, and the number yH of the second horizontal pixel partitions is 32.
[0102] Similarly, determining the number of pixel vertical partitions of different widths arranged on 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 first pixel vertical partitions arranged on 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 second pixel vertical partitions arranged on the pixel column.
[0103] In this embodiment, the number of the first vertical pixel partitions and the second vertical pixel partitions can be determined by Formula 8.
[0104] In Formula 8, xV is the number of the first vertical pixel partitions, and yV is the number of the second vertical pixel partitions.
[0105] After obtaining the number of pixel horizontal partitions of different widths in the horizontal direction according to step 1022, in order to make the first pixel horizontal partition and the second pixel horizontal partition evenly partitioned in the horizontal direction, it is necessary to determine the horizontal arrangement sequence SEQH of pixel horizontal partitions of different widths; similarly, after obtaining the number of pixel vertical partitions of different widths in the vertical direction, in order to make the first pixel vertical partition and the second pixel vertical partition evenly partitioned in the vertical direction, it is necessary to determine the horizontal arrangement sequence SEQV of pixel vertical partitions of different widths.
[0106] 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.
[0107] In this embodiment, determining the horizontal arrangement sequence of horizontal pixel partitions of different widths may include:
[0108] determining 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;
[0109] Rounding down the permutation ratio and adding it to the unit clock period to obtain a permutation period;
[0110] 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;
[0111] 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 result by the arrangement number of the second pixel horizontal partitions on the pixel row.
[0112] For each pixel horizontal partition, according to the relationship between the serial number of the pixel horizontal partition and 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.
[0113] In this embodiment, the permutation ratio can be determined using Formula 9, followed by the permutation period using Formula 10, followed by the permutation half period using Formula 11, and finally the permutation remainder using Formula 12. Th=floor(zh)+1 Formula 10 rmdh=xH-floor(zh)*yH Formula 12
[0114] In the above formula, zh is the arrangement ratio, Th is the arrangement period, Th half is the permutation half period, and rmdh is the permutation remainder.
[0115] In this embodiment, determining the position of the current pixel horizontal partition sequence number and arranging the first pixel horizontal partition or the second pixel horizontal partition according to the relationship between the sequence number of the pixel horizontal partition and the remainder of the arrangement period and the arrangement half period may include:
[0116] If the remainder of the sequence number of the pixel horizontal partition and the arrangement period is equal to the arrangement half period, determining the position where the pixel horizontal partition is located and arranging the second pixel horizontal partition;
[0117] If the remainder of the sequence number of the pixel horizontal partition and the arrangement period is not equal to the arrangement half period, the position where the pixel horizontal partition is located is determined and the first pixel horizontal partition is arranged.
[0118] In the case of non-divisible integers, the size of the horizontal pixel partitions can be divided into two cases. When the number of arranged first pixel partitions is greater than the number of arranged second pixel partitions, that is, when xH>yH, the horizontal arrangement sequence SEQH can be defined as '0' to identify the first pixel partition with a first horizontal width KH1, and '1' to identify the second pixel partition with a second horizontal width KH2. At the same time, based on the total number of pixel partitions, the horizontal arrangement sequence SEQH can be determined to be a maximum of 120, so the horizontal sorting sequence can be initialized to 120 bits of '0'.
[0119] The following takes 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.
[0120] Determine the remainder of count i with respect to Th, and select '0' or '1' to fill the sequence according to the remainder value.
[0121] 1. When mod(i, Th) = Th half In the case of , the jth bit of the horizontal arrangement sequence SEQH is filled with '1';
[0122] 2. When mod(i, Th) = other values, the j-th bit of the horizontal arrangement sequence SEQH is filled with '0';
[0123] 3. When mod(i, Th) = other values and mod(i, Th) = 0, according to rmdh cnt =rmdh cnt +rmdh accumulates the permutation remainders to obtain the permutation remainder accumulation sum rmdh cnt , among which 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:
[0124] 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 rmdh cnt 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.
[0125] If rmdh cnt <yH, no additional padding bits are required, that is, no processing is performed.
[0126] 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 interchanged.
[0127] 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 halfis 2, and the permutation remainder rmdh determined according to formula 12 is 24.
[0128] FIG3 is a schematic diagram illustrating determining a horizontal arrangement sequence in Example 1 according to an embodiment of the present invention. As shown in FIG3 , the horizontal arrangement sequence is determined based on the obtained parameters.
[0129] In the case of i=1, j=0, mod(1,3)=1, since 1 is not equal to the arrangement half period Th half Therefore, in the case of other values, the j-th position of the horizontal arrangement sequence SEQH (ie, the 0th position in FIG. 3 ) is filled with '0'.
[0130] 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, the j-th bit (ie, the 1st bit in FIG. 3 ) of the horizontal arrangement sequence SEQH is filled with '1'.
[0131] 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 j-th bit (ie, the second bit in FIG. 3 ) of the horizontal arrangement sequence SEQH is filled with '0'.
[0132] Since mod(3,3)=0 when i=3 and j=2, in this case, the permutation remainder is accumulated to determine whether additional padding bits are needed. When i=3, the permutation remainder rmdh is 0.75*32=24, rmdh 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 performed.
[0133] 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 j-th bit (ie, the 3rd bit in FIG. 3 ) of the horizontal arrangement sequence SEQH is filled with '0'.
[0134] 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 j-th bit of the horizontal arrangement sequence SEQH, ie, the 4th bit, is filled with '1'.
[0135] In the case of i=6, j=5, mod(6,3)=0, since 0 is not equal to the arrangement half period Th half In this case, the j-th bit, ie, the 5th bit of the horizontal arrangement sequence SEQH is filled with '0'.
[0136] Since mod(6,3)=0 when i=6, in this case, the permutation remainder is 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.
[0137] In the case of i=7, j=7, and so on, a horizontal arrangement sequence SEQH is obtained.
[0138] Determining the horizontal sequence SEQH using the above-described method using an FPGA, and subsequently reading the value of each bit in the horizontal sequence SEQH, involves addressing operations, which consume a large amount of computing resources. To reduce computing resources, the present invention fills the horizontal sequence SEQH with data starting from one end of the sequence, either starting from the highest or lowest bit. For example, when filling from the highest bit, the filled sequence is first shifted to the lower bit unit length (i.e., shifted right by 1 bit) during each filling operation except the first filling, so that the latest bit data is filled in the highest bit. Because the actual number of pixel horizontal partitions does not necessarily equal the maximum number of backlight horizontal partitions (e.g., 120), after the filling operation is completed, the filled sequence is bit-shifted to the bottom based on the difference between the number of pixel horizontal partitions and the maximum number of backlight horizontal partitions.
[0139] Therefore, the method of the present invention further comprises:
[0140] Initialize a sequence of set length and the sequence number of the pixel horizontal partition;
[0141] If the remainder of the sequence number of the pixel horizontal partition and the arrangement period is equal to the arrangement half period, and it is not the first time to fill the sequence, then shift the filled sequence to the lower bit by unit length, and fill the highest bit of the sequence with 1;
[0142] 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 bit by a unit length, and the highest bit of the sequence is filled with 0;
[0143] 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, shifting the filled sequence toward the lower bits by a unit length, filling the highest bit of the sequence with 0, and updating the number of backlight horizontal partitions;
[0144] 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.
[0145] FIG4A is a flow chart showing a determination of a horizontal arrangement sequence according to an embodiment of the present invention. As shown in FIG4A , in this embodiment, let i be counted from 1 to BLHAC to calculate the arrangement of each horizontal partition of pixels:
[0146] Determine the remainder of count i 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 is filled with the highest position.
[0147] 1. When mod(i, Th) = Th half In the case of , the highest bit of the horizontal arrangement sequence SEQH is filled with '1';
[0148] 2. When mod(i, Th) = other values, the highest bit of the horizontal arrangement sequence SEQH is filled with '0';
[0149] 3. When mod(i, Th) = other values and mod(i, Th) = 0, the permutation remainders are accumulated and calculated rmdh cnt =rmdh cnt +rmdh, and add the remainder according to the permutation and rmdh cnt The value of determines whether additional padding bits are needed:
[0150] 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.
[0151] If rmdh cnt<yH, no processing is done.
[0152] After i counting is completed, the bit shift is performed 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.
[0153] FIG4B is a schematic diagram illustrating determination of a horizontal arrangement sequence in Example 1 according to an embodiment of the present invention. The horizontal arrangement sequence determined in Example 1 using the method shown in FIG3 is shown in FIG4B .
[0154] In the case of i=1, mod(1,3)=1, since 1 is not equal to the arrangement half period Th half Therefore, if it belongs to other values, the highest bit of the sequence is filled with '0', that is, as shown in FIG4B , the 119th bit is filled with '0'.
[0155] 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 the filled sequence is shifted right by 1 bit, and the highest bit of the sequence is filled with '1', that is, '1' is filled at the 119th bit as shown in FIG4B .
[0156] 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 the filled sequence is shifted right by 1 bit, and the highest bit of the sequence is filled with '0', that is, '0' is filled at the 119th bit as shown in FIG4B .
[0157] 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.
[0158] The same logic is repeated until i equals the updated number of backlight horizontal partitions, at which point the padded valid bits are shifted to the lowest bit of the sequence to obtain the horizontal arrangement sequence SEQ H. For example, when the number of backlight horizontal partitions is 70, the padded valid bits need to be shifted right by 50 bits to the lowest bit of the sequence.
[0159] The above embodiment introduces the case where the number cannot be divided evenly. In the case where the number can be divided evenly, 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'.
[0160] Similarly, the vertical arrangement direction of the sequence SEQV can be calculated. Since the calculation principle is the same, it will not be repeated here.
[0161] 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.
[0162] 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 division requires dozens of clock cycles of delay, it is impossible to obtain the result in real time. Therefore, the present invention uses an iterative method to convert division into multiplication for calculation, that is, based on 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. Bavg=(Bsum*DIVPARAM)>>DIVBIT Formula 13
[0163] 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.
[0164] In this embodiment, the division quantization parameter can be determined by the following method: 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.
[0165] In this embodiment, according to quantization error statistics, 16 bits of integer bits after quantization can meet the accuracy requirements. Therefore, in this embodiment, the quantization bits can be determined by formula 16. DIVBIT = bitnum (Kh * VDCHNL * Kv) + 16 Formula 16
[0166] 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, 5*8=40, and Kv takes the maximum number of pixels in the vertical direction of the pixel partition, 26.
[0167] 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).
[0168] In one embodiment, since pixel partitions can have two widths in both the horizontal and vertical directions, such as in Example 1, in this case, different types of pixel partitions can be obtained by combining the pixel partition widths in the horizontal direction and the pixel partition widths in the vertical direction. 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.
[0169] 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 based on the number of pixels in the pixel partition and the quantization bits may include:
[0170] 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 bits;
[0171] If the type of the pixel partition is the second type, determining a second number of pixels in the second type of pixel partition according to the first horizontal width and the second vertical width, and determining a second division quantization parameter corresponding to the second type of pixel partition according to the second number of pixels and the quantization bit;
[0172] 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 bits;
[0173] 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 based on 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 based on the fourth number of pixels and the quantization bit.
[0174] In this example, the division quantization parameters corresponding to different types of pixel partitions can be determined using Formula 17.
[0175] 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.
[0176] In actual applications, after obtaining the derived parameters used in the control process based on the basic parameters of the backlight and video specifications, the derived parameters are used to dynamically adjust the size of each pixel partition and the total number of pixel partitions, and the basic backlight data and target backlight data of the pixel partitions are calculated in real time. The following embodiment will specifically describe the process of calculating the basic backlight data and target backlight data.
[0177] In this embodiment, the maximum value of a pixel in a pixel partition can be determined by Formula 18. BLmax = max(Pmax(i,j)) i∈m, j∈n Formula 18 Pmax(i,j) = max(R(i,j),G(i,j),B(i,j)) Formula 19
[0178] In the above formula, BLmax is the maximum pixel value in the pixel partition, Pmax(i,j) is the maximum pixel value in the i-th row and j-th column, R(i,j) is the red pixel value in the i-th row and j-th column, G(i,j) is the green pixel value in the i-th row and j-th column, B(i,j) is the blue pixel value in 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.
[0179] 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.
[0180] In this embodiment, the basic backlight data of the backlight partition corresponding to the pixel partition can be determined by formula 21. BL = α*BLavg + (1-α)*BLmax Formula 21
[0181] In Formula 21, BL is the basic backlight data and α is the weight.
[0182] 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.
[0183] In this embodiment, the subarea backlight calculation module is responsible for extracting the backlight brightness of each pixel subarea from the image to be displayed to control the lighting of the MLED subarea backlight. The subarea backlight calculation module is divided into two parts: a basic backlight calculation module and a backlight smoothing filter module.
[0184] In order to adapt to the real-time changes in 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.
[0185] In terms of counting, since the size of each pixel partition is not unique in actual calculations, there are two widths in the horizontal direction, KH1 and KH2, and two widths in the vertical direction, KV1 and KV2, respectively. Furthermore, these parameters are updated in each frame. Therefore, four counters are required to identify the partition to which the current pixel belongs, and then the partition size of the current pixel partition is obtained from the SEQH and SEQV sequences. The four counters are: a clock count counter within a horizontal pixel partition, a pixel row count counter within a vertical pixel partition, a horizontal pixel partition count counter, and a vertical pixel partition count counter. In this case, the method further includes:
[0186] When a data enable signal is received, the clock number counter in the pixel horizontal partition is updated, and when a value corresponding to the clock number counter in the pixel horizontal partition is equal to a width of the pixel horizontal partition, the clock number counter in the pixel horizontal partition is reset;
[0187] 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 the backlight horizontal partitions, resetting the pixel horizontal partition number counter;
[0188] 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;
[0189] 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.
[0190] The data enable signal, also known as the DE (dataenable) signal, is a valid data selection signal. It is represented by various symbols in LCD circuits, such as dsp, dsptmg, den, and de. The DE signal is an active-high signal. During the high period of the DE signal, the corresponding video data signal is considered a valid data signal.
[0191] In this embodiment, different counters correspond to different symbols:
[0192] Clock count counter in pixel horizontal partition: CLK hcnt ;
[0193] Pixel row counter in the vertical pixel partition: CLK vcnt ;
[0194] Pixel horizontal partition number counter: BLK hcnt ;
[0195] Pixel vertical partition number counter: BLK vcnt .
[0196] In other words, the counting rules are as follows:
[0197] ①CLK hcnt : DE is triggered by a valid high level to count up; count the clock cycles scanned in each row to the maximum width CLK of the current pixel horizontal partition hcnt _ max In case of counter CLK hcnt Reset to 1;
[0198] ②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;
[0199] ③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 of counter CLK vcnt Reset to 1;
[0200] ④BLK vcnt : By CLK vcntWhen the count is reset, the count is incremented by one. 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;
[0201] ⑤ 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.
[0202] When reading the SEQH sequence, you can read from a specified end, for example, you can start reading from the lowest bit. When performing each read except the first read, the remaining bits are first shifted to the higher bits, thereby avoiding the execution of addressing operations and reducing the use of computing resources. Specifically including:
[0203] If the current SEQH lowest bit is '0', the current CLK hcnt Count maximum value CLK hcnt_max =KH1;
[0204] If the current SEQH lowest bit is '1', the current CLK hcnt Count maximum value CLK hcnt_max =KH2;
[0205] 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, that is, when the next pixel horizontal partition is switched: the SEQH sequence is shifted right by 1 bit.
[0206] During 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.
[0207] Similarly, the vertical direction judgment logic is the same as that of the horizontal direction.
[0208] Figure 5 is a schematic diagram illustrating 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, data statistics and calculations are performed on each pixel within each pixel partition in a 'Z-shaped' manner. As shown in Figure 5, image 500 can be divided into multiple pixel partitions. A partial magnification of pixel partition 501 shows that a pixel partition includes multiple clock cycles in the horizontal direction and multiple pixel rows in the vertical direction. A clock cycle 502 includes multiple pixel columns. Assuming that the number of parallel scanning channels is equal to 8, one clock cycle includes 8 pixel columns.
[0209] 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. Only after all rows and columns of a pixel partition are completely scanned and calculated can the target backlight data of the pixel partition be calculated.
[0210] The RAM memory in this invention instantiates four storage spaces, divided into two groups for storing intermediate calculation results: the maximum candidate pixel value and the sum of candidate pixels. Within each group, two RAMs are instantiated using a ping-pong strategy. The purpose of this ping-pong strategy is to separate the writing of backlight data to RAM from the clearing of RAM. As shown in Figure 6, when the backlight partition data calculation for the current frame triggers the read / write operation to RAM1, RAM2 is simultaneously written with a '0'. This clears all addresses in RAM2 containing the backlight data written in the previous frame, eliminating any residual data from the previous frame and preventing interference with the reading and writing of RAM during the calculation of the backlight partition data for the next frame.
[0211] 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 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.
[0212] 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, the maximum value of candidate pixels and the sum of candidate pixels stored in RAM of the current pixel partition are first read out respectively (i.e., the values determined based on the pixel rows scanned by the current pixel partition), and after performing maximum value judgment and cumulative calculation respectively with the current pixel value, the maximum value of candidate pixels and the sum of candidate pixels are updated and stored in the address space of the current pixel partition in RAM, and then the execution continues in the next pixel partition of the current row.
[0213] 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.
[0214] After completing the basic backlight calculation, the basic backlight data can be smoothed and filtered to make the backlight transition more uniform.
[0215] Before filtering the basic backlight data, padding can be performed on the data, adding a row or column of '0's above, below, left, and right of the basic backlight data image. This padding operation can be achieved by controlling the write address of the RAM receiving the basic backlight data: Instantiate a filter RAM with an address space of (BLHAC+2) columns and (BLVAC+2) rows. When writing the received basic backlight data to the filter RAM, write from the second row and second column of the filter RAM as the starting point, thus achieving the padding effect. The storage of basic backlight data in the filter RAM is shown in Figure 7.
[0216] 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 a total of BLVAC rows are executed.
[0217] In the present invention, the backlight filtering can adopt 3*3 weighted maximum filtering. As shown in Figure 8, the 3*3 filter kernel coefficient is used, 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.
[0218] 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.
[0219] The real-time configurable control method proposed in the present invention supports real-time online adjustment of backlight partition parameters and video specification parameters, providing users with a universal backlight partition dimming method with better compatibility and portability, reducing project development cycle and cost, and providing a technical basis for the iterative development of MLED display products.
[0220] After the user updates the basic parameter information, the present invention can calculate the derived parameters based on the updated basic parameter information, and adjust the parameters when calculating the backlight data corresponding to the backlight partition based on the derived parameters, so that the present invention can switch to the new parameter mode and work normally.
[0221] The present invention further provides a control device for a backlight module, wherein the backlight module includes a plurality of backlight partitions, and the device includes:
[0222] An acquisition unit, configured to acquire the number of horizontal pixels and vertical pixels of an image to be displayed, the number of parallel scanning channels, and the number of horizontal backlight partitions and vertical backlight partitions of the backlight module;
[0223] A calculation unit is used to determine the pixel partition corresponding to each backlight partition in the image to be displayed based on 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 based on the pixel value of each pixel in the pixel partition.
[0224] 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.
[0225] This embodiment may also include a display module, comprising a display panel and a backlight module; the backlight module is controlled using the method described in any of the above embodiments. The display device including the display module in this embodiment may be any product or component with a display function, such as electronic paper, a mobile phone, a tablet computer, a television, a laptop computer, a digital photo frame, or a navigation system.
[0226] It should be noted that in the accompanying drawings, the sizes of layers and regions may be exaggerated for clarity of illustration. It will also be 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 will be 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 will also be understood that when a layer or element is referred to as being "between" two layers or elements, it may be the only layer between the two layers or elements, or there may also be more than one intermediate layer or element. Similar reference numerals throughout the text indicate similar elements.
[0227] In the present invention, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance. The term "plurality" refers to two or more, unless otherwise clearly defined.
[0228] Other embodiments of the present invention will readily occur to those skilled in the art after considering the specification and practicing the disclosure herein. The present invention is intended to cover any variations, uses, or adaptations of the present invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein. The description and examples are to be considered as exemplary only, with the true scope and spirit of the invention being indicated by the following 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 and parallel scanning channels of the image is not proportional to the number of horizontal backlight partitions integer multiple, then according to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of backlight horizontal partitions, a rounding function is used to determine a first horizontal width and a second horizontal width of the pixel horizontal partition, 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; According to the number of horizontal pixels of the image, the number of parallel scanning channels and the number of horizontal backlight partitions, Determine the number of pixel horizontal partitions of different widths arranged on the pixel row, including: 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: 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; 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 sequence number of the pixel horizontal partition and the remainder of the arrangement period and the arrangement half period, determine the position where the sequence number of the current pixel horizontal partition is located to arrange the first pixel horizontal partition or the second pixel horizontal partition, and if the set conditions are met, arrange the first pixel horizontal partition at the position where the sequence number of the next pixel horizontal partition is located, wherein the set conditions include the sequence number of the pixel horizontal partition. The remainder of the arrangement period is 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; In the case of resetting the clock number counter in the pixel horizontal partition, updating the number of the pixel horizontal partition counter, and reset the pixel horizontal partition number counter when the value corresponding to the pixel horizontal partition number counter is equal to the number of backlight horizontal partitions; 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 backlight partitions are acquired, the backlight data of all backlight partitions are controlled to be consistent with the The image to be displayed is output synchronously.
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.
Citation Information
Patent Citations
LCD brightness control method and device as well as LCD equipment
CN105118474A
Backlight brightness control method and device and liquid crystal display equipment
CN106228936A
Backlight control method and device and terminal equipment
CN112927654A
Backlight area adjusting method and device, electronic equipment and storage medium
CN116013209A
Method and apparatus of compensating image in a backlight local dimming system
US20130016141A1
