TWI727583B - Image data processing method and display device and information processing device using the same - Google Patents

Abstract

The present invention mainly discloses an image data processing method, which is based on a basic template to generate a plurality of dithering templates for a display to display a plurality of different pictures in a continuous time, and is characterized in that the method is performed on the basic template An arrangement operation to generate the dithering template. Moreover, when the decimal part of the pixel grayscale value contains 4 bits, the memory space used to store the basic template and the K-1 templates only needs 1050 bits, which achieves a substantial saving of storage space. .

Description

Image data processing method and display device and information processing device using the same

The present invention relates to the technical field of display data processing, in particular to an image data processing method and a display device using the same.

As we all know, each pixel of a display screen generally includes a red sub-pixel, a green sub-pixel, and a blue sub-pixel. When the three sub-pixels all display the maximum brightness, the pixel displays white; conversely, when the three sub-pixels all display the minimum brightness, the pixel is black. The number of colors of pixels is called color depth. For example, 8bit color depth can display 256 colors or 256 gray scales. Therefore, when the three sub-pixels of RGB have 8bit color depth, each pixel of the display screen can display 16.77 million colors. However, when the display screen displays a gradient image, such as displaying a black, gray, and white gradient image, what the human eye sees will not be a smooth and continuous gradient image, but a discontinuous gradient image. Like, this is a color gradient/banding phenomenon.

Therefore, in addition to the display driver chip, the existing display will also be equipped with an application processor (image signal processor), wherein the application processor has a one-bit wide extension module for one-bit wide extension of image data The processing, for example, extends from 8 bits to 10 bits, so that the grayscale value of each pixel of the image data includes an integer part and a decimal part at the same time. However, the display screen of the display cannot directly display the color scale of the fractional part. Therefore, the application processor is also equipped with a dithering module to perform a pixel dithering operation to convert the fractional part into an integer.

For example, FIG. 1A shows a diagram of a pixel array in an image data that has completed bit width expansion processing, and FIG. 1B shows a diagram of a pattern for performing pixel dithering operations in the prior art . As shown in FIG. 1A, after the aforementioned bit width expansion processing, if the grayscale values of the pixels at each position of an 8×8 pixel array in one frame of image data are all 5.375, the aforementioned dithering module The pattern shown in FIG. 1B can be used to perform the pixel dithering operation on the 8×8 pixel array that has completed the bit width expansion processing. When performing the pixel dithering operation, if the value of an array position (i, j) on the template (Pattern) is 1, then the value of the same array position of the 8×8 pixel array is adjusted to an integer by way of carry . Conversely, if the value of an array position (i, j) on the template (Pattern) is 0, the value of the same array position of the 8×8 pixel array is adjusted to an integer by rounding off the decimal point. FIG. 1C shows a diagram of the pixel array in the image data after the pixel dithering operation is completed.

However, practical experience has shown that the conventional pixel dithering calculation uses a fixed pattern to perform pixel dithering processing on multiple frames of image data in a continuous period of time, which ultimately causes the human eye to observe the multiple frames of image data. When you find a fixed texture (or pattern). In order to solve the foregoing problems, the prior art uses multiple sets of different templates to perform pixel dithering processing on multiple frames of image data in a continuous period of time. 2A to 2H are diagrams showing 8 groups of different templates used in the prior art. For example, the templates shown in FIGS. 2A to 2H are respectively template 0 to template 7, which are used to perform pixel dithering processing on 8 frames of image data in a continuous period of time. In other words, each pixel dithering processing loop uses 8 groups of different templates to process the continuous 8 frames of image data separately, so as to prevent the human eyes from being fixed when viewing the continuous 8 frames of image data. The texture (or pattern).

For image data that has completed bit width expansion processing, if each frame of image data contains an 8×8 size pixel array, the decimal part of the grayscale value of the pixel at each position contains 4 bits; here In this case, if you want to perform pixel dithering calculation on 16 frames of image data in a continuous time with 16 sets of different templates, the memory space used to store 16 sets of templates is 8×8×(2 ⁴ -1)×16= 15360 bits.

Therefore, it can be seen from the above description that there is an urgent need in the art for a new image data processing method that can effectively save template storage space.

