CN106604033B - Image coding and logical calculation method and device - Google Patents

Abstract

The present invention relates to the technical field of image processing, and provides an image encoding and logical operation method and device, firstly, multiple binary images are respectively expanded into multiple square binary images; secondly, according to the nodes in each of the square binary images, Node code q and pixel code r generate a truncated quadtree code for each square binary image; then perform logical operations on the truncated quadtree code to obtain a result code sequence; finally decode the result code sequence to obtain 2 An expanded binary image of ^N ×2 ^N , and the sub-image expanded by the expanded binary image is intercepted to obtain a resultant binary image. In this way, binary image encoding with sufficiently small space overhead can be obtained, and at the same time, the speed of logical operation of binary images is faster.

Description

Image coding and logical operation method and device

technical field

The present invention relates to the technical field of image processing, in particular to an image coding and logical operation method and device.

Background technique

Logical operations on binary images are frequently found in image compression and processing, as well as object recognition and image understanding tasks in machine vision inspection. Logical operations on binary images can often be conveniently completed through pixel-by-pixel logical operations, and the operating efficiency and space overhead are also acceptable. However, when a large number of large-scale binary images are subjected to multiple logical operations, this method of pixel-by-pixel operation has problems in both time and space performance. In addition, in many applications, binary images are often expressed in a compressed form. If the pixel-by-pixel logical operation method is used, it is necessary to convert these compressed binary images into the original pixel form, and then convert back to the original pixel form after the operation is completed. The compressed format not only cannot take full advantage of the advantages of less compressed binary image data, but also increases the burden of expression form conversion.

Contents of the invention

The object of the present invention is to provide an image coding and logical operation method to improve the above problems.

Another object of the present invention is to provide an image coding and logical operation device to improve the above problems.

In order to achieve the above object, the technical solution adopted in the embodiment of the present invention is as follows:

The present invention provides an image coding and logical operation method, which includes: respectively expanding multiple binary images into multiple square binary images; r, generating the truncated quadtree encoding of each square binary image; performing the first logical operation on the truncated quadtree encoding of any two square binary images of the same size to obtain the resulting encoding sequence; for any A truncated quadtree encoding of the square binary image is subjected to a second logic operation to obtain a result encoding sequence; an expanded binary image of 2 ^N × 2 ^N is obtained by decoding the result encoding sequence, and the expanded binary image is intercepted The sub-image augmented by the binary image to obtain the resulting binary image.

The present invention also provides an image coding and logical operation device, which is applied to electronic equipment, and includes: an expansion module, which is used to respectively expand multiple binary images into multiple square binary images; a coding module, which is used for each The node code q and the pixel code r of the nodes in the said square binary image generate the truncated quadtree code of each said square binary image; the first logical operation module is used for any two of the same size all Perform logical operations on the truncated quadtree encoding of the square binary image to obtain a result encoding sequence; the second logical operation module is used to perform a second logical operation on any one of the truncated quadtree encodings of the square binary image, Obtain the resulting coded sequence; the decoding module is used to decode the resulting coded sequence to obtain an expanded binary image of 2 ^N × 2 ^N , intercept the expanded sub-image of the expanded binary image, and obtain the resulting binary image.

Compared with the prior art, the present invention provides an image coding and logical operation method and device. Firstly, a plurality of binary images are respectively expanded into a plurality of square binary images; secondly, according to each of the square binary images, The node code q and the pixel code r of the node in the image generate the truncated quadtree coding of each said square binary image; again, carry out the truncated quadtree coding of any two said square binary images of the same size The first logical operation is to obtain the result coding sequence; finally, according to the result coding sequence, the expanded binary image of 2 ^N × 2 ^N is obtained by decoding, and the sub-image expanded by the expanded binary image is intercepted to obtain the resulting binary image image. Compared with the binary image processing in the prior art, the present invention can obtain binary image coding with sufficiently small space overhead through the truncated quadtree coding method, and at the same time, the speed of logical operation of the binary image is also faster.

In order to make the above-mentioned objects, features and advantages of the present invention more comprehensible, preferred embodiments will be described in detail below together with the accompanying drawings.

Description of drawings

In order to illustrate the technical solutions of the embodiments of the present invention more clearly, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention, and thus It should be regarded as a limitation on the scope, and those skilled in the art can also obtain other related drawings based on these drawings without creative work.

Fig. 1 shows a schematic block diagram of an electronic device provided by a preferred embodiment of the present invention.

Fig. 2 shows a flow chart of an image coding and logical operation method provided by a preferred embodiment of the present invention.

FIG. 3 is a flow chart of sub-steps of step S102 shown in FIG. 2 .

FIG. 4 is a flowchart of a sub-step of step S103 shown in FIG. 2 .

FIG. 5 is a flow chart of another sub-step of step S103 shown in FIG. 2 .

FIG. 6 is a flow chart of another sub-step of step S103 shown in FIG. 2 .

FIG. 7 is a flow chart of another sub-step of step S103 shown in FIG. 2 .

FIG. 8 is a flowchart of sub-steps of step S104 shown in FIG. 2 .

FIG. 9 is a flowchart of sub-steps of sub-step S1036 in FIG. 4 to FIG. 7 .

FIG. 10 is a sub-step flowchart of sub-step S1042 shown in FIG. 8 .

Fig. 11 shows a schematic block diagram of an image coding and logical operation device provided by a preferred embodiment of the present invention.

Icons: 100-electronic equipment; 101-memory; 102-storage controller; 103-processor; 200-image coding and logic operation device; 201-expansion module; 202-encoding module; 203-first logic operation module; 204 - second logic operation module; 205 - decoding module.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. The components of the embodiments of the invention generally described and illustrated in the figures herein may be arranged and designed in a variety of different configurations. Accordingly, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative efforts belong to the protection scope of the present invention.

It should be noted that like numerals and letters denote similar items in the following figures, therefore, once an item is defined in one figure, it does not require further definition and explanation in subsequent figures. Meanwhile, in the description of the present invention, the terms "first", "second", etc. are only used to distinguish descriptions, and cannot be understood as indicating or implying relative importance.

Fig. 1 shows a schematic block diagram of an electronic device 100 provided by a preferred embodiment of the present invention. The electronic device 100 is preferably a computer, which may include a desktop computer and a personal notebook computer. The electronic device 100 includes an image coding and logical operation device 200 , a memory 101 , a storage controller 102 , and a processor 103 .

The memory 101 , storage controller 102 , and processor 103 are electrically connected to each other directly or indirectly to realize data transmission or interaction. For example, these components can be electrically connected to each other through one or more signal lines. The image coding and logical operation device 200 includes at least one software function module that can be stored in the memory 101 in the form of software or firmware (firmware) or solidified in the operating system (operating system, OS) of the electronic device 100 . The processor 103 is configured to execute executable modules stored in the memory 101 , such as software function modules or computer programs included in the image coding and logical operation device 200 .

Wherein, memory 101 can be, but not limited to, random access memory (Random Access Memory, RAM), read-only memory (Read Only Memory, ROM), programmable read-only memory (Programmable Read-OnlyMemory, PROM), erasable In addition to read-only memory (Erasable Programmable Read-Only Memory, EPROM), electrically erasable read-only memory (Electric Erasable Programmable Read-Only Memory, EEPROM), etc. Wherein, the memory 101 is used to store a program, and the processor 103 executes the program after receiving an execution instruction, and the method performed by the process definition server disclosed in any embodiment of the present invention can be applied to the processor 103, Or implemented by the processor 103 .

The processor 103 may be an integrated circuit chip with signal processing capabilities. Above-mentioned processor 103 can be general-purpose processor, comprises central processing unit (Central Processing Unit, CPU), network processor (NetworkProcessor, NP), speech processor and video processor etc.; Integrated circuits, field programmable gate arrays or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. Various methods, steps and logic block diagrams disclosed in the embodiments of the present invention may be implemented or executed. The general-purpose processor may be a microprocessor, or the processor 103 may be any conventional processor or the like.

first embodiment

Please refer to FIG. 2 . FIG. 2 shows a flowchart of an image coding and logical operation method provided by a preferred embodiment of the present invention. The image coding and logical operation method comprises the following steps:

Step S101, expand multiple binary images into multiple square binary images respectively.

In the embodiment of the present invention, the expanded part of the square binary image is filled with a single color, either black or white, preferably black.

Step S102, according to the node code q and the pixel code r of the nodes in each square binary image, generate a truncated quadtree code for each square binary image.

Please refer to FIG. 3, step S102 also includes the following sub-steps:

Step S1021, constructing a quadtree of a square binary image.

In the embodiment of the present invention, each node of the quadtree has a depth of q.depth, wherein the depth of the root node is 0, and the depth of the child node in the quadtree is the depth of the parent node corresponding to the child node plus 1.

Step S1022, starting from the root node of the square binary image, traversing the quadtree in a depth-first manner.

Step S1023, if the depth of the currently traversed node is less than or equal to the first standard, set the q.mono, q.color and q.depth of the node code q of the node according to the first rule, and code the node corresponding to the node q adds a pre-set empty basic node coding sequence, wherein the first criterion is the difference between the layer N of the square binary image and the truncated layer _NT , and the truncated layer _NT is preset.

In the embodiment of the present invention, the first rule is: use 1 byte to encode the node, wherein, the highest bit of the byte indicates q.mono, the second highest bit indicates q.color, and the lower six bits are integer values Given the depth q.depth of the node, when the sub-area corresponding to the node is a monochromatic area, q.mono=TRUE, otherwise q.mono=FALSE, when q.mono=FALSE, the value of q.color No effect, when all pixels in the monochrome area are white, q.mono=TRUE and q.color=TRUE, when all pixels in the monochrome area are black, q.mono=TRUE and q.color = FALSE.

