Super-large image comparison method

Abstract

The embodiment of the invention discloses a super-large image comparison method, which comprises the following steps of: 1, defining that a first image and a second image respectively comprise M rows * N columns of pixels, the size of each pixel is 1bit, and defining the storage space of a third image as M rows * N columns of storage grids; 2, the first image is divided into K first sub-images according to the sequence from left to right or from right to left, each first sub-image comprises M rows * L columns of pixels, N is equal to K * L, and the second image is divided into K second sub-images according to the same division sequence as the first image; and 3, sequentially comparing the K first sub-images of the first image with the K second sub-images of the second image one by one to obtain K third sub-images, sequentially putting the K third sub-images into the storage space of the third image, and splicing the K third sub-images into a third image. And the difference between two binary images with the same row number and column number can be quickly and intuitively observed through the third image.

Description

Technical Field

[0001] The invention belongs to the field of image processing, and in particular relates to a method for comparing super-large image pixels. Background Art

[0002] In the field of laser direct writing, it is usually necessary to process some images with large memory, such as comparing the similarities and differences between two binary images with a memory size of 160000×260000 pixels. In some embodiments, the pixels of the two binary images are usually compared one by one according to the same position in the same row and column. This comparison method has a large amount of program calculation, low efficiency, requires a lot of memory resources, and may even cause program crashes. Summary of the invention

[0003] The present invention provides a super-large image pixel comparison method, which aims to solve the problem of large program computation and low efficiency of the super-large image pixel comparison method in the prior art.

[0004] The scheme of the present invention is as follows:

[0005] Step 1: Define that the first image and the second image both include M rows × N columns of pixels, each pixel is 1 bit in size, and define the storage space of the third image as M rows × N columns of storage grids;

[0006] Step 2: Divide the first image into K first sub-images in a left-to-right or right-to-left order, each first sub-image includes M rows×L columns of pixels, where N=K×L, and divide the second image into K second sub-images in the same division order as the first image;

[0007] Step 3: sequentially compare the K first sub-images of the first image with the K second sub-images of the second image one by one to obtain K third sub-images, sequentially put the K third sub-images into the storage space of the third image, and splice the K third sub-images into one third image;

[0008] Among them, in the first image and the second image, the number 0 is used to represent white pixels, and the number 1 is used to represent black pixels; the size of each pixel in the third image is 2 bits, the pixel color is at least black or white, the number 00 is used to represent white pixels, and the number 11 is used to represent black pixels.

[0009] In some embodiments, K first sub-images of the first image are sequentially compared one by one with K second sub-images of the second image to obtain K third sub-images, specifically including:

[0010] Step 31: Compare any first sub-image among the K first sub-images of the first image with the corresponding second sub-image of the second image to obtain a third sub-image;

[0011] Step 32: Using the same idea as step 31, the remaining (K-1) first sub-images are compared with the corresponding (K-1) second sub-images one by one to obtain (K-1) third sub-images.

[0012] In some embodiments, step 31 includes:

[0013] Step 311: If L pixels of a first image strip in one row of any first sub-image are completely consistent with L pixels of a second image strip in a corresponding row of the corresponding second sub-image after one-to-one comparison, then the third image strip in that row of the third sub-image is the same as the first image strip or the second image strip;

[0014] Step 312: If the L pixels of a first image strip in one row of any first sub-image are not completely consistent with the L pixels of a second image strip in a corresponding row of the corresponding second sub-image after one-to-one comparison, the following steps are performed:

[0015] Step 312A: performing a bitwise AND operation on the L digital strings including 0 and / or 1 of the L pixels in one row of the first image strip of any first sub-image and the L digital strings including 0 and / or 1 of the L pixels in the corresponding row of the second image strip of the corresponding second sub-image, to obtain L common bits including the digital 0 and / or 1;

[0016] Step 312B: if there is at least one digit 1 in the common bits, then the corresponding pixel of the third image strip of the corresponding row of the third sub-image corresponding to each digit 1 is a black pixel, and the byte of the black pixel is defined as a 2-bit digit string 11;

[0017] Step 312C: If there is at least one digit 0 in the common digits, perform the following operations:

[0018] Step 312C1: If the number of the corresponding pixel of the first image strip of the corresponding row of the first sub-image corresponding to the number 0 in the shared bit is ORed with the corresponding number 0 in the shared bit, the result is 0, and the number of the corresponding pixel of the second image strip of the corresponding row of the second sub-image corresponding to the number 0 in the shared bit is ORed with the number 0 in the shared bit, the result is 0, then the corresponding pixel of the third image strip of the corresponding row of the third sub-image is a white pixel, and the size of the white pixel is 2 bits, which is represented by the digital string 00;

[0019] Step 312C2: If the corresponding pixel of the corresponding first image strip of the corresponding row of the first sub-image corresponding to the number 0 in the shared bit is ORed with the number 0 in the shared bit, the result is 1, and the corresponding pixel of the corresponding row of the second image strip of the second sub-image corresponding to the number 0 in the shared bit is ORed with the number 0 in the shared bit, the result is 0, then the corresponding pixel of the corresponding row of the third image strip of the third sub-image is a first color pixel other than a white pixel and a black pixel, and the size of the first color pixel is 2 bits, which is represented by the digital string 10;

[0020] Step 312C3: If the corresponding pixels of the first image strip of the corresponding row of the first sub-image corresponding to the number 0 in the common bit are ORed with the number 0 in the common bit, the result is 0, and the corresponding pixels of the second image strip of the corresponding row number of the second sub-image corresponding to the number 0 in the common bit are ORed with the number 0 in the common bit, the result is 1, then the corresponding pixels of the third image strip of the corresponding row number of the corresponding third sub-image are second color pixels other than white pixels, black pixels, and first color pixels, and the size of the second color pixel is 2 bits, represented by the string 01.

[0021] There is no particular order in which steps 31 to 33 are performed; there is no particular order in which steps 33C1 to 33C3 are performed.

[0022] In some embodiments, the first color is red and the second color is blue.

[0023] Beneficial technical effects of the present invention: The present application compares two binary images with the same number of rows and columns to obtain a third image based on the comparison results. Since the number of rows and columns of the third image is the same as those of the two binary images, the similarities and differences between the two binary images with the same number of rows and columns can be quickly and intuitively determined based on the third image. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 A method step diagram of an embodiment of the present invention;

[0025] Figure 2 A schematic diagram of comparing an exemplary first image including 11 rows×128 columns of pixels with an exemplary second image including 11 rows×128 columns of pixels, and displaying the comparison result in the form of pixels to obtain a third image including 11 rows×128 columns of pixels;

[0026] Figure 3 A schematic diagram showing a comparison of an exemplary 64 pixels of a first row of a first sub-image strip of a first first sub-image and an exemplary 64 pixels of a first row of a second sub-image strip of a first second sub-image expressed in numbers;

[0027] Figure 4 A schematic diagram showing a comparison of an exemplary 64 pixels of a first sub-image strip in a third row of a first sub-image and an exemplary 64 pixels of a second sub-image strip in a third row of a first second sub-image after being expressed in numbers;

[0028] Figure 5 A schematic diagram showing a comparison of an exemplary 64 pixels of a first sub-image strip in the fifth row of a first first sub-image and an exemplary 64 pixels of a second sub-image strip in the fifth row of a first second sub-image after being expressed in numbers. DETAILED DESCRIPTION

[0029] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0030] In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific position, be constructed and operated in a specific position, and therefore cannot be understood as limiting the present invention; the terms "first", "second", and "third" are only used to describe the difference, and cannot be understood as indicating or implying relative importance. In addition, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be an indirect connection through an intermediate object, or it can be a connection between the two elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0031] refer to Figure 1 , a super large image comparison method disclosed in an embodiment of the present application includes:

[0032] Step 1: Define that the first image and the second image both include M rows × N columns of pixels, each pixel is 1 bit in size, and define the storage space of the third image as M rows × N columns of storage grids;

[0033] Step 2: Divide the first image into K first sub-images in a left-to-right or right-to-left order, each first sub-image includes M rows×L columns of pixels, where N=K×L, and divide the second image into K second sub-images in the same division order as the first image;

[0034] Step 3: sequentially compare the K first sub-images of the first image with the K second sub-images of the second image one by one to obtain K third sub-images, sequentially put the K third sub-images into the storage space of the third image, and splice the K third sub-images into one third image;

[0035] Among them, in the first image and the second image, the number 0 is used to represent white pixels, and the number 1 is used to represent black pixels; the size of each pixel in the third image is 2 bits, the pixel color is at least black or white, the number 00 is used to represent white pixels, and the number 11 is used to represent black pixels.

[0036] Wherein, the first image and the second image are both binary images.

[0037] Combine the following Figures 2 to 5 , describe steps 1 to 3 in detail.

[0038] Will Figure 2 The leftmost image is defined as the first image, the middle image is defined as the second image, and the rightmost image is the third image. The first image and the second image both contain M rows × N columns of pixels and are binary images. Exemplarily, M is exemplarily 11, N is exemplarily 128, and the size of each pixel in the first image and the second image is defined as 1 bit. The storage space for the third image is defined as exemplarily including 11 rows × 128 columns of storage grids, and the size of the pixel that can be stored in each storage grid is 2 bits.

[0039] Since N is exemplarily taken as 128 in the first image and the second image, the first image is divided into two first sub-images from left to right, and each first sub-image includes 11 rows × 64 columns of pixels, that is, K = 2. It should be noted that the 64 columns of each sub-image are also exemplary, and the number of columns of the two first sub-images can be the same or different. For the convenience of description, the present application represents the number of columns of the two first sub-images as 64 columns. Define each row of the two first sub-images as a first image strip. Similarly, divide the second image into two second sub-images from left to right, and each second sub-image includes 11 rows × 64 columns of pixels. Each second sub-image has the same number of rows and columns as the first sub-image of the corresponding number: for example, the first second sub-image has the same number of rows and columns as the corresponding first first sub-image; the second second sub-image has the same number of rows and columns as the corresponding second first sub-image. Define each row of the two second sub-images as a second image strip.

[0040] Will Figure 2 Each row of the first image strip of the first first sub-image is compared as a whole with each row of the second image strip corresponding to the first second sub-image, and the comparison result is displayed in the form of pixels at the corresponding row position in the first third sub-image in the third image, and the obtained plurality of rows of the third image strips sequentially constitute the first third sub-image.

[0041] Similarly, Figure 2 Each row of the first image strip of the second first sub-image is compared with each row of the second image strip of the second second sub-image, and the comparison result is displayed in the form of pixels at the corresponding position in the second third sub-image of the third image, and the obtained rows of third image strips are sequentially composed of the second third sub-image. The first third sub-image and the second third sub-image are spliced ​​head to tail according to the third image strips in the same row, and finally form the third image. Since the first image and the second image are binary images, the pixels of the third image at least include two types of pixels, black or white, but each byte of these two pixels is 2 bits. For example: if the first image is all white pixels and the second image is also all white pixels, then the pixels of the output third image are all white pixels; if the first image is all black pixels and the second image is also all black pixels, then the pixels of the output third image are also all black pixels.

[0042] Figure 2In the embodiment, any row of the first image strip of any (i.e., the first or second) first sub-image is compared as a whole with the corresponding row of the second image strip of the corresponding second sub-image, and the comparison result is displayed in the form of a third image strip at the corresponding position of the corresponding third sub-image. The result of the overall comparison may be completely the same, or partially the same, and the two different results are processed in different ways. It should be noted that the two rows of corresponding first image strips and second image strips mentioned in the present application are completely the same, which means that each pixel of the first image strip is compared one by one with each pixel of the corresponding second image strip, and they are completely the same. This does not mean that each pixel of the first image strip or the second image strip is required to be the same, for example, it is not required that all pixels of the first image strip are white pixels or all black pixels.

[0043] The following examples illustrate this in detail:

[0044] (1) The size of each pixel in the first image and the second image is 1 bit, and the first image and the second image are both binary images. Therefore, in the first image and the second image: 0 represents white pixels; 1 represents black pixels. In each sub-image of the third image, the size of each pixel is 2 bits, and the digital string 00 is defined to represent white pixels. Please refer to Figure 2 and Figure 3 , the exemplary 64 pixels of the first row of the first image strip L1111 (1 row × 64 columns) of the first first sub-image are all white pixels, represented by 000.......000 (64 bits in total), and the corresponding exemplary 64 pixels of the first row of the second image strip L1212 (1 row × 64 columns) of the first second sub-image are also all white pixels, represented by 000.......000 (64 bits in total). That is, the results of comparing each pixel of the two are exactly the same. Therefore, since the two are exactly the same, after comparing the two, the output result is represented by the first row of the third image strip of the first third sub-image composed of 64 white pixels, represented by 000000......000000 (128 bits in total), that is, the two-bit digital string 00 represents white pixels.

[0045] (2). Please continue to refer to Figure 2 and Figure 4 , the exemplary 64 pixels of the third row of the first image strip (3 rows×64 columns) of the first first sub-image are not all white pixels: the 62nd column pixel is a black pixel. The 64 pixels of the third row of the second image strip (3 rows×64 columns) of the first second sub-image are all white pixels. Therefore, the third row of the first image strip of the first first sub-image and the third row of the second image strip of the first second sub-image are not completely the same.

[0046] The third row of the first image strip of the first sub-image is defined as L1131, and the corresponding pixels are represented by a digital string of 000...100, with a total of 64 bits. The third row of the second image strip of the first sub-image is defined as L1232, and the corresponding pixels are represented by a digital string of 000...000, with a total of 64 bits.

[0047] Since the third row of the first image strip of the first sub-image and the third row of the second image strip of the first second sub-image are not exactly the same, the following operations need to be performed:

[0048] Perform a bitwise AND operation on each corresponding digit of the digital string 000......100 (64 bits in total) corresponding to the third row and first image strip of the first sub-image and the digital string 000......000 (64 bits in total) corresponding to the third row and second image strip of the first second sub-image (i.e., if one of the two digits is 0, the calculation result is 0). The calculation result is represented by the common digital string common1: 000......000, 64 bits in total. Since there is a digit 0 in the common bit, the following operations need to be performed:

[0049] Perform an OR operation with the digital string corresponding to the third row of the first image strip L1131 of the first sub-image and each digit corresponding to the common digital string common1 (if the two digits are the same, the result is 0; if the two digits are different, the result is 1), and obtain the first unique bit, represented by unique11: 000......100, a total of 64 bits; perform an OR operation with the digital string corresponding to the third row of the second image strip of the first second sub-image and the common digital string common1, and obtain the second unique bit, represented by unique21: 000......000, a total of 64 bits. Compare the first unique bit 000......100 and the second unique bit 000......000 one by one, and obtain 128 output digital strings including the digits 0 or 1, and obtain the comparison result result1, represented by 128 bits, see Figure 4 For example: compare the first digit 0 from the left of the first unique bit unique11 with the first digit 0 from the left of the second unique bit unique21, and the result is represented by 00. The displayed pixel is a white pixel, that is, the first pixel from the left of the third image strip of the third row of the third sub-image of the first frame is a white pixel. Figure 2As shown. Compare the second digit 0 from the left of the first unique bit unique12 with the second digit 0 from the left of the second unique bit unique22, and the result is represented by 00. The displayed pixel is a white pixel, that is, the second pixel from the left of the third image strip of the third row of the first third sub-image is a white pixel. Compare the 62nd digit 1 from the left of the first unique bit unique12 with the 62nd digit 0 from the left of the second unique bit unique21, and the result is represented by 10. The displayed pixel is a first color different from black and white, that is, the color of the 62nd pixel from the left of the third image strip of the third row of the first third sub-image is the first color. Taking into account the limitations of the color submission of the drawings in the patent application specification, the first color is Figure 2 The plurality of horizontal dots and lines shown are schematically represented. In some embodiments, the first color may be red, purple or cyan. It can be seen that any pixel in any row of the third image strip of the first third sub-image occupies 2 bits.

[0050] (3).Reference Figure 2 and Figure 5 , let's take an example Figure 2 The comparison result of the fifth row of the first image strip of the first first sub-image and the fifth row of the second image strip of the first second sub-image. Define the fifth row of the first image strip of the first first sub-image as L1151; the fifth row of the second image strip of the first second sub-image as L1252. L1151 is represented by numbers: 001......100, a total of 64 bits; L1252 is represented by numbers: 011......111, a total of 64 bits. Since L1151 is not exactly the same as L1252, it is necessary to continue the comparison:

[0051] First, a bitwise AND operation is performed on the number string 001...100 (64 bits in total) corresponding to the fifth row and first image strip of the first sub-image of the first frame and the number 011...111 (64 bits in total) corresponding to the fifth row and second image strip of the first second sub-image of the first frame (that is, as long as one of the two numbers is 0, the calculation result is 0), and the calculation result is represented by the common number string common2, and the result is expressed as 001...100, with a total of 64 bits.

[0052] After obtaining the common digital string common2, since the number 0 exists in the common digital string common2, the following steps need to be performed:

[0053] The digital string L1151:001......100 corresponding to the fifth row of the first image strip of the first sub-image is ORed with the common digital string common2:001......100 to obtain the first unique bit 000......000, a total of 64 bits, represented by unique12; the digital string L1252:011......111 corresponding to the fifth row of the second image strip of the first second sub-image is ORed with the common digital string common2:001......100 to obtain the second unique bit 010......011, a total of 64 bits, represented by unique22.

[0054] Finally, compare common2, unique12 and unique22 one by one, and output the comparison result result2. The comparison result result2 contains a total of 128 bytes, that is, two bits are used to represent one pixel. The specific comparison is as follows: the first bit from the left is 0,0,0, and the output is 00, corresponding to Figure 2 The first bit from the left of the third image strip in the fifth row of the first third sub-image is displayed as a white pixel; the second bit from the left is 0, 0, 1 respectively, and the output is 01, corresponding to Figure 2 The second bit from the left of the third image strip in the fifth row of the first third sub-image is displayed as the first color pixel; the third bit from the left is 1, 0, 0 respectively. Since the common bit is 1, 11 is directly output, corresponding to Figure 2 The third bit from the left in the third image strip of the fifth row of the first third sub-image is displayed as a black pixel. That is to say, for any corresponding first image strip and second image strip that are not completely identical, in the common digital string obtained by performing an AND operation, the corresponding pixel of the first image strip corresponding to 1 in the common digital string does not need to be ORed with the number 1 in the common digital string, and is represented by " / " in the first unique bit unique12, which generally defaults to the number 0; the corresponding pixel of the second image strip corresponding to 1 in the common digital string does not need to be ORed with the number 1 in the common digital string, and is represented by " / " in the second unique bit unique22, which generally defaults to the number 0; finally, the corresponding position in the third image strip in the corresponding third sub-image is directly filled with black pixels. The 62nd bit from the left is the same as the 3rd bit from the left, and will not be repeated; the 63rd bit from the left and the 64th bit from the left are the same as the second bit from the left, and will not be repeated here.

[0055] final, Figure 2 The pixel colors of the third image strip in the 5th row of the first third sub-image are: white, second color, black (first three bits) .... black, second color, second color (last 64 bits).

[0056] Using a method similar to that of obtaining the pixel colors of the 5th row of the third image strip of the first third sub-image, the colors of the pixels of the remaining 10 rows of the third image strips of the first third sub-image can be obtained, and finally these 11 rows of the third sub-images sequentially constitute the first third sub-image.

[0057] Similarly, using the same method as obtaining the first third sub-image, Figure 2 The second first sub-image of the first image and the second second sub-image of the second image are compared to obtain a second third sub-image.

[0058] Finally, put the two third sub-images into Figure 2 The storage squares in the third image are spliced ​​into a third image.

[0059] The comparison result between the first image and the second image can be intuitively reflected from the third image.

[0060] In the present application, the first color is exemplarily red, and the second color is exemplarily blue. The first color needs to be different from black and white, and the second color needs to be different from the first color.

[0061] In the present application, M is 11, N is 128, and K is 2 for exemplary purposes only. It is exemplary that both first sub-images include 64 columns. The first sub-image may also include 60 columns and the second sub-image may include 68 columns, without any specific limitation. Similarly, K may also be 3, and the number of columns of each image is, for example, 40 columns for the first sub-image, 50 columns for the second sub-image, and 38 columns for the third sub-image. However, it is required that the number of rows and columns of the second image must be the same as the number of rows and columns of the first image; the number of rows and columns of the third image must be the same as the number of rows and columns of the first image. The number of frames of the third sub-image is the same as the number of frames of the first sub-image; the number of rows and columns of each third sub-image is exactly the same as the number of rows and columns of the corresponding first sub-image or second sub-image.

[0062] In the present application, the larger the M and N are, the larger the memory of the first image and the second image is, and the larger the memory of the third image obtained by comparing the first image and the second image is. The difference between the first image and the second image can be quickly distinguished through the third image.