The main purpose of the present invention is to provide an image data processing method, which is used in an application processor (image signal processor) so that the application processor can generate K-1 templates based on a basic template. And the memory space used to store the basic template and the K-1 templates only needs 1050 bits, which achieves the specific effect of greatly saving storage space.

In order to achieve the above objective, the present invention proposes an embodiment of the image data processing method, which is used to generate K-1 templates according to a basic template, so that the basic template and the K-1 templates are used to compare a continuous time The K frames of image data within are respectively subjected to a dithering operation processing, wherein the basic template is a two-dimensional array and has an array size of M×N, and K, M, and N are all positive integers; it is characterized in that the The image data processing method is used to perform K-1 arranging operations on the basic template, and the arranging operations include:

(1) Determine a starting position to correspond to the position of the yth column and the xth row of the basic template, where x and y are both positive integers;

(2) Fill in the array value of the yth column and xth row of the basic template into the position of the 0th column and 0th row of a blank template, and add the yth column and row x+1 to the yth column of the basic template The array values of row N-1 are sequentially filled in the positions of column 0, row 1 to column 0, row Nx-1 of the blank template, and then column y, row 0 to row y of the basic template The array values of the x-1th row of the column are sequentially filled in the positions of the 0th column and Nxth row to the 0th column and N-1th row of the blank template;

(3) Fill in the array value of column y+i and row x of the basic template into the position of column i and row 0 of the blank template, and fill in the position of column y+i and row x+1 of the basic template The array values from column y+i to row N-1 are sequentially filled in the positions of column i, row 1 to column i, row Nx-1 of the blank template, and then y+th row of the basic template The array values in column i, row 0 to column y+i, row x-1 are sequentially filled in the positions of column i, row N-x+1 to column i, row N-1 of the blank template;

(4) Repeat this step (3) until y+i=M-1; where the initial value of i is 1, and 1 is added successively;

(5) Fill in the array value of column f and row x of the basic template into the position of column j and row 0 of the blank template, and add column f and row x+1 to column f of the basic template The array values of row N-1 are sequentially filled in the positions of column j, row 1 to column j, row Nx-1 of the blank template, and then column f, row 0 to row f of the basic template The array values of the x-1th row of the column are sequentially filled in the positions of the jth column and the Nxth row to the jth column and the N-1th row of the blank template; and

(6) Repeat this step (5) until j=M-1; where the initial value of j is equal to y and 1 is successively increased, and the initial value of f is 0 and 1 is successively increased.

In an embodiment, the grayscale value of each pixel in each of the image data includes an integer part and a fractional part, and the fractional part is L bits.

In one embodiment, the value of K is 2 ^L , and the value of M×N is an integral multiple ^{of 2 L.}

In order to achieve the above object, the present invention further provides another embodiment of the image data processing method, which is used to generate a plurality of dithering templates according to a basic template for a display to display a plurality of different images in a continuous time. It is characterized in that the image data processing method performs an arranging operation on the basic template to generate the dithering template, and the arranging operation includes:

Perform a row permutation operation and a column permutation operation on the basic template to generate the dithering template, wherein the basic template and the dithering template are divided into upper left area and upper right area in the plane defined by plural rows and plural columns. Area, lower left area and lower right area, the data of the upper left area of the dithering template is the same as the data of the lower right area of the basic template, and the data of the upper right area of the dithering template is the same as the data of the upper right area of the dithering template. The data in the lower left area of the basic template, the data in the lower left area of the dithering template are the same as the data in the upper right area of the basic template, and the data in the lower right area of the dithering template are the same Data in the upper left area of the basic template.

The present invention also provides a display device, which has an application processor for executing the image data processing method of the present invention as described above.

In feasible embodiments, the aforementioned display device of the present invention may be an LCD display, an LED display, an OLED display, a Mini LED display, or a Micro LED display.

In a feasible embodiment, the aforementioned display device of the present invention is integrated into an information processing device, and the information processing device can be a smart phone, a tablet computer, a notebook computer, an all-in-one computer, a fingerprint punching device, or Access control device.

In order to enable your reviewer to further understand the structure, features, purpose, and advantages of the present invention, drawings and detailed descriptions of preferred specific embodiments are attached as follows.