Step S1024, if the depth of the currently traversed node is equal to the second standard, and the sub-area corresponding to the node is a monochromatic area, set the q.mono, q.color and q. of the node code q of the node according to the second rule. depth, and add the node code q corresponding to the node to the basic node code sequence, and set the pixel code r of the sub-region corresponding to the node, add the pixel code r to the preset empty basic pixel code sequence, and no longer modify the node All child nodes of , where the second criterion is NN _T +1.

In the embodiment of the present invention, the second rule is: use 1 byte to encode the node, the highest bit of the byte indicates q.mono, the second highest bit indicates q.color, and the lower six bits are given as integer values The depth q.depth of this node, set q.mono=TRUE, when all the pixels in the monochrome area are white, q.color=TRUE, when all the pixels in the monochrome area are black, q.color = FALSE.

In the embodiment of the present invention, one bit in the pixel code r corresponds to each pixel in the sub-region corresponding to the node, and when the pixel is white, the corresponding bit in the pixel code r is 1.

Step S1025, after the traversal is completed, the truncated quadtree coding of the square binary image is obtained according to the basic node coding sequence and the basic pixel coding sequence.

Step S103, performing a first logical operation on the truncated quadtree encoding of any two square binary images of the same size to obtain a resulting encoding sequence.

In the embodiment of the present invention, the first logical operation includes a logical AND operation, a logical OR operation, a logical exclusive OR operation, and a set difference operation.

Please refer to FIG. 4, when the first logical operation is a logical AND operation, step S103 also includes the following sub-steps:

Step S1031, set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), and q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ .

Step S1032, if q ₁ .mono=FALSE and q ₂ .mono=FALSE, add q ₁ to the preset empty node code sequence Q _R .

Step S1033, if q ₁ .mono=TRUE and q ₁ .color=TRUE, code the current subtree in (Q ₂ , R ₂ ) into the node coding sequence Q _R and the preset empty pixel coding sequence R _R , set q ₁ as the code of the next node in Q ₁ , otherwise add q ₁ to Q _R , and ignore the code of the current subtree in Q ₂ .

Step S1034, if q ₂ .mono=TRUE and q ₂ .color=TRUE, then code the current subtree in (Q ₁ , R ₁ ) into Q _R and R _R , and set q ₂ as the next subtree in Q _{2 A} node encoding, otherwise add _q2 to _QR and ignore the current subtree encoding in Q1.

Step S1035, if q ₁ .depth=NN _T +1, then calculate the logical AND of r ₁ and r ₂ , and add the result to R _R , then set r ₁ as the next pixel code of R ₁ and set r ₂ as R ₂ 's next pixel encoding.

In step S1036, when both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) have been traversed, the operation ends, and (Q _R , R _R ) is the coded sequence obtained by the logic operation.

Please refer to FIG. 5, when the first logical operation is a logical OR operation, step S103 also includes the following sub-steps:

Step S1031, set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), and q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ .

Step S1032, if q ₁ .mono=FALSE and q ₂ .mono=FALSE, add q ₁ to the preset empty node code sequence Q _R .

Step S1033, if q ₁ .mono=TRUE and q ₁ .color=FALSE, add the current subtree code in (Q ₂ , R ₂ ) to the node code sequence Q _R and the preset empty pixel code sequence In R _R , set q ₁ as the code of the next node in Q ₁ , otherwise add q ₁ to Q _R , and ignore the code of the current subtree in Q ₂ .

Step S1034, if q ₂ .mono=TRUE and q ₂ .color=FALSE, code the current subtree in (Q ₁ , R ₁ ) into Q _R and R _R , and set q ₂ as the next subtree in Q _{2 A} node encoding, otherwise add _q2 to _QR and ignore the current subtree encoding in Q1.

Step S1035, if q ₁ .depth=NN _T +1, then calculate the logical OR of r ₁ and r ₂ , and add the result to R _R , then set r ₁ as the next pixel code of R ₁ and set r ₂ as R ₂ 's next pixel encoding.

In step S1036, when both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) have been traversed, the operation ends, and (Q _R , R _R ) is the coded sequence obtained by the logic operation.

Please refer to FIG. 6, when the first logical operation is a logical XOR operation, step S103 also includes the following sub-steps:

Step S1031, set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), and q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ .

Step S1032, if q ₁ .mono=FALSE and q ₂ .mono=FALSE, add q ₁ to the preset empty node code sequence Q _R .

Step S1033, if q ₁ .mono=TRUE and q ₁ .color=TRUE, add the inverse color coding of the current subtree in (Q ₂ , R ₂ ) to the node coding sequence Q _R and the preset empty In the pixel coding sequence R _R , otherwise, the coding of the current subtree in Q ₂ is added to Q _R and _RR , and q ₁ is set as the coding of the next node in Q ₁ .