[0063] Finally, it should be noted that the above are only preferred embodiments of the present invention and are not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, it is still possible for those skilled in the art to modify the technical solutions described in the aforementioned embodiments, or to make equivalent substitutions for some of the technical features therein. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for comparing very large images, characterized in that: include: Step 1: Define that the first image and the second image both include M rows × N columns of pixels, each pixel is 1 bit in size, and define the storage space of the third image as M rows × N columns of storage grids; Step 2: Divide the first image into K first sub-images in a left-to-right or right-to-left order, each first sub-image includes M rows×L columns of pixels, where N=K×L, and divide the second image into K second sub-images in the same division order as the first image; Step 3: sequentially compare the K first sub-images of the first image with the K second sub-images of the second image one by one to obtain K third sub-images, sequentially put the K third sub-images into the storage space of the third image, and splice the K third sub-images into one third image; Among them, in the first image and the second image, the number 0 is used to represent white pixels, and the number 1 is used to represent black pixels; the size of each pixel in the third image is 2 bits, the pixel color is at least black or white, the number 00 is used to represent white pixels, and the number 11 is used to represent black pixels.

2. The super large image comparison method according to claim 1, characterized in that: In step 3, K first sub-images of the first image are compared one by one with K second sub-images of the second image in sequence to obtain K third sub-images, which specifically includes: Step 31: Compare any first sub-image among the K first sub-images of the first image with the corresponding second sub-image of the second image to obtain a third sub-image; Step 32: Using the same idea as step 31, the remaining (K-1) first sub-images are compared with the corresponding (K-1) second sub-images one by one to obtain (K-1) third sub-images.

3. The super large image comparison method according to claim 2, characterized in that: Step 31 includes: Step 311: If L pixels of a first image strip in one row of any first sub-image are completely consistent with L pixels of a second image strip in a corresponding row of the corresponding second sub-image after one-to-one comparison, then the third image strip in that row of the third sub-image is the same as the first image strip or the second image strip; Step 312: If the L pixels of a first image strip in one row of any first sub-image are not completely consistent with the L pixels of a second image strip in a corresponding row of the corresponding second sub-image after one-to-one comparison, the following steps are performed: Step 312A: performing a bitwise AND operation on the L digital strings including 0 and / or 1 of the L pixels in one row of the first image strip of any first sub-image and the L digital strings including 0 and / or 1 of the L pixels in the corresponding row of the second image strip of the corresponding second sub-image, to obtain L common bits including the digital 0 and / or 1; Step 312B: if there is at least one digit 1 in the common bits, then the corresponding pixel of the third image strip of the corresponding row of the third sub-image corresponding to each digit 1 is a black pixel, and the byte of the black pixel is defined as a 2-bit digit string 11; Step 312C: If there is at least one digit 0 in the common digits, perform the following operations: Step 312C1: If the number of the corresponding pixel of the first image strip of the corresponding row of the first sub-image corresponding to the number 0 in the shared bit is ORed with the corresponding number 0 in the shared bit, the result is 0, and the number of the corresponding pixel of the second image strip of the corresponding row of the second sub-image corresponding to the number 0 in the shared bit is ORed with the number 0 in the shared bit, the result is 0, then the corresponding pixel of the third image strip of the corresponding row of the third sub-image is a white pixel, and the size of the white pixel is 2 bits, which is represented by the digital string 00; Step 312C2: If the corresponding pixel of the corresponding first image strip of the corresponding row of the first sub-image corresponding to the number 0 in the shared bit is ORed with the number 0 in the shared bit, the result is 1, and the corresponding pixel of the corresponding row of the second image strip of the second sub-image corresponding to the number 0 in the shared bit is ORed with the number 0 in the shared bit, the result is 0, then the corresponding pixel of the corresponding row of the third image strip of the third sub-image is a first color pixel other than a white pixel and a black pixel, and the size of the first color pixel is 2 bits, which is represented by the digital string 10; Step 312C3: If the corresponding pixels of the first image strip of the corresponding row of the first sub-image corresponding to the number 0 in the common bit are ORed with the number 0 in the common bit, the result is 0, and the corresponding pixels of the second image strip of the corresponding row number of the second sub-image corresponding to the number 0 in the common bit are ORed with the number 0 in the common bit, the result is 1, then the corresponding pixels of the third image strip of the corresponding row number of the corresponding third sub-image are second color pixels other than white pixels, black pixels, and first color pixels, and the size of the second color pixel is 2 bits, represented by the string 01. There is no particular order in which steps 31 to 33 are performed; there is no particular order in which steps 33C1 to 33C3 are performed.

4. The super large image comparison method according to claim 3, characterized in that: The first color is red, and the second color is blue.

Images