The image data processing method of the present invention is used to generate a plurality of dithering templates based on a basic template for a display to display a plurality of different pictures in a continuous time. The principle is that the image data processing method is based on the The basic template performs an arranging operation to generate the dithering template, and the arranging operation includes: performing a row permutation operation and a column permutation operation on the basic template to generate the dithering template, wherein the basic template and the dithering template The dithering template is divided into upper left area, upper right area, lower left area and lower right area in the plane defined by plural rows and plural columns. The data of the upper left area of the dithering template is the same as that of the basic template. The data in the lower right area, the data in the upper right area of the dither template is the same as the data in the lower left area of the basic template, and the data in the lower left area of the dither template is the same as the data in the basic template. The data in the upper right area and the data in the lower right area of the dither template are the same as the data in the upper left area of the basic template.

Please refer to FIG. 3A and FIG. 3B, which show a flowchart of an image data processing method of the present invention. The image data processing method of the present invention is applied in an application processor (image signal processor), so that the application processor can generate K-1 templates based on a basic template, so that the basic template and the K -1 templates respectively perform a dithering operation processing on K frames of image data in a continuous time.

It is worth noting that the basic template is a two-dimensional array and has an array size of M×N, that is, the basic template used in the present invention is an M×N two-dimensional array, and K, M, and N are all Positive integer. In more detail, the grayscale value of each pixel in each frame of image data includes an integer part and a decimal part, and the decimal part is L bits, and L is a positive integer. For example, if the fractional part is 4 bits, the value of K is 2 ^L =2 ⁴ =16. On the other hand, the value of M×N is ^{an integral multiple of 2 L} , for example, L=4, M=8 and N=8, then M×N=8×8=64, and 64/2 ⁴ =4. Therefore, the basic template is an 8×8 two-dimensional array in this example.

As shown in FIG. 3A, the image data processing method of the present invention is used to perform K-1 arranging operations on the basic template. The arranging operation first executes step S1: determining a starting position to correspond to the first of the basic template. The position of the xth row in the y column, where x and y are both positive integers. FIG. 4A shows a diagram of a basic template used in the image data processing method of the present invention. As shown in Figure 4A, taking the starting position (x=3, y=4) as an example, the array value of the y-th column and the x-th row of the basic template corresponding to the starting position is 0 (such as the dotted circle Circled). Continuing, the image data processing method of the present invention can then perform step S2 and step S3, thereby generating the first template according to the basic template shown in FIG. 4A.

FIG. 4B shows a diagram of a template generated based on the basic template shown in FIG. 4A. Please refer to the 8×8 two-dimensional array shown in Figure 4A and Figure 4B at the same time. In step S2 of the image data processing method of the present invention, the array value (that is, 0) in the y-th column and the x-th row of the basic template (FIG. 4A) is filled into the first of a blank template (FIG. 4B) The position of row 0 in column 0, and the array values from column y, row x+1 to column y, row N-1 of the basic template are sequentially filled into column 0, row 1 to row 1 of the blank template The position of the 0th column and the Nx-1th row, and then the array values from the yth column and the 0th row to the yth column and the x-1th row of the basic template are sequentially filled into the 0th column and Nxth row of the blank template To the position of column 0 and row N-1. In more detail, the array value in the fourth column, row 3+1 to column 4, row 8-1 of the aforementioned basic template is 1000, and the basic template in column 4, row 0 to column 4, row 3- The array value of 1 row is 011. It can be easily understood by referring to FIG. 4B that the array value in the 0th column, row 1 to column 0, and row 8-3-1 of the blank template is 1000, and the blank template in column 0, row 8-3 to row 0. The array value in row 8-1 of the column is 011.