Step S1034, if q ₂ .mono=TRUE and q ₂ .color=TRUE, then add the inverse color coding of the current subtree in (Q ₁ , R ₁ ) to Q _R and R _R , otherwise add the inverse color coding of the current subtree in Q ₁ The code of the current subtree is added to Q _R and _RR , and q ₂ is set as the code of the next node in Q ₂ .

Step S1035, if q ₁ .depth=NN _T +1, calculate the logical exclusive OR of r ₁ and r ₂ , and add the result to R _R , then set r ₁ as the next pixel code of R ₁ and set r _{2 Encode} the next pixel for R2.

In step S1036, when both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) have been traversed, the operation ends, and (Q _R , R _R ) is the coded sequence obtained by the logic operation.

Please refer to FIG. 7, when the first logic operation is a set difference operation, step S103 also includes the following sub-steps:

Step S1031, set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), and q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ .

Step S1032, if q ₁ .mono=FALSE and q ₂ .mono=FALSE, add q ₁ to the preset empty node code sequence Q _R .

Step S1033, if q ₁ .mono=TRUE and q ₁ .color=TRUE, add the inverse color coding of the current subtree in (Q ₂ , R ₂ ) to the node coding sequence Q _R and the preset empty In the pixel code sequence R _R , set q ₁ as the next pixel code in Q ₁ , otherwise add q ₁ to Q _R , and ignore the current subtree code in Q ₂ .

Step S1034, if q ₂ .mono=TRUE and q ₂ .color=TRUE, ignore the current subtree code in Q ₁ , invert q ₂ .color, add q ₂ to Q _R , otherwise add (Q ₁ , R ₁ ) the current subtree encoding is added to Q _R and R _R , and q ₂ is set as the next pixel encoding in Q ₂ .

Step S1035, if q ₁ .depth=NN _T +1, then calculate the set difference between r ₁ and r ₂ , that is, perform a logical AND operation with r ₁ after bit-by-bit inversion of r ₂ , and add the result to R _R , then Set _r1 to the next pixel code _{of R1} and set _r2 to the next pixel code of R2.

In step S1036, when both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) have been traversed, the operation ends, and (Q _R , R _R ) is the coded sequence obtained by the logic operation.

Step S104, performing a second logical operation on the truncated quadtree encoding of any one of the square binary images to obtain a resulting encoding sequence.

Please refer to FIG. 8, step S104 also includes the following sub-steps:

Step S1041, set the truncated quadtree code of any square binary image as (Q, R), where q is the code of the first node in Q, and r is the code of the first pixel in R.

Step S1042, add the inverse color coding of the current subtree in (Q, R) to the preset empty node coding sequence Q _R and the preset empty pixel coding sequence R _R.

Step S1043, when (Q, R) has been traversed, the operation ends, and (Q _R , R _R ) is the coded sequence of the logical operation result.

Please refer to Fig. 9, Fig. 9 is the sub-step flowchart of obtaining the result coding sequence by logical operation shown in Fig. 4 to Fig. 7, and the sub-step flowchart of adding the result coding sequence to the current subtree code, taking step S1036 as an example, Step S1036 also includes the following sub-steps:

Step _S10361 , set q as the current node code in Q1 or _Q2 , r as the current pixel code in R1 or R2, and set _l = _q.depth .

Step S10362, if q.depth>1, then add q to Q _R , and set q as the next pixel code in Q.

Step S10363, if q.mono=FALSE and q.depth=NN _T +1, add r to R _R and set r as the next pixel code in R.

Step S10364, if q.depth<1, the traversal ends.

Please refer to Fig. 10, Fig. 10 obtains the substep flow chart of the substep flow chart of obtaining the result coding sequence by logic operation shown in Fig. 8, and the reverse color code of current subtree adds the substep flow chart of the result coding sequence, step S1042 also includes the following substeps step:

Step S10421, set q as Q ₁ or Q ₂ or the current node code in Q, r as R ₁ or R ₂ or the current pixel code in R, and set l=q.depth.

Step S10422, if q.depth>1, after inverting q.color, add q to Q _R , and set q to be the next pixel code in Q.

Step S10423, if q.mono=FALSE and q.depth=NN _T +1, then invert r bit by bit and add R _R , and set r as the next pixel code in R.

Step S10424, if q.depth<1, the traversal ends.

It should be noted that in the sub-steps of obtaining the result coded sequence through logical operations in Fig. 6 and Fig. 7 , adding the reverse color code of the current subtree to the result coded sequence also adopts the above-mentioned method steps, which will not be repeated here.

Step S105, decode according to the resulting coding sequence to obtain an expanded binary image of 2 ^N × 2 ^N , intercept the expanded sub-image of the expanded binary image according to multiple binary images before expansion, and obtain the resulting binary image, Wherein, the resulting binary image corresponds to multiple binary images.

Please refer to Table 1 and Table 2 in conjunction. Table 1 shows the running time of the image coding and logical operation method (marked as TQ) proposed by the present invention and the existing image coding and logical operation method (marked as Q). Table 2 The space overhead of TQ and Q is shown. Both TQ and Q are calculated on an image set composed of 40 natural scene pictures, and the size of each picture is 2048×1536. The experimental results are as follows:

Table 1. Running times of TQ and Q

operate TQ average running time (ms) Q average running time (ms) Obtain encoding from binary image 17.7 13.8 logic and 8.0 2.9 logical or 9.4 3.2 XOR 10.8 3.5 collection difference 9.0 3.1 logical NOT 4.1 1.7 Reconstruct binary image from encoding 24.6 9.6

Table 2. Space overhead of TQ and Q

TQ average encoding space overhead (kB) The average encoding space overhead of Q (kB) 569.8 187.2

It can be seen from Table 1 and Table 2 that the image coding and logical operation method proposed by the present invention is obviously superior to the existing image coding and logical operation method in terms of running speed and space overhead.

second embodiment

Please refer to FIG. 11 , which shows a schematic block diagram of an image coding and logical operation device 200 provided by a preferred embodiment of the present invention. The image encoding and logical operation device 200 is applied to the electronic device 100 , and includes: an expansion module 201 , an encoding module 202 , a first logical operation module 203 , a second logical operation module 204 and a decoding module 205 .

The expansion module 201 is used to expand multiple binary images into multiple square binary images respectively.

In the embodiment of the present invention, the expansion module 201 may be used to execute step S101.

The encoding module 202 is configured to generate a truncated quadtree encoding of each square binary image according to node code q and pixel code r of nodes in each square binary image.

In the embodiment of the present invention, the coding module 202 may be used to execute step S102.

The first logical operation module 203 is configured to perform logical operation on the truncated quadtree coding of any two square binary images of the same size to obtain the resulting coding sequence.

In the embodiment of the present invention, the first logical operation module 203 can be used to execute step S103, and can be used to perform logical AND operation, logical OR operation, logical exclusive OR operation and set of any two square binary images of the same size difference operation.

The second logic operation module 204 is configured to perform a second logic operation on the truncated quadtree encoding of any square binary image to obtain a result encoding sequence.

In the embodiment of the present invention, the second logical operation module 204 may be used to execute step S104, and may be used to perform a logical NOT operation on the truncated quadtree coding of any square binary image.

The decoding module 205 is used to decode the resulting coding sequence to obtain a 2 ^N × 2 ^N expanded binary image, intercept the expanded sub-image of the expanded binary image, and obtain the resulting binary image.

In the embodiment of the present invention, the decoding module 205 may be used to execute step S105.

To sum up, the present invention provides a method and device for image coding and logical operation, by respectively expanding multiple binary images into multiple square binary images; Node coding q and pixel coding r, generating the truncated quadtree coding of each square binary image; then performing the first logical operation on the truncated quadtree coding of any two square binary images of the same size, Obtain the result coding sequence; and perform a second logical operation on the truncated quadtree coding of any one of the square binary images to obtain the result coding sequence; finally obtain the expanded 2 ^N × 2 ^N according to the result coding sequence The binary image of the expanded binary image is intercepted to obtain the resulting binary image. In this way, binary image encoding with sufficiently small space overhead can be obtained, and at the same time, the speed of logical operation of binary images is faster.

In the several embodiments provided in this application, it should be understood that the disclosed devices and methods may also be implemented in other ways. The device embodiments described above are only illustrative. For example, the flowcharts and block diagrams in the accompanying drawings show the architecture, functions and possible implementations of devices, methods and computer program products according to multiple embodiments of the present invention. operate. In this regard, each block in a flowchart or block diagram may represent a module, program segment, or part of code that includes one or more Executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks in succession may, in fact, be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved. It should also be noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by a dedicated hardware-based system that performs the specified function or action , or may be implemented by a combination of dedicated hardware and computer instructions.

In addition, each functional module in each embodiment of the present invention can be integrated together to form an independent part, or each module can exist independently, or two or more modules can be integrated to form an independent part.

If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the essence of the technical solution of the present invention or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes. .

It should be noted that in this article, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that there is a relationship between these entities or operations. There is no such actual relationship or order between them. Furthermore, the term "comprises", "comprises" or any other variation thereof is intended to cover a non-exclusive inclusion such that a process, method, article or apparatus comprising a set of elements includes not only those elements, but also includes elements not expressly listed. other elements of or also include elements inherent in such a process, method, article, or device. Without further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of additional identical elements in the process, method, article or apparatus comprising said element.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention. It should be noted that like numerals and letters denote similar items in the following figures, therefore, once an item is defined in one figure, it does not require further definition and explanation in subsequent figures.

