CN114169353A - Microcode decryption method and system - Google Patents
Microcode decryption method and system Download PDFInfo
- Publication number
- CN114169353A CN114169353A CN202111492450.3A CN202111492450A CN114169353A CN 114169353 A CN114169353 A CN 114169353A CN 202111492450 A CN202111492450 A CN 202111492450A CN 114169353 A CN114169353 A CN 114169353A
- Authority
- CN
- China
- Prior art keywords
- identifier
- identifiers
- sequence
- distance
- microcode
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1439—Methods for optical code recognition including a method step for retrieval of the optical code
- G06K7/1443—Methods for optical code recognition including a method step for retrieval of the optical code locating of the code in an image
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Electromagnetism (AREA)
- General Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a microcode decryption method and a microcode decryption system, which comprise the following steps: acquiring input image data; identifying a first identifier in the image data according to preset first identifier information, and identifying the position of the first identifier as an origin position; identifying a plurality of second identifiers in the image data according to a preset second identifier information set, and identifying a plurality of coordinate values of the plurality of second identifiers relative to the origin position; and calculating the distances between the second identifiers and the original points according to the coordinate values and the positions of the original points, connecting the second identifiers with the original points, calculating included angles between adjacent connecting lines, rounding the distances and included angles, arranging the distances and included angles in sequence to obtain sequence values, and obtaining decoded values according to the sequence values by adopting a preset decoding algorithm. Even if the first identifier and the second identifier are lossless, the decryption of the data is not influenced, and the anti-pollution capability is improved.
Description
Technical Field
The invention relates to the technical field of graphic data codes, in particular to a microcode decryption method and a microcode decryption system.
Background
The two-dimensional code is also called a two-dimensional bar code, a common two-dimensional code is QRCode, QR is totally called quick response, and the two-dimensional bar code is an ultra-popular coding mode on mobile equipment in recent years, can store more information than the traditional Bar code bar code, and can also represent more data types.
The two-dimensional code (2-dimensional bar code) is a pattern which is distributed on a plane (in two-dimensional direction) according to a certain rule by using a certain specific geometric figure, is black and white and is alternated and records data symbol information; the concept of '0' and '1' bit stream which forms the internal logic base of computer is skillfully utilized in coding, a plurality of geometric shapes corresponding to binary system are used for representing literal numerical information, and the information is automatically read by an image input device or an optoelectronic scanning device so as to realize the automatic processing of the information: it has some commonality of barcode technology: each code system has its specific character set; each character occupies a certain width; has certain checking function and the like. Meanwhile, the method also has the function of automatically identifying information of different rows and processing the graph rotation change points. The two-dimension code corresponding to the data generation can be regarded as a two-dimension code encryption process, and then the corresponding data obtained by analyzing the corresponding two-dimension code can be regarded as a two-dimension code decryption process.
The most common two-dimensional code in the prior art is a square two-dimensional code, the three corners of the upper left, the lower left and the upper right are provided with 'hui' characters for basic identification and positioning, and black and white square block graphs are filled in the two-dimensional code to form a two-dimensional code image. The obvious problem that current two-dimensional code exists is: because the identification and positioning occupy a large area, the information area capable of being stored is relatively limited, and a logic 0 or 1 is directly represented by a square, the two-dimensional code area occupied by one byte of information is also large, so that the data capacity capable of being stored by the two-dimensional code is very limited. Then, for the condition that the two-dimensional code is damaged such as fouling, the two-dimensional code can not be identified, and the damage resistance is limited.
Disclosure of Invention
Therefore, it is necessary to provide a method and a system for decrypting a microcosmic code, which solve the problems that the data size is small and the recognition rate is easily affected when the existing graphic code is decrypted into data.
In order to achieve the above object, the present invention provides a method for decrypting a microscopic code, comprising the steps of:
acquiring input image data;
identifying a first identifier in the image data according to preset first identifier information, and identifying the position of the first identifier as an origin position;
identifying a plurality of second identifiers in the image data according to a preset second identifier information set, and identifying a plurality of coordinate values of the plurality of second identifiers relative to the origin position;
and calculating the distances between the second identifiers and the original points according to the coordinate values and the positions of the original points, connecting the second identifiers with the original points, calculating included angles between adjacent connecting lines, rounding the distances and included angles, arranging the distances and included angles in sequence to obtain sequence values, and obtaining decoded values according to the sequence values by adopting a preset decoding algorithm.
Further, if the first identifier is not recognized, the second identifiers of the two image data are directly recognized according to the preset second identifiers, and the origin position of the first identifier is determined according to the positions of the preset second identifiers in the image.
Further, the distance is rounded to the distance between the second identifier center and the first identifier center divided by the distance between the two third identifier centers, and then rounded to an integer value.
Further, when a plurality of first identifiers are identified, an identification area is defined according to the average value of the distance between two adjacent identifiers, the second identifier is identified in the identification area, and sequence value operation is carried out according to the second identifier identified in one identification area.
Further, second identifiers in different identification areas are compared in sequence, and if second identifiers at the same position in different identification areas are missing, the missing second identifiers are supplemented to the missing areas according to the identification areas with the second identifiers.
Further, the second identifier information set includes a sequence number corresponding to the second identifier, and when identifying the second identifier, the second identifier information set also includes a sequence number identifying the second identifier, according to the sequence number of the second identifier; obtaining sequence values by arranging according to the sequence after rounding the distance and the included angle comprises the following steps:
and arranging according to the distance, the second identifier sequence number and the included angle in sequence to obtain a sequence value.
Further, the number of turns of the second identifier is determined according to the distance between the second identifier and the origin and the distance of the second identifier in each turn, and sequence values are obtained according to the number of turns in sequence and the arrangement from the outer ring to the inner ring.
Further, the distance is rounded to be the distance between the center of the second identifier and the center of the first identifier divided by the diameter of the circle on which the periphery of the first identifier is located, and then rounded to be an integer value
The invention provides a microcode decryption system, which comprises a memory and a processor, wherein the memory stores a computer program, and the computer program is executed by the processor to realize the steps of the method according to any one of the embodiments of the invention.
Further, the device also comprises a camera, wherein the camera is used for acquiring image data and transmitting the image data to the processor.
Different from the prior art, the technical scheme has the advantages that the pattern center is identified through the first identifier, the distance and the angle are obtained through the identification of the second identifier, the information contained in the distance and the angle is far larger than the information expressed by logic 0 or 1, a large amount of data can be obtained through decryption of the second identifier, and meanwhile, even if the first identifier and the second identifier are lossless, the decryption of the data cannot be influenced, and the anti-pollution capacity is improved.
Drawings
Fig. 1 is a flowchart of an encryption method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a first identifier and a second identifier according to an embodiment of the invention;
FIG. 3 is a micro code image of an embodiment of the invention after encryption;
FIG. 4 is a micro-code diagram of one embodiment of an array arrangement after encryption in accordance with the present invention;
FIG. 5 is a microscopic image of an embodiment of the encrypted second identification code of the present invention;
fig. 6 is a flowchart of a decryption embodiment of the present invention.
Detailed Description
To explain technical contents, structural features, and objects and effects of the technical solutions in detail, the following detailed description is given with reference to the accompanying drawings in conjunction with the embodiments.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase "an embodiment" in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or related to other embodiments specifically defined. In principle, in the present application, the technical features mentioned in the embodiments can be combined in any manner to form a corresponding implementable technical solution as long as there is no technical contradiction or conflict.
Unless defined otherwise, technical terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs; the use of relational terms herein is intended only to describe particular embodiments and is not intended to limit the present application.
In the description of the present application, the term "and/or" is a expression for describing a logical relationship between objects, meaning that three relationships may exist, for example a and/or B, meaning: there are three cases of A, B, and both A and B. In addition, the character "/" herein generally indicates that the former and latter associated objects are in a logical relationship of "or".
In this application, terms such as "first" and "second" are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.
Without further limitation, in this application, the use of "including," "comprising," "having," or other similar expressions in phrases and expressions of "including," "comprising," or "having," is intended to cover a non-exclusive inclusion, and such expressions do not exclude the presence of additional elements in a process, method, or article that includes the recited elements, such that a process, method, or article that includes a list of elements may include not only those elements but also other elements not expressly listed or inherent to such process, method, or article.
As is understood in the examination of the guidelines, the terms "greater than", "less than", "more than" and the like in this application are to be understood as excluding the number; the expressions "above", "below", "within" and the like are understood to include the present numbers. In addition, in the description of the embodiments of the present application, "a plurality" means two or more (including two), and expressions related to "a plurality" similar thereto are also understood, for example, "a plurality of groups", "a plurality of times", and the like, unless specifically defined otherwise.
In the description of the embodiments of the present application, spatially relative expressions such as "central," "longitudinal," "lateral," "length," "width," "thickness," "up," "down," "front," "back," "left," "right," "vertical," "horizontal," "vertical," "top," "bottom," "inner," "outer," "clockwise," "counterclockwise," "axial," "radial," "circumferential," and the like are used, and the indicated orientations or positional relationships are based on the orientations or positional relationships shown in the specific embodiments or drawings and are only for convenience of describing the specific embodiments of the present application or for the convenience of the reader, and do not indicate or imply that the device or component in question must have a specific position, a specific orientation, or be constructed or operated in a specific orientation and therefore should not be construed as limiting the embodiments of the present application.
Unless specifically stated or limited otherwise, the terms "mounted," "connected," "secured," and "disposed" used in the description of the embodiments of the present application are to be construed broadly. For example, the connection can be a fixed connection, a detachable connection, or an integrated arrangement; it can be a mechanical connection, an electrical connection, or a communication connection; they may be directly connected or indirectly connected through an intermediate; which may be communication within two elements or an interaction of two elements. Specific meanings of the above terms in the embodiments of the present application can be understood by those skilled in the art to which the present application pertains in accordance with specific situations.
Referring to fig. 1 to 6, the present embodiment provides a method for encrypting a micro code, where the encryption process is a process of generating a micro code from data to be encrypted, and the encryption process of the present invention uses a first identifier and a second identifier, where the first identifier and the second identifier should be graphics that can be clearly distinguished. As shown in fig. 2, wherein the first identifier and the second identifier may be geometric figures, such as five-pointed stars, circles, quadrilaterals, diamonds, hexagons, etc. And the second identifier can be used as different second identifiers by distinguishing whether the second identifier is filled with color or not, the identification difficulty can be reduced and the identification efficiency can be improved by using a simple geometric figure, and in other embodiments, the second identifier can be other complex figures, characters, numbers, Braille dot matrixes and the like. This embodiment exemplifies one number of first identifiers and ten number of second identifiers. The method comprises the following steps:
step S101, acquiring input data to be encrypted, wherein the data to be encrypted comprises numbers, symbols, letters, Chinese characters and the like; and encrypting the data to be encrypted according to an encryption rule to obtain a decimal number character string. The encryption rule is only required to obtain a decimal numeric character string, such as directly replacing symbols, Chinese characters, letters and the like with the decimal numeric character string with the same number of digits. In some embodiments, the data to be encrypted may be converted into binary code according to the existing encoding rule, and then the binary code may be converted into decimal code. Of course, in order to improve the anti-interference and error correction capability, after encryption is performed by using an encryption rule, a check digit can be set at the tail of an encrypted digital character string, so that the error correction capability of the character string is improved.
And then, the method enters step S102, values are sequentially taken according to the numeric character string and the value taking rule of the fixed number of the digits, the obtained values are sequentially taken as the included angle information and the distance information and are grouped, and each group comprises one piece of included angle information and one piece of distance information. If the numeric character string is twelve bits and the fixed number of bits is one bit, six groups can be taken, each group comprises the included angle information of one bit and the distance information of one bit, and if the included angle information and the distance information cannot be divided completely, the added value is 0 to form one group. Then, in step S103, a preset first identifier is placed at the center position on the blank image; as shown in fig. 3. Typically, the blank image is a fixed-size, generally square image, and in some embodiments, may also be a circular image. And then place the first identifier in the middle of the image.
And then, the step S104 is carried out, wherein the second identifiers of the preset second identifier information set are sequentially selected according to the group number of the included angle information and the distance information, and each second identifier is allocated with a group of included angle information and distance information. For example, the identifiers are taken in the order of the second identifiers, the second identifiers are placed on the blank image by taking the distance information as the distance information between the second identifiers and the first identifiers, and the angle information is taken as the angle information between the second identifiers and the next second identifiers and is used for the placement operation of the position of the next second identifiers until all the taken second identifiers are placed on the blank image. For example, the first pattern in the second identifier is a solid circle corresponding to a distance number of 5 and an angle number of 7. The actual distance information in the image is determined according to the actual situation, and the minimum recognizable actual distance is taken as 1 unit distance (e.g. 10px), and then the distance number is multiplied by the distance number (e.g. 5 is 50 px). The center of the solid circle is placed at a position 50px away from the center of the first identifier, although 0 is more specific and encryption and decryption can be performed using 0 to 10 in order to avoid overwriting the first identifier. And the angle is also 1 unit (e.g., 5 deg.) based on the minimum angle that can be actually recognized. And multiplying the minimum angle by the actual angle number to obtain the actual angle, wherein the two minimum units are pre-stored in the encryption and decryption processes, and the encryption and decryption parties are required to be consistent. The angle is the included angle between the connecting line of the two second identifiers and the first identifier. Of course, the second identifier of the first should have an initial position to place, e.g., may be placed directly above. And when the included angle is set, the set direction is the clockwise direction or the anticlockwise direction. This direction can be preset on both the encrypting and decrypting devices. In this way, after the second identification codes are placed according to the distances and angles of all the groups, that is, after the second identification codes are placed, the step S105 is performed, and then the images of the first identification codes and the second identification codes are used as the microcode images. This completes the encryption process of the character string to the micro code. In one embodiment, a simple microscopic code is generated as shown in FIG. 3. Such a micro code has many gaps in the middle thereof, and when the gap area of the micro code is smeared, the decoding can be performed as usual. The existing two-dimensional code only has fouling inside, and because the inside is a data area, the data identification is greatly influenced. The anti-pollution capacity is improved relative to the two-dimensional code.
Specifically, in the identification process, i.e., the decoding process of the micro code, as shown in fig. 6, a micro code decryption method is provided, which includes the following steps: step S601 acquires input image data; such as the microcode image of fig. 3. Then, step S602 identifies the first identifier in the image data according to the preset first identifier information and identifies the position of the first identifier as an origin position (first identifier center position). Step S603, identifying a plurality of second identifiers in the image data according to a preset second identifier information set, that is, firstly identifying which of the second identifiers are the second identifiers, and identifying a plurality of coordinate values of the plurality of second identifiers relative to the origin position; i.e. the position of the second identifier on the image is identified. And then step S604 is carried out, the distance between each of the second identifiers and the original point is calculated according to the coordinate values and the position of the original point, the connection is carried out, the included angle between the adjacent connection lines is calculated, the sequence values are obtained by arranging according to the sequence after the distance and the included angle are rounded, and the decoded values are obtained by adopting a preset decoding algorithm according to the sequence values. The rounding here is: the decoding method comprises the steps of obtaining an integer number by rounding the actual distance by the preset unit distance, obtaining an integer number by rounding the actual angle by the preset unit angle, then starting to arrange the numbers according to a first second identifier (here, the first second identifier in the second identifier set is shown as a solid circle in the figure) and a preset sequence direction (for example, a clockwise direction), obtaining a sequence value, and obtaining a decoded value by adopting a pre-stored sequence value decoding rule. The decoding algorithm here is the inverse of the above decimal number encryption rule. This can result in a character string. The actual application can then be performed on the basis of the character string. The final number sequence is obtained by a decoding algorithm to form a character string, and the character string can be of more types, not only numbers, and is convenient for practical use. The decryption process of the micro code is completed through the whole process, and similarly, the micro code can be decoded as usual when the gap area of the micro code is contaminated because the micro code has a plurality of gaps in the middle. The existing two-dimensional code only has fouling inside, and because the inside is a data area, the data identification is greatly influenced. The anti-pollution capacity is improved relative to the two-dimensional code.
The encryption process of the invention can be independently stored in one device, and the decryption process can also be independently stored in one device, thereby realizing independent encryption and decryption. Or in some embodiments, the encryption and decryption steps may be stored in one device, and the data may be converted into the microcodes, or the microcodes may be converted into the data.
Further, in order to further improve the anti-contamination discrimination capability, as shown in fig. 4, a code image having a plurality of microcodes may be formed by arraying the generated microcode images on an image. As shown in fig. 4, the images are after four arrays, so that only one image can be identified without smearing. At this time, at the time of recognition, the influence of the second identifier of the other microscopic code on the identifier to be recognized is to be avoided. The identification decryption is that, further, when the number of the identified first identifiers is multiple, an identification area is defined according to an average value of the distances between two adjacent identifiers, the identification of the second identifier is performed in the identification area, and the sequence value operation is performed according to the second identifier identified in one identification area. The identification area is cut out in this way, and then identification is carried out only in the identification area, so that the influence of the second identifier of the other first identifier on the current first identifier is avoided.
In some embodiments, if there are small deletions of different microcodes, the portions of the microcodes may be combined to complete one microcode. And when decrypting, the method also comprises the step of comparing the second identifiers in different identification areas in sequence, and if the second identifiers at the same position in different identification areas are missing, supplementing the missing second identifiers to the missing areas according to the identification areas with the second identifiers. This achieves a higher decryption capability of the corrupt microcodes.
In some embodiments, in case of changing the microcodes, in order to further increase the data storage capacity of the microcodes, a serial number is introduced to the second identifier and this serial number is used as part of the encryption. Further, if the second identifier has a serial number, the step of grouping the obtained values as angle information and distance information in this order includes: the acquired values are sequentially grouped as angle information, distance information, and second identifier number information. The step of sequentially fetching the second identifiers of the preset second identifier information set according to the group number of the included angle information and the distance information includes: and sequentially acquiring second identifiers of a preset second identifier information set according to the second identifier sequence number information. When the decimal character string is grouped, the number of the grouped digits is increased by one digit, and the increased digit is used for obtaining the corresponding second identifier. If the original is twelve digits, the distance and the angle of one digit are respectively taken and divided into six groups. After the serial numbers are added, each group respectively takes the distance, the angle and the serial number of one number, and only needs to be divided into four groups. The sequence number may be the first or last bit in each group. If the serial number in the first group is 5, the 5 th bit corresponding to the second identifier is a double-bar image. The dual bar image is placed as the second identifier image of the first. The placing is carried out in sequence. Therefore, the information storage capacity is increased through the serial number of the second identifier, and more information storage is realized.
When decryption is performed at this time, further, the second identifier information set includes a sequence number corresponding to the second identifier, and when identifying the second identifier, the second identifier information set also includes a sequence number identifying the second identifier, according to the sequence number of the second identifier; obtaining sequence values by arranging according to the sequence after rounding the distance and the included angle comprises the following steps: and arranging according to the distance, the second identifier sequence number and the included angle in sequence to obtain a sequence value. Since the direction has been determined and then the second identifier is used for the serial number, the need to locate which of the first second identifiers is can be achieved by marking the first second identifier. If a straight line is connected between the first second identifier and the first identifier, it is possible to know which is the first second identifier, and the second identifier connected to the first identifier is recognized as the first identifier when the decryption is performed. Or a small marking pattern is arranged beside the first second identifier, the marking of the first second identifier can be realized, or if the data volume is small, the number of the second identifiers is small, a large amount of blank exists between the head and the tail of the second identifiers, and which second identifier is the first second identifier can be determined through the blank and the decryption direction (clockwise or counterclockwise).
When the distance is determined, since the picture may be enlarged or reduced, the actual distance can be confirmed by determining the size of the first identifier, for example, the actual distance can be determined by directly being a multiple of the size of the first identifier, and the size of the first identifier can be the diameter of the circle where the periphery of the first identifier is located. I.e. the measured distance between the second identifier and the first identifier, and then calculates a value for the distance on the basis of the first identifier. In some embodiments, a third identifier may be appended, the third identifier being different from both the first identifier and the second identifier. Further, two identical third identifiers are taken, the standard spacing values of the two images are set as a part of the images, and the two third identifiers are placed at specific positions (such as the upper right corners) of corners of the blank image. The third identification code has two functions, one is used for determining the unit distance, the other is used for determining the central position of the image, namely the position of the first identification code, when the first identification code is stained, the position is identified through the third identification code, and then the position of the first identification code can be obtained according to the preset position relation of the third identification code in the image. Further, when decrypting, if the first identifier is not recognized, the second identifiers of the two image data are directly recognized according to the preset second identifiers, and the origin position of the first identifier is determined according to the positions of the preset second identifiers in the image. Of course, when the image range is large, the origin positions of a plurality of the first identifiers may be recognized, and the origin position placed among a plurality of the second identifiers may be selected. Thus, the double-insurance identification of the origin position can be realized through the internal first identifier and the external third identifier, and the anti-pollution capacity is improved.
The schematic diagram of the invention adopts a larger figure for illustration, and actually the existing figure has strong recognition capability and can recognize a small figure, so that the figure can be made to be small. In some embodiments, in the case of a larger data amount, the invention may further include placing the second identifiers in order of the placed order (the same clockwise or counterclockwise order as the second identifiers of the first circle) starting with the distance information plus the maximum distance of the first circle as the actual distance (e.g. the maximum distance of the first circle is 10, the distance value of the second circle is 4, the distance of the second identifier of the actual second circle is 14 from the first identifier) and the first identifier as the origin of the angle (the angle is also the origin of the first identifier, and the angle of the line connecting two adjacent second identifiers) after placing the first identifiers by a full circle (i.e. the placed angle and the close to 360 degrees, and then placing by more than 360 degrees), placing the remaining second identifiers to the periphery of the placed first identifiers, as shown in fig. 5. If the second turn is full, it may be placed so as to extend to the third turn and the fourth turn. The position of the first second identifier of the second turn is determined on the basis of the angle between the last second identifier of the first turn. This allows for more information to be encrypted. And during decryption, determining the number of turns of the second identifier according to the distance between the second identifier and the origin and the distance of the second identifier in each turn (for example, the first turn is 1-10, and the second turn is 11-20), and arranging the turns in sequence from the outer turn to the inner turn according to the number of turns to obtain the sequence value. For example, each turn of sequence value can be calculated, and then the final sequence value can be obtained by sequentially combining the sequence values of each turn from the outer circle to the inner circle.
The invention provides a microcode encryption system, which comprises a memory and a processor, wherein the memory stores a computer program, and the computer program is executed by the processor to realize the steps of the method according to any one of the encryption embodiments of the invention. The encryption system of the invention realizes the encryption of data to the microcodes, and because the microcodes have a plurality of gaps in the middle, the microcodes can be decoded as usual when the gap areas are polluted. The existing two-dimensional code only has fouling inside, and because the inside is a data area, the data identification is greatly influenced. The anti-pollution capacity is improved relative to the two-dimensional code.
The invention provides a microcode decryption system, which comprises a memory and a processor, wherein the memory stores a computer program, and the computer program is executed by the processor to realize the steps of the method according to any one of the decryption embodiments of the invention. The decryption system of the invention realizes the decryption of the microcodes to the data, and has stronger anti-pollution capability.
The image data can be directly decrypted when the image data is decrypted, or in some embodiments, the image data decryption. Thus, the microcodes can be taken and decrypted after the photographing.
It should be noted that, although the above embodiments have been described herein, the invention is not limited thereto. Therefore, based on the innovative concepts of the present invention, the technical solutions of the present invention can be directly or indirectly applied to other related technical fields by making changes and modifications to the embodiments described herein, or by using equivalent structures or equivalent processes performed in the content of the present specification and the attached drawings, which are included in the scope of the present invention.
Claims (10)
1. A microcode decryption method is characterized by comprising the following steps:
acquiring input image data;
identifying a first identifier in the image data according to preset first identifier information, and identifying the position of the first identifier as an origin position;
identifying a plurality of second identifiers in the image data according to a preset second identifier information set, and identifying a plurality of coordinate values of the plurality of second identifiers relative to the origin position;
and calculating the distances between the second identifiers and the original points according to the coordinate values and the positions of the original points, connecting the second identifiers with the original points, calculating included angles between adjacent connecting lines, rounding the distances and included angles, arranging the distances and included angles in sequence to obtain sequence values, and obtaining decoded values according to the sequence values by adopting a preset decoding algorithm.
2. A microcode decryption method according to claim 1, further comprising the steps of: and if the first identifier is not recognized, recognizing two third identifiers in the image data directly according to preset third identifiers, and determining the origin position of the first identifier according to the positions of the preset two third identifiers in the image.
3. A microcode decryption method according to claim 1, wherein the distance is rounded by dividing the distance between the center of the second identifier and the center of the first identifier by the distance between the centers of the two third identifiers, and rounding to an integer value.
4. A microcode decryption method according to claim 1, further comprising the steps of: when a plurality of first identifiers are identified, an identification area is defined according to the average value of the distance between two adjacent identifiers, the second identifier is identified in the identification area, and sequence value operation is carried out according to the second identifier identified in one identification area.
5. A microcode decryption method according to claim 4, further comprising the steps of: and comparing the second identifiers in different identification areas in sequence, and if the second identifiers at the same position in different identification areas are missing, supplementing the missing second identifiers to the missing areas according to the identification areas with the second identifiers.
6. A decryption method for microcodes according to claim 1, wherein the second identifier information set includes a serial number corresponding to the second identifier, and the step of identifying the second identifier further includes identifying the serial number of the second identifier according to the serial number of the second identifier; obtaining sequence values by arranging according to the sequence after rounding the distance and the included angle comprises the following steps:
and arranging according to the distance, the second identifier sequence number and the included angle in sequence to obtain a sequence value.
7. A microcode decryption method according to claim 1, wherein the number of turns of the second identifier is determined according to the distance between the second identifier and the origin and the distance of the second identifier in each turn, and the sequence values are obtained according to the number of turns arranged in sequence from the outer turn to the inner turn.
8. A decryption method for microcodes as claimed in claim 1, wherein the distance is rounded by dividing the distance between the center of the second identifier and the center of the first identifier by the diameter of the circle around the periphery of the first identifier to obtain an integer value.
9. A microcode decryption system, comprising: comprising a memory, a processor, said memory having stored thereon a computer program which, when being executed by the processor, carries out the steps of the method according to any one of claims 1 to 8.
10. A microcode decryption system according to claim 9, wherein: the device further comprises a camera, and the camera is used for acquiring image data and transmitting the image data to the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111492450.3A CN114169353B (en) | 2021-12-08 | 2021-12-08 | Microcode decryption method and microcode decryption system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111492450.3A CN114169353B (en) | 2021-12-08 | 2021-12-08 | Microcode decryption method and microcode decryption system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114169353A true CN114169353A (en) | 2022-03-11 |
| CN114169353B CN114169353B (en) | 2023-07-04 |
Family
ID=80484235
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111492450.3A Active CN114169353B (en) | 2021-12-08 | 2021-12-08 | Microcode decryption method and microcode decryption system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114169353B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7270277B1 (en) * | 2004-05-21 | 2007-09-18 | Koziol Jeffrey E | Data encoding mark for placement in a compact area and an object carrying the data encoding mark |
| CN107886147A (en) * | 2017-09-26 | 2018-04-06 | 朱恩彤 | The preparation method of ring code and recognition methods |
| CN108985421A (en) * | 2018-08-14 | 2018-12-11 | 上海掌门科技有限公司 | The generation method and recognition methods of encoded information |
| CN111461747A (en) * | 2020-03-30 | 2020-07-28 | 深圳前海量子云码科技有限公司 | Production method and system for canned product traceability anti-fleeing codes |
| CN111587445A (en) * | 2017-07-20 | 2020-08-25 | 拉瓦艾迪私人有限公司 | Security tag |
-
2021
- 2021-12-08 CN CN202111492450.3A patent/CN114169353B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7270277B1 (en) * | 2004-05-21 | 2007-09-18 | Koziol Jeffrey E | Data encoding mark for placement in a compact area and an object carrying the data encoding mark |
| CN111587445A (en) * | 2017-07-20 | 2020-08-25 | 拉瓦艾迪私人有限公司 | Security tag |
| CN107886147A (en) * | 2017-09-26 | 2018-04-06 | 朱恩彤 | The preparation method of ring code and recognition methods |
| CN108985421A (en) * | 2018-08-14 | 2018-12-11 | 上海掌门科技有限公司 | The generation method and recognition methods of encoded information |
| CN111461747A (en) * | 2020-03-30 | 2020-07-28 | 深圳前海量子云码科技有限公司 | Production method and system for canned product traceability anti-fleeing codes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114169353B (en) | 2023-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106951812B (en) | Identify the method, apparatus and terminal of two dimensional code | |
| EP3702970B1 (en) | Encoded cells and cell arrays | |
| TW201843653A (en) | Two-dimensional barcode, printed publication, generating device, and information processing method | |
| AU2010234172B2 (en) | Two-dimensional array code | |
| JP5229651B2 (en) | Two-dimensional code, two-dimensional code generation method, computer-readable program for displaying two-dimensional code, authentication method using two-dimensional code, and information providing method using two-dimensional code | |
| CN101086761A (en) | Efficient information lattice image and its generation and decoding method | |
| CN104657768A (en) | Colorful three-dimensional code structure and colorful three-dimensional code reading method | |
| CA3045391C (en) | Method for detection and recognition of long-range high-density visual markers | |
| CN101859398B (en) | Two-dimensional array code | |
| CN103927572B (en) | By coding segment to form the method and apparatus of dot pattern | |
| CN110991589A (en) | Two-dimensional code and encryption method thereof | |
| US20240086670A1 (en) | Methods for constructing, generating, and reading dot-matrix code, dot-matrix code generating and reading terminals, and dot-matrix code system | |
| CN114169353A (en) | Microcode decryption method and system | |
| CN114169482B (en) | Microcosmic code encryption method and microcosmic code encryption system | |
| CN101063998A (en) | Encoding and decoding method of two-dimension bar-code (Q code ) | |
| KR101163511B1 (en) | An identification code encoding method, and the identification code decoding method and apparatus | |
| CN103927575A (en) | Encoding pattern and method and device for forming lattice graph through encoding pattern | |
| US10977466B2 (en) | Multi-dimensional cyclic symbols | |
| CN114565687A (en) | Method, device, equipment and storage medium for encoding and decoding of data array code | |
| CN114186655B (en) | Identity application method and system based on microcosmic code | |
| CN111291583A (en) | Circular two-dimensional bar code decoding method | |
| CN114202044A (en) | Anti-counterfeiting application method and system based on microcodes | |
| CN107180216B (en) | Two-dimensional code generation and identification method | |
| CN103927574B (en) | It is a kind of by code pattern to form the method and apparatus of dot pattern | |
| CN115936047A (en) | Encoding and decoding method of colorful Chinese-sensible code, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |