Information processing method and system based on cellular pixel structure

Abstract

The invention discloses an information processing method and system based on a honeycomb pixel structure, and the method comprises the steps: an encoding step: encoding a positioning graph and input information to form an encoding matrix based on regular hexagonal pixels, the encoding matrix comprising a positioning graph region and an effective information region; a masking step, at least performing XOR operation on the effective information area of the coding matrix and different mask matrixes 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; and a decoding step: decoding the optimal cellular code to obtain effective information. According to the method, the cellular codes can be quickly, accurately and efficiently coded and decoded, and a new choice is provided for application of an 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: 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; 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. 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.

[0004] 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

[0005] 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.

[0006] To achieve the above object, the present invention adopts the following technical solutions: An information processing method based on a honeycomb pixel structure, the method comprising: An encoding step of encoding a positioning pattern and input information to form an encoding matrix based on regular hexagon pixels, the encoding matrix including a positioning pattern area and a valid information area; A masking step of performing an exclusive OR operation on at least the valid information area of the encoding 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 hexagon pixels; A decoding step of decoding the optimal honeycomb code to obtain valid information.

[0007] Preferably, the honeycomb code is composed of regular hexagon pixels with a first gray value or a second gray value closely arranged. Among them, in the same column, the center points of each regular hexagon pixel are located on the same straight line; in adjacent columns, each regular hexagon pixel is located between two regular hexagon pixels in its adjacent column.

[0008] Preferably, the scale of the masking matrix is the same as the scale of the valid information area. During the operation, the valid information area of the encoding matrix is subjected to an exclusive OR operation with different masking matrices to form different honeycomb codes; or, the scale of the masking matrix is the same as the scale of the encoding matrix, and the masking matrix includes a positioning pattern masking area and a valid information masking area, and the positioning pattern masking area has exactly the same pixel arrangement as the positioning pattern area.

[0009] Preferably, the positioning pattern includes at least two positioning marks, and the positioning marks are all placed in the positioning pattern area of the encoding matrix.

[0010] Preferably, the input information is string information. After calculating the corresponding error correction information, the error correction information is placed after the input information and binary-coded to form valid information.

[0011] Preferably, during encoding, a writing matrix is formed in the central area of the valid information area, and the valid information is written in ascending order by column. Each binary bit of the valid information is an element of the writing matrix. When the valid information in the current row of the writing matrix is full, writing of the valid information continues from the first bit of the next row, and the remaining elements in the last row are filled with 0s.

[0012] Preferably, performing an exclusive OR operation on the encoding matrix with different masking matrices to form different honeycomb codes, and comparing the different honeycomb codes to obtain an optimal honeycomb code specifically includes: Performing an exclusive OR operation on the encoding matrix with different masking matrices to form different honeycomb codes; Set a number of small penalty matrices as convolution kernels; wherein, the convolution kernels change according to the parity of the current row number, and corresponding penalty values are set according to the error types of the penalty matrices. Perform convolution operations on the effective information regions of each honeycomb code according to the convolution kernels. During the operation, each time a small penalty matrix appears, the corresponding penalty value is accumulated into the penalty value of the honeycomb code, so as to obtain the final penalty values of all honeycomb codes. Select the honeycomb code with the lowest penalty value among all honeycomb codes as the optimal honeycomb code, and add the pattern information of the mask matrix to the specified position in the positioning graphic region of the optimal honeycomb code.

[0013] Preferably, when it is in an odd row, let the specific convolution kernel be F, then when it is in an even row, the elements in the odd row or even row of F are misaligned according to the scale of the convolution kernel. The convolution kernel includes a first type of penalty pixel matrix corresponding to the positioning graphic and a second type of penalty pixel matrix corresponding to continuously identical pixels with 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.

[0014] Preferably, during decoding, it specifically includes: Use the positioning graphic to identify the optimal honeycomb code, and identify the positioning graphic region and the effective information region. Read the pattern information of the mask matrix from the positioning graphic region. Select a mask matrix according to the pattern information of the mask matrix, and perform an inverse masking operation on the effective information region according to the mask matrix to obtain binary information. Perform block segmentation on the binary information, and use an error correction algorithm to restore the string information to obtain effective information.

[0015] An embodiment of the present invention further provides an information processing system based on a honeycomb pixel structure, which includes: An encoding unit, configured to encode the positioning graphic and the input information to form an encoding matrix based on regular hexagonal pixels, and the encoding matrix includes a positioning graphic region and an effective information region. A masking unit, configured to perform exclusive OR operations on at least the effective information region of the encoding matrix with different mask matrices to form different honeycomb codes, and compare the different honeycomb codes to obtain the optimal honeycomb code; the mask matrix is also a matrix based on hexagonal pixels. A decoding unit, configured to decode the optimal honeycomb code to obtain effective information.

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

[0017] Figure 1 It is a flowchart of an information processing method based on a honeycomb pixel structure provided by the first embodiment of the present invention; Figure 2 It is a schematic diagram of a positioning graphic area provided by an embodiment of the present invention; Figures 3 - 10 It is a schematic diagram of eight mask patterns corresponding to eight different mask matrices provided by an embodiment of the present invention; Figure 11 It is a schematic diagram of the pattern of the optimal honeycomb code provided by an embodiment of the present invention; Figure 12 It is a matrix schematic diagram of the optimal honeycomb code provided by an embodiment of the present invention; Figure 13 It is a decoding schematic diagram based on a honeycomb pixel structure provided by the first embodiment of the present invention; Figure 14 It is a schematic diagram of the structure of an information processing system based on a honeycomb pixel structure provided by the second embodiment. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0018] In order to make the purpose, technical solution and advantages of the present application clearer, the present application will be 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 the present application and are not used to limit the present application.

[0019] An information processing method and system based on a honeycomb pixel structure of the present application can be used to generate and decode a honeycomb code.

[0020] In addition, the information processing method based on the honeycomb pixel structure provided by the present application does not limit its execution subject. Optionally, the execution subject of the information processing method based on the honeycomb pixel structure provided by the present application can be a honeycomb code processing terminal. Specifically, the execution subject of the information processing method based on the honeycomb pixel structure provided by the present application can be one or more processors in the honeycomb code processing terminal.

[0021] Embodiment 1 This embodiment proposes an information processing method based on a honeycomb pixel structure. The method can incorporate specific information into an encoding matrix to form a honeycomb code, and the honeycomb code can also be decoded through a specific algorithm to realize the storage and acquisition of information. Specifically, referring to Figure 1 , the method includes: S101, Encoding step: Encode the positioning pattern and the input information to form an encoding matrix based on regular hexagonal pixels. The encoding matrix includes a positioning pattern area and a valid information area.

[0022] In this embodiment, the encoding matrix is a matrix formed based on regular hexagonal pixels, and the encoding matrix is reasonably divided into a positioning pattern area and a valid information area. Among them, the positioning pattern can be placed at the top of the encoding matrix to form the positioning pattern area; the valid information can be placed at the bottom of the encoding matrix to form the valid information area.

[0023] For example, as Figure 2 shown, assume that 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 valid information area, but the black and white pixels cannot overlap each other, otherwise the number of columns needs to be readjusted. The positioning pattern area ends at Figure 2 the 10th row, and the valid information area starts from the 11th row.

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

[0025] In this implementation, the positioning pattern includes at least two positioning marks, and all the positioning marks are placed in the positioning pattern area of the encoding matrix.

[0026] Among them, generally, one positioning mark represents the positioning starting point, and the other positioning mark represents the positioning end point.

[0027] Such as Figure 2 shown, in one implementation, the positioning mark can be composed of three circles of hexagonal patterns with the first gray level and the second gray level of white - black - white alternating. Of course, it can also be other shapes, and the present invention does not make specific limitations.

[0028] In this embodiment, the input information can be text, numbers, URLs, etc. After calculating the corresponding error - correction information, the error - correction information is placed after the input information and then binary - ized to obtain the valid information.

[0029] In this embodiment, during encoding, a writing matrix is formed in the central area of the valid information area, and the valid information is written into the writing matrix in ascending order by column. Each binary digit of the valid information is an element of the writing matrix. When the valid information in the current row of the writing matrix is full, continue to write the valid information from the first digit of the next row, and the remaining elements in the last row are filled with 0s.

[0030] 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.

[0031] S102: performing an exclusive OR operation on at least the effective 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.

[0032] 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.

[0033] 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. 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.

[0034] 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.

[0035] 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 : (1) According to the matrix H i That is, the corresponding 8 cellular codes can be obtained.

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

[0037] 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: (2) 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.

[0038] 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.

[0039] 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.

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

[0041] 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. Specifically, when decoding: First, the optimal cellular code is identified using the positioning pattern, and the positioning pattern area and the valid information area are identified; Then, reading the pattern information of the mask matrix from the positioning pattern area; 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; Finally, the binary information is segmented into blocks, and the error correction algorithm is used to restore the string information to obtain the valid information.

[0042] Among them, there are 2 types of the positioning patterns, the hexagonal pattern containing the locator and the pattern information of the mask matrix. The hexagonal pattern containing the locator is used to determine whether the honeycomb code needs to be rotated, and can be used to define the range of the honeycomb code positioning pattern area and the valid information area; the pattern information of the mask matrix is used to determine the mask matrix adopted by the honeycomb code.

[0043] Judging the mask matrix of the honeycomb code according to the masking method of the specific position in the positioning pattern area, that is Figure 10 The corresponding mask matrix. Perform inverse masking operation on the valid information area to obtain the encoded binary information.

[0044] (3) Among them represents the number corresponding to the current mask matrix.

[0045] In this embodiment, 8-bit binary is used to represent the information of one byte. It needs to be divided into several 8-bit binary strings. The black pixels represent 0, and the white pixels represent 1. The termination information is set as "1110 1100 0001 0001" for example. Convert the binary string (that is, the valid information) into decimal to obtain the original information.

[0046] In this embodiment, as described in step S101, in order to reduce the influence of errors caused by inaccurate recognition and honeycomb code defects on decoding, the valid information in 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 the errors that occur during the transmission of the honeycomb code; assuming the length of the input information is β and the length of the error correction information is γ, then after decoding to obtain the valid information It further includes: Construct a polynomial : (4) Among them, 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; Using to perform long division operation on the coefficients of ; among them, the long division operation involves the Galois field calculation rule, the addition and subtraction are the exclusive OR operation of the Galois field values, and the multiplication is the addition operation of exponents; Judge whether the remainder of the long division operation is 0; If so, it indicates that the honeycomb code is read correctly and the valid information is read. The first β elements in are used as the input information; If not, error correction is performed based on the matrix The number of rows of the matrix is equal to the length of the error correction information, and the number of columns is equal to the length of the valid information (5) According to the matrix and the valid information calculate the vector : (6) Among them, due to a read error, must be a non-zero vector. Convert into a matrix . The number of rows of the matrix is floor(γ / 2), where floor(.) represents the floor function. The number of columns is 1 more than the number of rows. The sum of the row and column corresponding to the position of the element in the matrix is equal to the corresponding position of the element in ; Perform row elimination on the matrix using Gaussian elimination. After obtaining the reduced row echelon form, take the elements of the last column of the matrix and arrange them in reverse order and add the element 1. These are used as the coefficients of the equation in turn. The highest degree of the equation coefficients is equal to the rank of the matrix ; The solution of the equation is the exponent of , sort in descending order, subtract the length of from the length of to obtain the position where the read error occurs . After removing the element at the position in , obtain . After removing the elements of the row in the matrix , obtain : (7) Establish a system of linear equations to solve for the correct value of the error position : (8) After solving for , replace the element at the position with to obtain the corrected valid information and extract the corrected valid information The first β elements are used as input information.

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

[0048] Embodiment 2 Please refer to Figure 14 , this embodiment also provides an information processing system based on a honeycomb pixel structure, which includes: An encoding unit 210 for encoding the positioning pattern and input information to form an encoding matrix based on regular hexagonal pixels, where the encoding matrix includes a positioning pattern area and a valid information area; A masking unit 220 for performing exclusive OR operations on at least the valid information area of the encoding matrix with different masking matrices to form different honeycomb codes, and comparing different honeycomb codes to obtain the optimal honeycomb code; the masking matrix is also a matrix based on hexagonal pixels; A decoding unit 230 for decoding the optimal honeycomb code to obtain valid information.

[0049] 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, and a computer program is stored in the memory, 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.

[0050] The fourth embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program, and the computer program can be executed by the processor of the device where the computer-readable storage medium is located to implement the information processing method based on the honeycomb pixel structure as described above.

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

[0052] The so-called processor may be a Central Processing Unit (CPU), or may also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field-Programmable Gate Arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The processor is the control center of the described generation method, and uses various interfaces and circuits to connect the whole to implement each part of an information processing method.

[0053] The memory can be used to store the computer program and / or module. The processor realizes various functions of an error correction method by running or executing the computer program and / or module stored in the memory, and by calling the data stored in the memory. The memory may mainly include a program storage area and a data storage area. Among them, the program storage area can store an operating system, application programs required for at least one function (such as a sound playback function, a text conversion function, etc.); the data storage area can store data created according to 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 may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, at least one magnetic disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0054] Among them, if the implemented module is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, to implement all or part of the processes in the above-described embodiment methods of the present invention, it can also be completed by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by a processor, the steps of the above various method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in the form of source code, object code, executable file, or some intermediate form, etc. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disc, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal, and software distribution medium, etc. It should be noted that the content included in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, the computer-readable medium does not include electrical carrier signals and telecommunication signals.

[0055] It should be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, in the attached drawings of the device embodiments provided by the present invention, the connection relationship between the modules indicates that they have a communication connection, which can be specifically implemented as one or more communication buses or signal lines. Those of ordinary skill in the art can understand and implement it without creative efforts.

[0056] The above is only the preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above embodiments. All technical solutions falling within the idea 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, characterized in that, The method includes: An encoding step of encoding the positioning pattern and the input information to form an encoding matrix based on regular hexagon pixels, where the encoding matrix includes a positioning pattern area and a valid information area; A masking step of performing an exclusive OR operation on at least the valid information area of the encoding 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 hexagon pixels; A decoding step of decoding the optimal honeycomb code to obtain valid information.

2. The information processing method based on a honeycomb pixel structure according to claim 1, wherein The honeycomb code is composed of regular hexagon pixels with a first gray value or a second gray value closely arranged. Among them, in the same column, the center points of each regular hexagon pixel are on the same straight line; in adjacent columns, each regular hexagon pixel is located between two adjacent regular hexagon pixels in its adjacent column.

3. The information processing method based on a honeycomb pixel structure according to claim 1, wherein The scale of the masking matrix is the same as the scale of the valid information area. During the operation, the valid information area of the encoding matrix is subjected to an exclusive OR operation with different masking matrices to form different honeycomb codes; or, the scale of the masking matrix is the same as the scale of the encoding matrix. The masking matrix includes a positioning pattern masking area and a valid information masking area. During the operation, the valid information area of the encoding matrix is subjected to an exclusive OR operation with the valid information masking areas of different masking matrices to form different honeycomb codes. The positioning pattern masking area has exactly the same pixel arrangement scale as the positioning pattern area.

4. The information processing method based on a honeycomb pixel structure according to claim 1, wherein The positioning pattern includes at least two positioning marks, and the positioning marks are all placed in the positioning pattern area of the encoding matrix.

5. The information processing method based on a honeycomb pixel structure according to claim 1, characterized in that, The input information is string information. After calculating the corresponding error correction information, the error correction information is placed after the input information and binaryized to form valid information.

6. The information processing method based on a honeycomb pixel structure according to claim 5, characterized in that, During encoding, a writing matrix is formed in the central area of the valid information area, and the valid information is written in ascending order by column. Each binary valid information is an element of the writing matrix. When the valid information in the current row of the writing matrix is full, the writing of the valid information continues from the first bit of the next row, and the remaining elements in the last row are filled with 0.

7. The information processing method based on a honeycomb pixel structure according to claim 1, characterized in that Performing an exclusive OR operation on the encoding matrix with different masking matrices to form different honeycomb codes, and comparing the different honeycomb codes to obtain an optimal honeycomb code, specifically including: Performing an exclusive OR operation on the encoding matrix with different masking matrices to form different honeycomb codes; Setting several small penalty matrices as convolution kernels; among them, the convolution kernel changes according to the parity of the current row number, and a corresponding penalty value is set according to the error type of the penalty matrix; Performing a convolution operation on the valid information area of each honeycomb code according to the convolution kernel. During the operation, each time a small penalty matrix appears, the corresponding penalty value is accumulated into the penalty value of the honeycomb code, so as to obtain the final penalty values of all honeycomb codes; Selecting the honeycomb code with the lowest penalty value among all honeycomb codes as the optimal honeycomb code, and adding the pattern information of the masking matrix to the specified position in the positioning pattern area of the optimal honeycomb code.

8. The information processing method based on the honeycomb pixel structure according to claim 7, wherein When in an odd row, let the specific convolution kernel be F. When in an even row, the elements in the odd or even rows of F are misaligned according to the scale of the convolution kernel. 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 with different scales. The penalty score of the convolution kernel corresponding to the first type of penalty pixel matrix is much higher than that of the convolution kernel corresponding to the second type of penalty pixel matrix.

9. The information processing method based on a honeycomb pixel structure according to claim 7, characterized in that During decoding, it specifically includes: Using the positioning pattern to identify the optimal honeycomb code, and identifying the positioning pattern area and the valid information area; Reading the pattern information of the mask matrix from the positioning pattern area; Selecting a mask matrix according to the pattern information of the mask matrix, and performing an inverse masking operation on the valid information area according to the mask matrix to obtain binary information; Performing block segmentation on the binary information, and using an error correction algorithm to restore the string information to obtain valid information.

10. An information processing system based on a honeycomb pixel structure, characterized in that, It includes: An encoding unit for encoding the positioning pattern and the input information to form an encoding matrix based on regular hexagonal pixels. The encoding matrix includes a positioning pattern area and a valid information area; A masking unit for performing an exclusive OR operation on at least the valid information area of the encoding matrix with different mask matrices to form different honeycomb codes, and comparing the different honeycomb codes to obtain the optimal honeycomb code; The mask matrix is also a matrix based on hexagonal pixels; A decoding unit for decoding the optimal honeycomb code to obtain valid information.

Images