An information processing method and system based on honeycomb pixel structure

Abstract

The present invention discloses an information processing method and system based on a honeycomb pixel structure. The method includes: an encoding step, encoding a positioning pattern and input information to form a coding matrix based on regular hexagonal pixels, wherein the coding matrix includes a positioning pattern region and a valid information region; a masking step, performing an exclusive-OR operation on at least the valid information region of the coding matrix with different masking matrices to form different honeycomb codes, and comparing the different honeycomb codes to obtain an optimal honeycomb code; the masking matrix is ​​also a matrix based on hexagonal pixels; and a decoding step, decoding the optimal honeycomb code to obtain valid information. The present invention can achieve fast, accurate, and efficient encoding and decoding of honeycomb codes, providing a new option for the application of image coding technology.

Description

Technical Field

[0001] The present application relates to the field of optical chip technology, and in particular to an information processing method and system based on a honeycomb pixel structure. Background Art

[0002] Image coding technology converts raw digital signals into image signals that are easily recognized by cameras. This technology can store information in images, and its recognition is fast, accurate, and efficient. With the popularity of smartphones, image coding technology has found widespread application in people's daily lives, such as barcodes on products and QR codes for quick payment.

[0003] The application of regular hexagonal pixel arrays in image coding is a relatively new and promising field. Research has shown that retroreflective structures can produce regular hexagonal array patterns with a honeycomb structure. This is achieved by controlling the microscopic surface of a specific location within the retroreflective structure (retroreflection, also known as retroreflection, is a reflection method in which light is reflected back in a direction close to the incident light). This reflects the reflected light from that area away from the receiving surface, forming a regular hexagonal pixel array pattern (hereinafter referred to as a honeycomb code) on the receiving surface. Due to its unique geometric properties and advantages, cellular codes have shown considerable value in image coding, mainly reflected in the following aspects:

[0004] High space utilization: The regular hexagonal pixel array can fill the space more tightly, reducing the gaps between pixels, thereby improving image resolution and clarity. This efficient space utilization helps retain more image details during the encoding process;

[0005] Good symmetry: A regular hexagon has six equal sides and six equal angles. This high degree of symmetry helps simplify the encoding algorithm and reduce computational complexity. Symmetry also helps reduce filtering computation and improve encoding efficiency.

[0006] Good visual effects: Since the arrangement of the regular hexagonal pixel array is closer to the natural imaging method of the human eye and optical system, it may present higher visual resolution and more realistic image effects.

[0007] However, QR codes are based on rectangular pixel arrays, while cellular codes are based on regular hexagonal pixel arrays. The two differ in topological structure. Therefore, designing encoding and decoding algorithms that take advantage of the characteristics of regular hexagonal pixel arrays to optimize the encoding and decoding efficiency and accuracy of cellular codes is of great practical significance. Summary of the Invention

[0008] The present invention provides an information processing method and system based on a honeycomb pixel structure to optimize the encoding and decoding efficiency and accuracy of cellular codes.

[0009] To achieve the above object, the present invention adopts the following technical solutions:

[0010] An information processing method based on a honeycomb pixel structure, the method comprising:

[0011] an encoding step of encoding the positioning pattern and the input information to form a coding matrix based on regular hexagonal pixels, wherein the coding matrix includes a positioning pattern area and a valid information area;

[0012] a masking step of performing an exclusive-OR operation on at least the valid information region of the encoding matrix and different mask matrices to form different cellular codes, and comparing the different cellular codes to obtain an optimal cellular code; the mask matrix is ​​also a matrix based on hexagonal pixels;

[0013] The decoding step is to decode the optimal cellular code to obtain valid information.

[0014] Preferably, the cellular code is composed of regular hexagonal pixels having a first grayscale value or a second grayscale value that are closely arranged, wherein in the same column, the center point of each regular hexagonal pixel is located on the same straight line; in adjacent columns, each regular hexagonal pixel is located between two regular hexagonal pixels in its adjacent column.

[0015] Preferably, the scale of the mask matrix is ​​the same as the scale of the effective information area, and during the operation, the effective information area of ​​the encoding matrix is ​​XORed with different mask matrices to form different cellular codes; or, the scale of the mask matrix is ​​the same as the scale of the encoding matrix, the mask matrix includes a positioning pattern mask area and a valid information mask area, and the positioning pattern mask area and the positioning pattern area have exactly the same pixel arrangement.

[0016] Preferably, the positioning pattern includes at least two positioning symbols, and the positioning symbols are both placed in the positioning pattern area of ​​the encoding matrix.

[0017] Preferably, the input information is character string information. After the corresponding error correction information is calculated, the error correction information is placed after the input information and binarized to form valid information.

[0018] Preferably, during encoding, a write matrix is ​​formed in the central area of ​​the valid information area, and valid information is written in order from small to large in column order. Each bit of binary valid information is an element of the write matrix. When the current row of the write matrix is ​​full of valid information, valid information is continued to be written from the first bit of the next row, and the remaining elements of the last row are padded with 0.

[0019] Preferably, performing an XOR operation on the encoding matrix and different mask matrices to form different cellular codes, and comparing the different cellular codes to obtain the optimal cellular code specifically includes:

[0020] performing an XOR operation on the encoding matrix and different mask matrices to form different cellular codes;

[0021] Setting several small penalty matrices as convolution kernels; wherein the convolution kernels change according to the parity of the current row number, and setting corresponding penalty values ​​according to the error type of the penalty matrix;

[0022] The convolution kernel is used to perform a convolution operation on the valid information area of ​​each cellular code. During the operation, each time a small penalty matrix appears, the corresponding penalty value is added to the penalty value of the cellular code, thereby obtaining the final penalty value of all cellular codes.

[0023] The cellular code with the lowest penalty value among all cellular codes is selected as the optimal cellular code, and the pattern information of the mask matrix is ​​added to the specified position of the positioning pattern area of ​​the optimal cellular code.

[0024] Preferably, assuming that the specific convolution kernel is F when in an odd row, then when in an even row, the elements of the odd or even rows of F are staggered according to the scale of the convolution kernel;

[0025] The convolution kernel includes a first type of penalty pixel matrix corresponding to the positioning pattern and a second type of penalty pixel matrix corresponding to consecutive identical pixels of different scales; the penalty score of the convolution kernel corresponding to the first type of penalty pixel matrix is ​​much higher than the penalty score of the convolution kernel corresponding to the second type of penalty pixel matrix.

[0026] Preferably, during decoding, the process specifically includes:

[0027] Using the positioning pattern to identify the optimal cellular code, and identifying the positioning pattern area and the valid information area;

[0028] Reading pattern information of a mask matrix from the positioning pattern area;

[0029] Selecting a mask matrix according to pattern information of the mask matrix, and performing an inverse mask operation on the valid information area according to the mask matrix to obtain binary information;

[0030] The binary information is divided into blocks, and the error correction algorithm is used to restore the string information to obtain valid information.

[0031] An embodiment of the present invention further provides an information processing system based on a honeycomb pixel structure, comprising:

[0032] An encoding unit, configured to encode the positioning pattern and input information to form an encoding matrix based on regular hexagonal pixels, wherein the encoding matrix includes a positioning pattern area and a valid information area;

[0033] a mask unit, configured to perform an exclusive-OR operation on at least a valid information region of the encoding matrix and different mask matrices to form different cellular codes, and compare the different cellular codes to obtain an optimal cellular code; the mask matrix is ​​also a matrix based on hexagonal pixels;

[0034] A decoding unit is used to decode the optimal cellular code to obtain valid information.

[0035] It should be noted that the method and system of this embodiment are applicable to, but not limited to, cellular codes generated by retroreflective structures, and can achieve fast, accurate, and efficient encoding and decoding of cellular codes, providing a new option for the application of image coding technology. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Figure 1 A schematic flow chart of an information processing method based on a honeycomb pixel structure provided by the first embodiment of the present invention;

[0037] Figure 2 A schematic diagram of a positioning graphic area provided by an embodiment of the present invention;

[0038] Figure 3-10 A schematic diagram of eight mask patterns corresponding to eight different mask matrices provided in one embodiment of the present invention;

[0039] Figure 11 A schematic diagram of an optimal cellular code pattern provided by an embodiment of the present invention;

[0040] Figure 12 A schematic diagram of a matrix of an optimal cellular code according to an embodiment of the present invention;

[0041] Figure 13 A schematic diagram of decoding based on a honeycomb pixel structure provided by the first embodiment of the present invention;

[0042] Figure 14 A schematic structural diagram of an information processing system based on a honeycomb pixel structure provided in the second embodiment. DETAILED DESCRIPTION

[0043] In order to make the purpose, technical solutions and advantages of this application more clearly understood, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0044] The present application provides an information processing method and system based on a honeycomb pixel structure, which can be used to generate and decode honeycomb codes.

[0045] Furthermore, the information processing method based on a honeycomb pixel structure provided in this application does not limit its execution subject. Optionally, the execution subject of the information processing method based on a honeycomb pixel structure provided in this application may be a cellular code processing terminal. Specifically, the execution subject of the information processing method based on a honeycomb pixel structure provided in this application may be one or more processors in the cellular code processing terminal.

[0046] Example 1

[0047] This embodiment proposes an information processing method based on a honeycomb pixel structure, which can encode specific information into a coding matrix and form a honeycomb code. The honeycomb code can also be decoded by a specific algorithm to achieve information storage and retrieval. Figure 1 , the method comprising:

[0048] S101, an encoding step, encoding the positioning pattern and input information to form an encoding matrix based on regular hexagonal pixels, wherein the encoding matrix includes a positioning pattern area and a valid information area.

[0049] In this embodiment, the encoding matrix is ​​formed based on regular hexagonal pixels and is rationally divided into a positioning pattern area and an effective information area. The positioning pattern can be placed at the top of the encoding matrix to form the positioning pattern area, and the effective information can be placed at the bottom of the encoding matrix to form the effective information area.

[0050] For example, Figure 2 As shown, the number of rows in the positioning pattern area is 10, and the number of columns in the positioning pattern area is the same as that in the effective information area, but the black and white pixels cannot overlap with each other, otherwise the number of columns needs to be readjusted. The positioning pattern area ends at Figure 2 The valid information area starts at line 11.

[0051] Of course, it should be noted that the positions of the positioning pattern and the effective information can also be set according to actual needs, and these solutions are all within the protection scope of the present invention.

[0052] In this embodiment, the positioning pattern includes at least two positioning symbols, and the positioning symbols are both placed in the positioning pattern area of ​​the encoding matrix.

[0053] Typically, one locator indicates a positioning start point, and the other locator indicates a positioning end point.

[0054] like Figure 2As shown, in one implementation, the locator may be composed of three hexagonal patterns in which white, black, white, first grayscale, and second grayscale appear alternately. Of course, it may also be other shapes, which is not specifically limited in the present invention.

[0055] In this embodiment, the input information may be text, numbers, website addresses, etc. After the corresponding error correction information is calculated, the error correction information is placed after the input information and binarized to obtain valid information.

[0056] In this embodiment, during encoding, a write matrix is ​​formed in the central area of ​​the valid information area, and valid information is written into the write matrix in column order from small to large. Each bit of binary valid information is an element of the write matrix. When the current row of the write matrix is ​​full of valid information, valid information is continued to be written from the first bit of the next row, and the remaining elements of the last row are padded with 0.

[0057] In this embodiment, to ensure that the write matrix I is centered in the effective information region, the number of rows and columns of the write matrix I is assumed to be m and n, respectively. Then, the number of rows and columns corresponding to the effective information region is m+a and n+b, respectively. Here, a and b can be, for example, 2, 3, 5, etc., depending on the size of the effective information region. Furthermore, a and b can be the same or different, and this invention does not impose any specific limitations thereon.

[0058] S102: performing an exclusive OR operation on at least the effective information region of the coding matrix and different mask matrices to form different cellular codes, and comparing the different cellular codes to obtain an optimal cellular code.

[0059] In this embodiment, the mask matrix is ​​also a matrix based on hexagonal pixels. The mask matrix is ​​introduced to reduce the pixel recognition error caused by a large number of consecutive identical pixels in the effective information area and the positioning error caused by the same pattern as the positioning graphic, so that the effective information area will not have a large area of ​​continuous identical pixels.

[0060] In this embodiment, the size of the mask matrix may be the same as the size of the effective information area. During the operation, the effective information area of ​​the encoding matrix is ​​XORed with different mask matrices to form different cellular codes.

[0061] Alternatively, the scale of the mask matrix may be the same as that of the encoding matrix, the mask matrix includes a locater pattern mask area and a valid information mask area, and the locater pattern mask area and the locater pattern area have exactly the same pixel arrangement.

[0062] like Figures 3 to 10 As shown, Figures 3 to 10 The eight mask patterns generated by the eight mask matrices are shown in turn. Let the corresponding matrix be identified as Of course, it should be noted that the number of mask matrices can be set according to actual needs and is not limited to 8 in this embodiment. These solutions are all within the protection scope of the present invention.

[0063] In this embodiment, firstly, the eight mask matrices and the elements at corresponding positions of the encoding matrix are subjected to XOR operation to obtain the matrix :

[0064] (1)

[0065] According to the matrix H i That is, the corresponding 8 cellular codes can be obtained.

[0066] Then, the eight cellular codes are compared to obtain the optimal cellular code.

[0067] In this embodiment, the difference between the 8 cellular codes lies in the size of the recognition error and the positioning error. In order to quantify the size, a penalty value is introduced. The penalty value comes from the penalty score corresponding to the result of convolution of a specific convolution kernel and the effective information area. The accumulation of:

[0068] (2)

[0069] in, is the number of specific convolution kernels. Due to the special nature of regular hexagonal array pixels, the specific convolution kernel should change according to the odd or even row number of the current operation. For example, if the specific convolution kernel is F when in an odd row, then when in an even row, the elements of F in the odd or even rows are shifted according to the scale of the convolution kernel.

[0070] Furthermore, penalty values ​​for penalty pixel matrices vary depending on the error type. Specifically, the convolution kernel includes a first penalty pixel matrix corresponding to the locate pattern and a second penalty pixel matrix corresponding to consecutive identical pixels of varying scales. The penalty score for the convolution kernel corresponding to the first penalty pixel matrix is ​​significantly higher than the penalty score for the convolution kernel corresponding to the second penalty pixel matrix.

[0071] In this embodiment, after calculating Then, the cellular code with the lowest penalty value is selected, corresponding to the mask mode, as the mask mode of the optimal cellular code. The pattern information of the corresponding mask mode is filled in the specific position of the positioning pattern area. At this point, the encoding work is completed and the optimal cellular code is obtained, such as Figure 11 and Figure 12 As shown, here it is set to use Figure 9 The mask matrix shown generates the optimal cellular code.

[0072] S103, a decoding step, decoding the optimal cellular code to obtain valid information.

[0073] like Figure 13 As shown, in this embodiment, when applied, after the camera captures the cellular code image, the processor processes it to obtain a cellular code pixel matrix, and the cellular code pixel matrix is ​​decoded by an algorithm to obtain effective information.

[0074] Specifically, when decoding:

[0075] First, the optimal cellular code is identified using the positioning pattern, and the positioning pattern area and the valid information area are identified;

[0076] Then, reading the pattern information of the mask matrix from the positioning pattern area;

[0077] Next, a mask matrix is ​​selected according to the pattern information of the mask matrix, and an inverse mask operation is performed on the matrix corresponding to the valid information area according to the mask matrix to obtain binary information;

[0078] Finally, the binary information is divided into blocks, and the error correction algorithm is used to restore the string information to obtain valid information.

[0079] The positioning pattern includes two types: a hexagonal pattern containing a locator and a mask matrix pattern. The hexagonal pattern containing the locator is used to determine whether the cellular code needs to be rotated and can be used to define the range of the cellular code positioning pattern area and the valid information area; the mask matrix pattern is used to determine the mask matrix used by the cellular code.

[0080] The mask matrix of the cellular code is determined by encoding the signal in a mask manner at a specific position in the positioning pattern area, that is, Figure 10 The corresponding mask matrix is ​​used to perform inverse masking on the valid information area to obtain the encoded binary information.

[0081] (3)

[0082] in Indicates the number corresponding to the current mask matrix.

[0083] This embodiment uses 8-bit binary to represent one byte of information. It needs to be divided into several 8-bit binary strings, with black pixels representing 0 and white pixels representing 1. The termination information is set to "1110 1100 0001 0001", for example. The binary string (ie, valid information) is converted into decimal to obtain the original information.

[0084] In this embodiment, as described in step S101, in order to reduce the impact of errors caused by inaccurate recognition and cellular code defects on decoding, the effective information of this embodiment includes input information and error correction information. The input information is the truly important information, and the error correction information is used to correct errors that occur during the transmission of the cellular code. Assuming that the length of the input information is β and the length of the error correction information is γ, then when decoding to obtain effective information After that, it also includes:

[0085] Constructing polynomials :

[0086] (4)

[0087] in, The value of depends on the length of the error correction information γ, is an empirical constant, usually taken as 2, is the number of convolution kernels;

[0088] by right The coefficients of each long division operation; wherein, the long division operation involves the Galois field calculation rule, addition and subtraction are the exclusive OR operation of the Galois field value, and multiplication is addition of exponents;

[0089] Determine whether the remainder of the long division operation is 0;

[0090] If yes, it means the cellular code is read correctly and valid information is read. The first β elements in are used as input information;

[0091] If not, then based on the matrix For error correction, matrix The number of rows is equal to the error correction information length, and the number of columns is equal to the effective information Length:

[0092] (5) According to the matrix and effective information Calculating vectors :

[0093] (6)

[0094] Among them, due to a read error, It must be a non-zero vector. Transform into a matrix ,matrix The number of rows is floor(γ / 2), floor(.) represents the floor function, the number of columns is one more than the number of rows, the matrix The sum of the row and column corresponding to the position of the element is equal to The corresponding position of the elements;

[0095] Pair Matrix Use Gaussian elimination method to eliminate the elements and get the simplest row echelon form and then take out the matrix The elements of the last column are arranged in reverse order and added with element 1, which are used as coefficients of the equation in turn. The highest degree of the coefficient of the equation is equal to the matrix Rank The solution of the equation is Index , Sort descending, minus the length This is where the read error occurred ,Will middle After removing the elements at position , the matrix middle After removing the elements of the row, we get , recalculate :

[0096] (7)

[0097] Set up a system of linear equations to solve for the correct value at the error location :

[0098] (8)

[0099] The solution is Afterwards, The element at position is replaced by , get the valid information after error correction , and extract the valid information after error correction The first β elements of are used as input information.

[0100] In summary, this embodiment is applicable to, but not limited to, cellular codes generated by a retroreflective structure, and can implement fast, accurate, and efficient encoding and decoding of cellular codes, providing a new option for the application of image coding technology.

[0101] Example 2

[0102] See also Figure 14 This embodiment further provides an information processing system based on a honeycomb pixel structure, which includes:

[0103] The encoding unit 210 is used to encode the positioning pattern and the input information to form a coding matrix based on regular hexagonal pixels, wherein the coding matrix includes a positioning pattern area and a valid information area;

[0104] The mask unit 220 is configured to perform an exclusive-OR operation on at least the valid information region of the encoding matrix and different mask matrices to form different cellular codes, and compare the different cellular codes to obtain an optimal cellular code; the mask matrix is ​​also a matrix based on hexagonal pixels;

[0105] The decoding unit 230 is configured to decode the optimal cellular code to obtain valid information.

[0106] The third embodiment of the present invention also provides an information processing device based on a honeycomb pixel structure, which includes a memory and a processor, wherein the memory stores a computer program, and the computer program can be executed by the processor to implement the information processing method based on the honeycomb pixel structure as described above.

[0107] The fourth embodiment of the present invention further provides a computer-readable storage medium storing a computer program, wherein the computer program can be executed by a processor of a device where the computer-readable storage medium is located to implement the above-mentioned information processing method based on a honeycomb pixel structure.

[0108] For example, the computer programs described in the third and fourth embodiments of the present invention may be divided into one or more modules, which are stored in the memory and executed by the processor to implement the present invention. The one or more modules may be a series of computer program instruction segments capable of performing specific functions, which describe the execution process of the computer program in the error correction device. For example, the system described in the second embodiment of the present invention may be used.

[0109] The processor may be a central processing unit (CPU), or other general-purpose processors, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the generation method, and utilizes various interfaces and lines to connect the various parts of the information processing method.

[0110] The memory can be used to store the computer programs and / or modules. The processor implements various functions of an error correction method by running or executing the computer programs and / or modules stored in the memory and accessing data stored in the memory. The memory may primarily include a program storage area and a data storage area. The program storage area may store an operating system and at least one application required for a function (such as a sound playback function or a text conversion function); the data storage area may store data generated based on the use of the mobile phone (such as audio data, text message data, etc.). In addition, the memory may include high-speed random access memory and non-volatile memory, such as a hard disk, internal memory, a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, at least one disk storage device, a flash memory device, or other volatile solid-state storage device.

[0111] If the implemented module is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present invention can implement all or part of the process steps in the above-mentioned method embodiments by using a computer program to instruct the relevant hardware. The computer program can be stored in a computer-readable storage medium. When executed by a processor, the computer program can implement the steps of each of the above-mentioned method embodiments. The computer program includes computer program code, which can be in source code form, object code form, executable file, or some intermediate form. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal, and software distribution medium. It should be noted that the content of the computer-readable medium can be appropriately increased or decreased based on the requirements of legislation and patent practice in a jurisdiction. For example, in some jurisdictions, based on legislation and patent practice, computer-readable media does not include electric carrier signals and telecommunication signals.

[0112] It should be noted that the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed across multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment. In addition, in the drawings of the device embodiments provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, which may be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art can understand and implement the present invention without inventive effort.

[0113] The above are only preferred embodiments of the present invention. The protection scope of the present invention is not limited to the above embodiments. All technical solutions under the concept of the present invention belong to the protection scope of the present invention.

Claims

1. An information processing method based on a honeycomb pixel structure, wherein the honeycomb code is generated by a retroreflective structure, characterized in that: The method comprises: The encoding step encodes the positioning pattern and input information to form a coding matrix based on regular hexagonal pixels. The coding matrix includes a positioning pattern area and a valid information area. The positioning pattern includes two types of locators: a locator and a mask matrix pattern. There are two locators: one for indicating the positioning starting point and the other for indicating the positioning end point, each consisting of a hexagonal pattern with three white and black circles. The mask matrix pattern is set between the two locators. The locator is used to determine whether the cellular code needs to be rotated. The masking step includes performing an exclusive-OR operation on at least the effective information area of ​​the coding matrix with different mask matrices to form different cellular codes, and comparing the different cellular codes to obtain an optimal cellular code; the mask matrix is ​​also a matrix based on hexagonal pixels; specifically, the step includes: performing an exclusive-OR operation on the coding matrix with different mask matrices to form different cellular codes; setting a plurality of small penalty matrices as convolution kernels; wherein the convolution kernel changes according to the parity of the current row number, and setting a corresponding penalty value according to the error type of the penalty matrix; performing a convolution operation on the effective information area of ​​each cellular code according to the convolution kernel, and during the operation, each time a small penalty matrix appears, the corresponding penalty value is accumulated to the penalty value of the cellular code, thereby obtaining a final penalty value for all cellular codes; selecting the cellular code with the lowest penalty value among all cellular codes as the optimal cellular code, and adding pattern information of the mask matrix to a specified position in the positioning pattern area of ​​the optimal cellular code; assuming that the specific convolution kernel is F when in an odd row, then when in an even row, the elements of the odd or even rows of F are staggered according to the scale of the convolution kernel; The decoding step is to decode the optimal cellular code to obtain valid information.

2. The information processing method based on honeycomb pixel structure according to claim 1, characterized in that: The cellular code is composed of regular hexagonal pixels having a first grayscale value or a second grayscale value that are closely arranged, wherein in the same column, the center point of each regular hexagonal pixel is located on the same straight line; in adjacent columns, each regular hexagonal pixel is located between two regular hexagonal pixels in its adjacent column.

3. The information processing method based on honeycomb pixel structure according to claim 1, characterized in that: The size of the mask matrix is ​​the same as the size of the effective information area. During operation, the effective information area of ​​the encoding matrix is ​​XORed with different mask matrices to form different cellular codes. Alternatively, the size of the mask matrix is ​​the same as the size of the encoding matrix, the mask matrix includes a positioning pattern mask area and an effective information mask area. During operation, the effective information area of ​​the encoding matrix is ​​XORed with the effective information mask areas of different mask matrices to form different cellular codes, and the positioning pattern mask area has exactly the same pixel arrangement as the positioning pattern area.

4. The information processing method based on honeycomb pixel structure according to claim 1, characterized in that: The input information is character string information. After the corresponding error correction information is calculated, the error correction information is placed after the input information and binarized to form valid information.

5. The information processing method based on honeycomb pixel structure according to claim 4, characterized in that: During encoding, a write matrix is ​​formed in the central area of ​​the valid information area, and valid information is written in column order from small to large. Each bit of binary valid information is an element of the write matrix. When the write matrix is ​​full of valid information in this row, valid information is continued to be written from the first bit of the next row, and the remaining elements of the last row are padded with 0.

6. The information processing method based on honeycomb pixel structure according to claim 1, characterized in that: The convolution kernel includes a first type of penalty pixel matrix corresponding to the positioning pattern and a second type of penalty pixel matrix corresponding to consecutive identical pixels of different scales; the penalty score of the convolution kernel corresponding to the first type of penalty pixel matrix is ​​higher than the penalty score of the convolution kernel corresponding to the second type of penalty pixel matrix.

7. The information processing method based on honeycomb pixel structure according to claim 1, characterized in that: When decoding, it specifically includes: Using the positioning pattern to identify the optimal cellular code, and identifying the positioning pattern area and the valid information area; Reading pattern information of a mask matrix from the positioning pattern area; Selecting a mask matrix according to pattern information of the mask matrix, and performing an inverse mask operation on the valid information area according to the mask matrix to obtain binary information; The binary information is divided into blocks, and the error correction algorithm is used to restore the string information to obtain valid information.

8. An information processing system based on a honeycomb pixel structure, wherein the honeycomb code is generated by a retroreflective structure, characterized in that: include: An encoding unit is configured to encode the positioning pattern and input information to form a coding matrix based on regular hexagonal pixels, wherein the coding matrix includes a positioning pattern area and a valid information area; the positioning pattern includes two types of pattern information: a locator and a mask matrix; There are two locators, one for indicating the starting point of positioning and the other for indicating the end point of positioning. They are composed of three white and black circles of hexagonal patterns. The pattern information of the mask matrix is ​​set between the two locators. The locator is used to determine whether the cellular code needs to be rotated. A masking unit is configured to perform an exclusive-OR operation on at least the effective information region of the coding matrix with different mask matrices to form different cellular codes, and compare the different cellular codes to obtain an optimal cellular code; the masking matrix is ​​also a matrix based on hexagonal pixels; wherein the masking unit is specifically configured to: perform an exclusive-OR operation on the coding matrix with different masking matrices to form different cellular codes; set a plurality of small penalty matrices as convolution kernels; wherein the convolution kernels vary according to the parity of the current row number, and corresponding penalty values ​​are set according to the error type of the penalty matrix; perform a convolution operation on the effective information region of each cellular code according to the convolution kernel, and during the operation, each time a small penalty matrix appears, the corresponding penalty value is accumulated to the penalty value of the cellular code, thereby obtaining a final penalty value for all cellular codes; select the cellular code with the lowest penalty value among all cellular codes as the optimal cellular code, and add pattern information of the masking matrix to a specified position in the positioning pattern area of ​​the optimal cellular code; assuming that the specific convolution kernel is F when in an odd row, then when in an even row, the elements of the odd or even rows of F are staggered according to the scale of the convolution kernel; A decoding unit is used to decode the optimal cellular code to obtain valid information.

Images