Claims (10)

1. An image coding and logical operation method, characterized in that the method comprises: Expand multiple binary images into multiple square binary images respectively; Generate a truncated quadtree code for each square binary image according to the node code q and the pixel code r of the nodes in each of the square binary images; Performing the first logical operation on the truncated quadtree encoding of any two square binary images of the same size, or performing the second logical operation on the truncated quadtree encoding of any one of the square binary images, to obtain Result coding sequence, wherein the first logical operation includes logical AND operation, logical OR operation, logical exclusive OR operation and set difference operation, and the second logical operation includes logical NOT operation; According to the coding sequence of the result, the expanded binary image of 2 ^N × 2 ^N is obtained by decoding, and the sub-image expanded by the expanded binary image is intercepted according to the multiple binary images before expansion, and the resulting binary image is obtained, wherein , the resulting binary image corresponds to multiple binary images; The step of generating the truncated quadtree code of each square binary image according to the node code q and pixel code r of the nodes in each square binary image includes: Construct the quadtree of the square binary image; Starting from the root node of the square binary image, traversing the quadtree in a depth-first manner; If the depth of the currently traversed node is less than or equal to the first standard, set the q.mono, q.color and q.depth of the node code q of the node according to the first rule, and set the node code q corresponding to the node Adding a preset empty basic node coding sequence, wherein the first standard is the difference between the layer N of the square binary image and the truncated layer N ^T , and the truncated layer N ^T is preset , the first rule is: use 1 byte to encode the node, where the highest bit of the byte indicates q.mono, the second highest bit indicates q.color, and the lower six bits give the depth of the node as an integer value q.depth, when the sub-area corresponding to this node is a monochrome area, q.mono=TRUE, otherwise q.mono=FALSE, when q.mono=FALSE, the value of q.color has no effect, when monochrome When all pixels in the area are white, q.mono=TRUE and q.color=TRUE; when all pixels in the monochrome area are black, q.mono=TRUE and q.color=FALSE; If the depth of the currently traversed node is equal to the second standard, and the sub-area corresponding to the node is a monochrome area, set the q.mono, q.color and q.mono, q.color and q. depth, and add the node code q corresponding to the node to the basic node code sequence, and set the pixel code r of the sub-region corresponding to the node, and add the pixel code r to the preset empty basic pixel code sequence, and no longer traverse all child nodes of the node, wherein, the second standard is ^NNT +1, and the second rule is: use 1 byte to encode the node, and the highest bit of the byte Indicates q.mono, the second highest bit indicates q.color, and the lower six bits give the depth q.depth of the node in the form of an integer value, set q.mono=TRUE, when all pixels in the monochrome area are white, q.color=TRUE, when all pixels in the monochrome area are black, q.color=FALSE; After the traversal is completed, the truncated quadtree coding of the square binary image is obtained according to the basic node coding sequence and the basic pixel coding sequence. 2. The image coding and logical operation method according to claim 1, wherein each node code q of the quadtree includes: q.mono, q.color and q.depth, q. mono indicates whether the sub-area in the square binary image corresponding to the node coded by the node code q is a monochrome area, q.color indicates the color of the sub-area corresponding to the node, q .depth represents the depth of the node in the square binary image, when the sub-area is a monochromatic area, q.mono=TRUE, otherwise q.mono=FALSE, when q.mono=TRUE and q. When color=TRUE, all pixels in the monochrome area are white; when q.mono=TRUE and q.color=FALSE, all pixels in the monochrome area are black; when q.mono= When FALSE, the value of q.color has no effect, q.depth=0 of the root node of the quadtree, and the depth of the child node in the quadtree=the depth of its parent node+1; One bit in each pixel code r of the fork tree corresponds to each pixel point in the sub-region, and when the pixel point is white, the corresponding bit in the pixel code r is 1. 3. The image coding and logical operation method according to claim 2, wherein the first logical operation is carried out to the truncated quadtree coding of any two identically sized square binary images to obtain the resulting code sequence of steps, including: Set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), respectively, q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ ; If q ₁ .mono=FALSE and q ₂ .mono=FALSE, then add q ₁ to the preset empty node code sequence Q _R ; If q ₁ .mono=TRUE and q ₁ .color=TRUE, add the current subtree code in (Q ₂ , R ₂ ) into the node code sequence Q _R and the preset empty pixel code sequence R _R , set q ₁ as the next node code in Q ₁ , otherwise add q ₁ to Q _R , and ignore the current subtree code in Q ₂ ; If q ₂ .mono=TRUE and q ₂ .color=TRUE, add the current subtree code in (Q ₁ , R ₁ ) to Q _R and R _R , and set q ₂ to be the code of the next node in Q ₂ , otherwise add q ₂ to Q _R , and ignore the current subtree encoding in Q ₁ ; If q ₁ .depth=NN _T +1, calculate the bit logic AND of r ₁ and r ₂ and add the result to R _R , then set r ₁ to the next pixel code of R ₁ and set r ₂ to the value of R ₂ next pixel encoding; When both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) have been traversed, the operation ends, and (Q _R , R _R ) is the result coded sequence obtained by the logical operation. 4. The image coding and logical operation method according to claim 2, wherein the first logical operation is carried out to the truncated quadtree coding of any two identically sized square binary images to obtain the resulting code sequence of steps, including: Set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), respectively, q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ ; If q ₁ .mono=FALSE and q ₂ .mono=FALSE, then add q ₁ to the preset empty node code sequence Q _R ; If q ₁ .mono=TRUE and q ₁ .color=FALSE, add the current subtree code in (Q ₂ , R ₂ ) into the node code sequence Q _R and the preset empty pixel code sequence R _R , set q ₁ as the next node code in Q ₁ , otherwise add q ₁ to Q _R , and ignore the current subtree code in Q ₂ ; If q ₂ .mono=TRUE and q ₂ .color=FALSE, add the current subtree code in (Q ₁ , R ₁ ) to Q _R and R _R , and set q ₂ to be the code of the next node in Q ₂ , otherwise add q ₂ to Q _R , and ignore the current subtree encoding in Q ₁ ; If q ₁ .depth=NN _T +1, calculate the logical OR of r ₁ and r ₂ , and add the result to R _R , then set r ₁ to the next pixel code of R ₁ and set r ₂ to the value of R ₂ next pixel encoding; When both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) are traversed, the operation ends, and (Q _R , R _R ) is the code sequence of the result of the logic operation. 5. The image coding and logical operation method according to claim 2, wherein the first logical operation is carried out to any two truncated quadtree codings of the square binary images having the same size to obtain the resulting code sequence of steps, including: Set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), respectively, q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ ; If q ₁ .mono=FALSE and q ₂ .mono=FALSE, then add q ₁ to the preset empty node code sequence Q _R ; If q ₁ .mono=TRUE and q ₁ .color=TRUE, add the inverse color coding of the current subtree in (Q ₂ , R ₂ ) to the node coding sequence Q _R and the preset empty pixel coding sequence In R _R , otherwise add the encoding of the current subtree in Q ₂ to Q _R and R _R , and set q ₁ to be the next node encoding in Q ₁ ; If q ₂ .mono=TRUE and q ₂ .color=TRUE, add the inverse color coding of the current subtree in (Q ₁ , R ₁ ) to Q _R and R _R , otherwise add the current subtree in Q ₁ Add the code of Q _R and R _R , set q ₂ as the code of the next node in Q ₂ ; If q ₁ .depth=NN _T +1, calculate the logical exclusive OR of r ₁ and r ₂ , and add the result to R _R , then set r ₁ to the next pixel code of R ₁ and set r ₂ to R ₂ The next pixel encoding of ; When both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) are traversed, the operation ends, and (Q _R , R _R ) is the code sequence of the result of the logic operation. 6. The image coding and logical operation method according to claim 2, wherein the first logical operation is carried out to the truncated quadtree coding of any two square binary images of the same size to obtain the resulting code sequence of steps, including: Set the truncated quadtree codes of any two square binary images of the same size as (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ), respectively, q ₁ is the first node code in Q ₁ , r ₁ codes the first pixel in R ₁ , q ₂ codes the first node in Q ₂ , r ₂ codes the first pixel in R ₂ ; If q ₁ .mono=FALSE and q ₂ .mono=FALSE, then add q ₁ to the preset empty node code sequence Q _R ; If q ₁ .mono=TRUE and q ₁ .color=TRUE, add the inverse color coding of the current subtree in (Q ₂ , R ₂ ) to the node coding sequence Q _R and the preset empty pixel coding sequence In R _R , set q ₁ as the next pixel code in Q ₁ , otherwise add q ₁ to Q _R , and ignore the current subtree code in Q ₂ ; If q ₂ .mono＝TRUE and q ₂ .color＝TRUE, then ignore the current subtree code in Q ₁ , after inverting q ₂ .color, add q ₂ to Q _R , otherwise add (Q ₁ , R ₁ ) in the current subtree coding into Q _R and _RR , set q ₂ as the next pixel coding in Q ₂ ; If q ₁ .depth=NN _T +1, then calculate the set difference between r ₁ and r ₂ , that is, perform a logical AND operation with r ₁ after bit-by-bit inversion of r ₂ , add the result to R _R , and then set r ₁ Encode the next pixel for R ₁ and set r ₂ to encode the next pixel for R ₂ ; When both (Q ₁ , R ₁ ) and (Q ₂ , R ₂ ) are traversed, the operation ends, and (Q _R , R _R ) is the code sequence of the result of the logic operation. 7. image coding and logical operation method as claimed in claim 2, is characterized in that, described carries out the second logical operation to the truncated quadtree coding of any one described square binary image, obtains the step of result coding sequence ,include: The truncated quadtree encoding of any one of the square binary images is set as (Q, R), q is the first node encoding in Q, and r is the first pixel encoding in R; Add the reverse color coding of the current subtree in (Q, R) to the preset empty node coding sequence Q _R and the preset empty pixel coding sequence R _R ; When (Q, R) is traversed, the operation ends, and (Q, R) is the coded sequence of the result of the logic operation. 8. The image coding and logical operation method according to any one of claims 3-6, characterized in that, adding the current subtree coding in (Q ₁ , R ₁ ) or (Q ₂ , R ₂ ) Steps in Q _R and R _R , including: Let q be the current described node code in Q ₁ or Q ₂ , r be the current described pixel code in R ₁ or R ₂ , put l=q.depth; If q.depth>l, then add q to Q _R , and set q to be the next pixel code in Q; If q.mono=FALSE and q.depth=NN _T +1, then add r to R _R , and set r to be the next pixel code in R; If q.depth<l, the traversal ends. 9. The image coding and logical operation method according to any one of claims 5-7, characterized in that, among (Q ₁ , R ₁ ) or (Q ₂ , R ₂ ) or (Q, R) The inverse color coding of the current subtree joins the steps in Q _R and R _R , including: Let q be Q ₁ or Q ₂ or the current described node code in Q, r be R ₁ or R ₂ or the current described pixel code in R, set l=q.depth; If q.depth>l, after inverting q.color, add q to Q _R , and set q to be the next pixel code in Q; If q.mono=FALSE and q.depth=NN _T +1, then invert r bit by bit and add R _R , set r as the next pixel code in R; If q.depth<l, the traversal ends. 10. An image coding and logical operation device, characterized in that it is applied to electronic equipment, and the device includes: The expansion module is used to expand multiple binary images into multiple square binary images respectively; An encoding module, configured to generate a truncated quadtree encoding of each of the square binary images according to the node code q and the pixel code r of the nodes in each of the square binary images; A logical operation module, configured to perform a first logical operation on the truncated quadtree encoding of any two square binary images of the same size, or perform a first logical operation on the truncated quadtree encoding of any one of the square binary images The second logical operation is to obtain the result coded sequence, wherein the first logical operation includes a logical AND operation, a logical OR operation, a logical XOR operation, and a set difference operation, and the second logical operation includes a logical NOT operation; The decoding module is used to decode and obtain the expanded binary image of 2 ^N × 2 ^N according to the result encoding sequence, intercept the expanded sub-image of the expanded binary image according to the multiple binary images before the expansion, and obtain the result A binary image, wherein the resulting binary image corresponds to multiple binary images; The coding module executes the method of generating the truncated quadtree coding of each square binary image according to the node code q and the pixel code r of the nodes in each square binary image, including: Construct the quadtree of the square binary image; Starting from the root node of the square binary image, traversing the quadtree in a depth-first manner; If the depth of the currently traversed node is less than or equal to the first standard, set the q.mono, q.color and q.depth of the node code q of the node according to the first rule, and set the node code q corresponding to the node Adding a preset empty basic node coding sequence, wherein the first standard is the difference between the layer N of the square binary image and the truncated layer N ^T , and the truncated layer N ^T is preset , the first rule is: use 1 byte to encode the node, where the highest bit of the byte indicates q.mono, the second highest bit indicates q.color, and the lower six bits give the depth of the node as an integer value q.depth, when the sub-area corresponding to this node is a monochrome area, q.mono=TRUE, otherwise q.mono=FALSE, when q.mono=FALSE, the value of q.color has no effect, when monochrome When all pixels in the area are white, q.mono=TRUE and q.color=TRUE; when all pixels in the monochrome area are black, q.mono=TRUE and q.color=FALSE; If the depth of the currently traversed node is equal to the second standard, and the sub-area corresponding to the node is a monochrome area, set the q.mono, q.color and q.mono, q.color and q. depth, and add the node code q corresponding to the node to the basic node code sequence, and set the pixel code r of the sub-region corresponding to the node, and add the pixel code r to the preset empty basic pixel code sequence, and no longer traverse all child nodes of the node, wherein, the second standard is ^NNT +1, and the second rule is: use 1 byte to encode the node, and the highest bit of the byte Indicates q.mono, the second highest bit indicates q.color, and the lower six bits give the depth q.depth of the node in the form of an integer value, set q.mono=TRUE, when all pixels in the monochrome area are white, q.color=TRUE, when all pixels in the monochrome area are black, q.color=FALSE; After the traversal is completed, the truncated quadtree coding of the square binary image is obtained according to the basic node coding sequence and the basic pixel coding sequence.