Continuing, the image data processing method of the present invention then executes step S3: fill the array value of the y+ith column and the xth row of the basic template (FIG. 4A) into the i-th column of the blank template (FIG. 4B) The position of row 0, and the array values from column y+i, row x+1 to column y+i, row N-1 of the basic template are sequentially filled in column i and row 1 of the blank template To the position of the Nx-1th row in the i-th column, and then fill in the array values from the y+ith column and the 0th row to the y+ith column and the x-1th row of the basic template in the blank template in sequence. The position from row N-x+1 in column i to row N-1 in column i. In one embodiment, the initial value of i is 1. Therefore, it can be seen from FIG. 4A that the array value of the 4+1 column and row 3 of the basic template (FIG. 4A) is 1, and the 4+1 column and row 3+1 of the basic template (FIG. 4A) are row 8 to column 4+1. The array value of 1 row is 0011, and the array value of the 4+1 column and row 0 to the 4+1 column and row 3-1 of the basic template is 000. It can be easily understood with reference to Figure 4B that the array value of the first column and row 0 of the blank template (Figure 4B) is 1, and the array of the first column and row 1 to the first column and row 8-3-1 of the blank template The value is 0011, and the array value in the first column and row 8-3+1 to the first column and row 8-1 of the blank template is 000.

Then, the image data processing method of the present invention continues to perform step S4: repeat the step S3 until y+i=M-1; where the initial value of i is 1, and 1 is successively added. Simply put, in the case of 4+3=8-1, all positions in column 1 and row 0 to column 3 and row 7 of the blank template (Figure 4B) will be filled into the basic template according to the aforementioned rules The array value of the corresponding position.

Continuing, the image data processing method of the present invention then executes step S5: fill the array value of the f-th column and the x-th row of the basic template into the position of the jth column and the 0th row of the blank template, and add the basic template The array values in column f, row x+1 to column f, row N-1 are sequentially filled in the positions of column j, row 1 to column j, row Nx-1 of the blank template, and then The array values in the fth column and row 0 to the fth column and row x-1 of the basic template are sequentially filled in the positions of the jth column and row Nx to the jth column and row N-1 of the blank template. The initial value of j is equal to y, and the initial value of f is equal to zero. In more detail, the array value in column 0 and row 3 of the basic template is 0, and the array value in column 0, row 3+1 to column 0, row 8-1 of the basic template is 0101, and the The array value from column 0, row 0 to column 0, row 3-1 of the basic template is 010. 4B, it can be easily understood that the array value in the fourth column and row 0 of the blank template is 0, and the array value in the fourth column, row 1 to column 4, row 8-3-1 of the blank template is 0101. And the array value in the fourth column and row 8-3 to the fourth column and row 8-1 of the blank template is 010.

Then, the image data processing method of the present invention continues to perform step S6: repeat the step S5 until j=M-1; where the initial value of j is equal to y and incremented by 1, and the initial value of f is equal to 0 and incremented by 1 . Simply put, in the case of 4=8-1, all positions in column 4, row 0 to column 7 and row 7 of the blank template (Figure 4B) will be filled in corresponding to the basic template according to the aforementioned rules The array value of the position. It should be understood that after completing steps S1 to S6, the first of the K-1 templates can be obtained.

In order to obtain the remaining K-1-1 templates, the image data processing method of the present invention continues to perform step S7: repeat the step S1 to the step S6 until all the templates are generated. It should be understood that after obtaining the basic template and the K-1 templates, the application processor can then use the basic template and the K-1 templates to perform pixel dithering on K frames of image data in a continuous period of time. deal with. For example, if K is 16, the application processor uses the basic template to perform pixel dithering processing on the image data of the first frame (Frm-0), so as to perform pixel dithering processing on the image data of the first frame (Frm-0). The grayscale value of each pixel is rounded to an integer. In addition, the application processor also uses the K-1 templates to perform pixel dithering processing on the image data of the second frame (Frm-1) to the Kth frame (Frm-K-1), respectively.

Simply put, in the case of applying the image data processing method of the present invention, the application processor can generate K-1 templates according to a basic template, so that the basic template and the K-1 templates are used to respectively compare K frames of image data in a continuous period of time perform pixel dithering processing. In other words, each pixel dithering processing loop uses K sets of different templates to process the continuous K frames of image data separately, so as to prevent the human eyes from being fixed when viewing the continuous K frames of image data. The texture (or pattern). It must be noted that the foregoing description takes K= ²⁴ as an example to explain in detail the steps of the image data processing method of the present invention. In a feasible embodiment, as the fractional part (ie, L bits) of each pixel in the image data is different, K=2 ^{L is used} .

In this way, the above has completely and clearly explained an image data processing method of the present invention; and from the above, it can be known that the present invention has the following advantages:

(1) The present invention discloses an image data processing method, which is used in an application processor (image signal processor) so that the application processor can generate K-1 templates based on a basic template. Moreover, when the decimal part of the pixel grayscale value contains 4 bits, the memory space for storing the basic template and the K-1 templates only needs to be 8×8×(2 ⁴ -1)+( 3+3)×15=1050 bits, which achieves the specific effect of greatly saving storage space.

(2) The present invention also provides a display device with an application processor for executing the image data processing method of the present invention as described above.

(3) In a possible embodiment, the aforementioned display device of the present invention is a display selected from the group consisting of LCD display, LED display, OLED display, Mini LED display, and Micro LED display.

(4) In another possible embodiment, the present invention further provides an information processing device having a central processing unit and the aforementioned display device, wherein the central processing unit is used to interact with the display Device communication and the information processing device can be a smart phone, a tablet computer, a notebook computer, an all-in-one computer, a fingerprint punching device or an access control device.

It must be emphasized that the foregoing disclosures in this case are preferred embodiments, and any partial changes or modifications that are derived from the technical ideas of this case and are easily inferred by those who are familiar with the art will not deviate from the patent of this case. Right category.

In summary, regardless of the purpose, means and effects of this case, it is shown that it is very different from the conventional technology, and its first invention is practical, and it does meet the patent requirements of the invention. I implore the examiner to check it out and grant the patent as soon as possible. Society is for the best prayer.

<The present invention>

Step S1: Determine a starting position to correspond to the position of the yth column and the xth row of the basic template, where x and y are both positive integers

Step S2: Fill the array value of the yth column and the xth row of the basic template into the position of the 0th column and the 0th row of a blank template, and add the yth column and the x+1th row to the yth column of the basic template The array values of row N-1 are sequentially filled in the positions of column 0, row 1 to column 0, row Nx-1 of the blank template, and then column y, row 0 to row y of the basic template The array values of column x-1 and row are sequentially filled in the positions of column 0, row Nx to column 0, row N-1 of the blank template.

Step S3: Fill in the array value of column y+i and row x of the basic template into the position of column i and row 0 of the blank template, and fill in the position of column y+i and row x+1 of the basic template The array values from column y+i to row N-1 are sequentially filled in the positions of column i, row 1 to column i, row Nx-1 of the blank template, and then y+th row of the basic template The array values in column i, row 0 to column y+i, row x-1 are sequentially filled in the positions of column i, row N-x+1 to column i, row N-1 of the blank template.

Step S4: Repeat this step S3S until y+i=M-1; where the initial value of i is 1, and 1 is added successively

Step S5: Fill the array value of the fth column and the xth row of the basic template into the position of the jth column and the 0th row of the blank template, and add the fth column and row x+1 to the fth column of the basic template The array values of row N-1 are sequentially filled in the positions of column j, row 1 to column j, row Nx-1 of the blank template, and then column f, row 0 to row f of the basic template Column x-1 and row array values are sequentially filled in the positions of the jth column and Nxth row to jth column and N-1th row of the blank template

Step S6: Repeat this step S5 until j=M-1; where the initial value of j is equal to y and incremented by 1, and the initial value of f is equal to 0 and incremented by 1

＜Acquaintances＞

no

FIG. 1A is a diagram showing a pixel array in an image data that has completed bit width expansion processing in the prior art; FIG. FIG. 1B is a diagram of a template used for performing pixel dithering operations in the prior art; FIG. 1C is a diagram of the pixel array in the image data after the pixel dithering operation is completed in the prior art; FIG. 2A to 2H are diagrams of 8 groups of different templates used in the prior art; 3A and 3B are flowcharts of an image data processing method of the present invention; 4A is a diagram of a basic template used in the image data processing method of the present invention; and FIG. 4B is a diagram of a template generated based on the basic template shown in FIG. 4A.

Step S1: Determine a starting position to correspond to the position of the yth column and the xth row of the basic template, where x and y are both positive integers

Step S2: Fill the array value of the yth column and the xth row of the basic template into the position of the 0th column and the 0th row of a blank template, and add the yth column and the x+1th row to the yth column of the basic template The array values of row N-1 are sequentially filled in the positions of column 0, row 1 to column 0, row Nx-1 of the blank template, and then column y, row 0 to row y of the basic template The array values of column x-1 and row are sequentially filled in the positions of column 0, row Nx to column 0, row N-1 of the blank template.

Step S3: Fill in the array value of column y+i and row x of the basic template into the position of column i and row 0 of the blank template, and fill in the position of column y+i and row x+1 of the basic template The array values from column y+i to row N-1 are sequentially filled in the positions of column i, row 1 to column i, row Nx-1 of the blank template, and then y+th row of the basic template The array values in column i, row 0 to column y+i, row x-1 are sequentially filled in the positions of column i, row N-x+1 to column i, row N-1 of the blank template.

Step S4: Repeat this step S3S until y+i=M-1; where the initial value of i is 1, and 1 is added successively

Claims (7)

An image data processing method is used to generate K-1 templates based on a basic template, thereby using the basic template and the K-1 templates to perform a dithering operation on K frames of image data in a continuous period of time, The basic template is a two-dimensional array and has an array size of M×N, and K, M, and N are all positive integers; it is characterized in that the image data processing method includes performing K-1 times on the basic template Arranging operation, and the arranging operation includes: determining a starting position to correspond to the position of the yth column and the xth row of the basic template, where x and y are both positive integers; the yth column and the xth row of the basic template The array value is filled in the position of the 0th column and the 0th row of a blank template, and the array values from the x+1th row to the N-1th row of the yth column of the basic template are sequentially filled into the blank template The positions from row 1 to row Nx-1 of column 0, and then the array values from row 0 to row x-1 of column y of the basic template are sequentially filled into column 0 of the blank template The position from row Nx to row N-1 of the basic template; the array value of column y+i and row x of the basic template is filled into the position of row 0 of the ith column of the blank template, and the position of the basic template The array values from row x+1 to row N-1 of column y+i are sequentially filled in the positions of row 1 to row Nx-1 of column i of the blank template, and then the basic template The array values from row 0 to row x-1 of column y+i are sequentially filled in the positions from row N-x+1 to row N-1 of column i of the blank template; before repeating One step until y+i=M-1, where the initial value of i is 1, and 1 is successively added; the array value of the fth column and the xth row of the basic template is filled into the jth column and the 0th row of the blank template And fill in the array values from row x+1 to row N-1 of column f of the basic template into row 1 to row Nx-1 of column j of the blank template in sequence Position, and then sequentially fill in the array values from row 0 to row x-1 of column f of the basic template into the position of row Nx to row N-1 of column j of the blank template; and Repeat the previous step until j=M-1, where the initial value of j is equal to y and incremented by 1, and the initial value of f is equal to 0 and incremented by 1; wherein, the value of each pixel in each of the image data The grayscale values all include an integer part and a fractional part, the fractional part is L bits, L is a positive integer, and the value of K is 2 ^L. The image data processing method of the first patent item range, wherein the value of an M × N is an integer multiple of 2 ^L. An image data processing method for generating a plurality of dithering templates according to a basic template for a display to display a plurality of different pictures in a continuous time, characterized in that the image data processing method is performed on the basic template An arranging operation to generate the dithering template, and the arranging operation includes: performing a row permutation operation and a column permutation operation on the basic template to generate the dithering template, wherein the basic template and the dithering template are The plane defined by the plural rows and plural columns is divided into upper left area, upper right area, lower left area, and lower right area. The data of the upper left area of the dither template is the same as the lower right area of the basic template The data in the upper right area of the dither template is the same as the data in the lower left area of the basic template, and the data in the lower left area of the dither template is the same as the upper right area of the basic template And the data in the lower right area of the dither template are the same as the data in the upper left area of the basic template. A display device having an application processor for executing the image data processing method as described in any one of items 1 to 3 of the scope of the patent application. The display device described in item 4 of the scope of patent application is a display selected from the group consisting of LCD display, LED display, OLED display, Mini LED display, and Micro LED display. An information processing device has a central processing unit and the display device as described in item 4 of the scope of patent application, wherein the central processing unit is used to communicate with the display device. The information processing device described in item 6 of the scope of patent application is selected from the group consisting of smart phones, tablet computers, notebook computers, all-in-one computers, fingerprint punching devices, and access control devices Electronic device.

Images