JP2010113486A - Automatic recognition code using color arrangement and article with the same - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a technology which gives regularity not to the numerical computation of data but to the arrangement of color cells, and detects arrangement errors depending on whether or not the arrangement follows the rule, in an optical automatic recognition code in which the color cells are arranged to represent predetermined data. <P>SOLUTION: A rule for the number of color cells forming an optical automatic recognition code is provided for each color. The rule is set for at least one or more colors. For example, a rule for predefining the number of R-cells is preferable. Also, a rule for defining the number of color cells using modulus method may be provided. Since such a rule for the number of color cells is provided, an error check can be performed in detecting colors prior to correction of error detection in conventional methods, such as numerical computation of data, i.e., prior to data restoration. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a technique for preventing misreading of an “automatic recognition code by color arrangement” that represents data only by color transition, arrangement, combination, and the like. Further, the present invention relates to a technique for optically reading and decoding an automatic recognition code based on such a color arrangement.

Auto-recognition code based on the color arrangement A number of predetermined color cells are arranged, and the data is represented by the color arrangement, color transition, and color combination. Therefore, it does not depend on the shape or size of the color cell.

  Therefore, it is possible to attach an article that is difficult to attach with a conventional optical recognition code, and has various desirable characteristics such as a large amount of information. As conventional optical recognition codes, two-dimensional barcodes such as so-called barcodes and QR codes (registered trademark) are well known, but all have prescribed shapes and have irregularities on the surface, soft ones It was difficult to print directly on things.

  On the other hand, the automatic recognition code based on the color arrangement is a highly convenient optical recognition code that can be directly printed even on an article having irregularities on the surface because restrictions on the shape and the like are relaxed. Therefore, the inventor of the present application has made various developments on the automatic recognition code based on this color arrangement.

  The inventor of the present application has researched and developed various techniques for this automatic recognition code based on the color arrangement for many years, and invented various original “automatic recognition codes based on the color arrangement”. One of the automatic recognition codes based on the color arrangement originally developed by the inventor is a code called “1D color bit code”.

1D Color Bit Code The inventor of the present application has proposed an optical recognition code that represents information by color transition and change in Japanese Patent Application No. 2006-196548 (TCC-0004). This optical recognition code is called a “1D color bit code”. The ID color bit code is a preferred example of an automatic recognition code based on a color arrangement originally developed by the inventors.

  According to this 1D color bit code, the restrictions on the size and shape of the area occupied by each color cell are relaxed, so that the tag (code symbol) can be freely shaped. In addition, it is possible to mark a tag on an uneven surface or a flexible material, which is impossible with a conventional barcode.

  The inventor of the present application has proposed a method for recognizing the 1D color bit code in Japanese Patent Application No. 2007-130504 (BCR-0006). That is, the recognition of the 1D color bit code is performed by reading an image of a certain area and performing image processing. Therefore, it can be recognized regardless of the position and orientation of the code.

  Further, Japanese Patent Application No. 2007-163094 (BCR-0009) discloses a technology that can accurately read even when 1D color bit codes having different numbers of cells are mixed by setting conditions relating to end points of 1D color bit codes. .

  In addition, Japanese Patent Application No. 2007-292273 (BCR-0014) discloses a discrete 1D color bit code in which cells do not adhere to each other to some extent.

  The inventor of the present application independently developed automatic recognition codes based on various color arrangements, but all carry data only by a series of cells constituted by colors regardless of dimensions and shapes. . In the case of such an automatic recognition code based on the color arrangement, since the shape is not defined, the cell boundary is detected as a clue that the color is “different” or “changes”. Therefore, if cells of the same color are adjacent, they are regarded as the same cell.

  In other words, this has a technical feature / regulation that adjacent cells always have different colors.

  Now, what is developed by the present inventor and carries data only by a series of cells constituted by colors regardless of the size and shape will be referred to again as “automatic recognition code by color arrangement”. The 1D color bit code is a suitable example of the automatic recognition code based on this color arrangement.

  The automatic recognition code based on this color arrangement preferably uses about three types of colors in general applications so that variations in colors in the celebrated image data due to the imaging environment and the like can be tolerated to some extent. For example, a set of three colors such as “R (red), G (green), B (blue)” and “C (cyan), M (magenta), Y (yellow)” is a suitable example.

Causes of misreading On the other hand, misreading may occur due to the influence of some kind of disturbance. When the cause of the misreading was examined, it is considered that the cell color misrecognition (smear misrecognition) including dirt is the main cause. Further, in the automatic recognition code based on the color arrangement, color misrecognition appears as the following phenomenon.

a: Decrease in the number of cells constituting the code (color sequence) b: Division of the code (color sequence),
c: Three kinds of phenomena such as a change in the color of some cells can be considered while the number of cells does not change.

  Among these, a and b can be detected by counting the number of constituent cells. However, if the number of cells does not change (c), some kind of check is necessary.

  Normally, in a classic one-dimensional barcode (so-called white and black barcode), the decoded data value is usually checked by a modulus method or the like. Naturally, the same technique can be applied to the “automatic recognition code based on color arrangement”, and the practicality is high.

* The elements that make up the code for terms are called cells. In the automatic recognition code based on the color arrangement, the constituent elements are color cells having a certain color. When the color cell is actually printed directly on the article, the color cell is realized in a “certain area with a predetermined color” on the article. This is called a color region.

  When a code is assigned to an article via a tag such as a price tag, a color area which is a “area with a certain color” on the tag functions as a color cell. Moreover, a color cell may be implement | achieved by the fixed color area | region on an adhesive seal | sticker.

  When a certain data is expressed using a code defined by a certain rule / rule, a specific group of individual color cells is called a code symbol or simply a symbol.

  In principle, “code” means “code system”, but each code symbol may be collectively referred to simply as “code”.

Conventional prior arts, for example, Patent Document 1 below discloses a technique for detecting errors by comparing manually input data with scan results in order to detect bar code errors.

  Patent Document 2 below discloses a barcode error detection technique in a multi-entity environment connected via a network. In the technique described here, a print defect model is constructed for each scanning entity, this model is stored, and bar code error detection is performed using this model.

JP 2001-175806 A JP 2001-390162 A

  By the way, comparing the one-dimensional barcode and the “automatic recognition code by color arrangement” once again, the automatic recognition code by color arrangement has three types of cells (for example, R, G, B). The one-dimensional barcode has a thick bar and a thin bar for white and black, respectively, and is composed of at least four types of elements. That is, at least four types of distinctions can be made.

  Therefore, the conventional one-dimensional bar code can adopt a method of representing numbers and characters with a plurality of regular black and white bar units, so the first self-check should be performed according to the rules at that time. Can do. That is, a certain rule is provided for the combination of these four types of elements, and when a combination that does not match the rule occurs, it is considered that an error has occurred.

  In contrast, the “automatic recognition code based on color arrangement” generally uses three colors, and since the numerical values are determined based on the colors of adjacent cells, all data are considered from the viewpoint of data efficiency. In most cases, an array is associated with data. Therefore, it has not been practically performed to define an error sequence.

  In the present invention, in the "automatic recognition code by color arrangement", in addition to numerically calculating the data carried and detecting an error, the color cell arrangement has regularity, depending on whether or not the rule is followed, A new method for detecting array errors is proposed. Then, it will be described that such a method can be provided by means as practical as possible.

  (1) In order to solve the above-described problem, the present invention arranges a plurality of color cells with a predetermined color in a row, and any of color cell color arrangement, color combination, and color transition. In the automatic recognition code based on the color array representing the data, the number of each of the color cells is predetermined for at least one color, and when the automatic recognition code based on the color array is read, This is an automatic recognition code based on a color arrangement, characterized in that an error can be detected by confirming the number of each color.

  (2) In order to solve the above-described problem, the present invention arranges a plurality of color cells with a predetermined color in a row, and any of color cell color arrangement, color combination, and color transition. In the automatic recognition code based on the color array representing the data, the number of the color cells for each color is predetermined in a modulus type for at least one color, and when the automatic recognition code based on the color array is read In addition, the automatic recognition code by the color arrangement is characterized in that it is possible to detect an error by confirming whether the number for each color satisfies the modulus equation.

  (3) Further, the present invention provides the automatic recognition code based on the color arrangement described in (1) or (2) above, wherein the color cells constituting the automatic recognition code based on the color arrangement include a data cell representing data, An automatic recognition code based on a color array, which includes two types of color cells, including one or more redundant cells that are colored so as to satisfy a predetermined rule for the number of color cells.

  (4) Further, the present invention provides the automatic recognition code based on the color arrangement described in (1) or (2) above, wherein the color cells constituting the automatic recognition code based on the color arrangement include a data cell representing data, Only a code symbol of a combination of color cells that satisfies a predetermined rule for the number of color cells is used, and predetermined data is allocated to each code symbol of the combination to be used. This is an automatic recognition code by color arrangement.

  (5) Further, the present invention is the automatic recognition code according to the color arrangement described in the above (4), wherein the assigned data is a number, an alphabet, or a symbol.

  (6) Further, according to the present invention, in the automatic recognition code based on the color array described in (4) above, the user of the automatic recognition code based on the color array is associated with the rule with respect to the code symbol of the combination used. This is an automatic recognition code based on a color arrangement characterized by being able to assign data.

  (7) Further, the present invention is an automatic recognition code having a composite color arrangement formed by connecting a plurality of automatic recognition codes having the color arrangement described in (1) or (2), wherein the composite type A plurality of small-sized automatic recognition codes included in the automatic recognition code based on the color arrangement of FIG. 5 are automatic recognition codes based on a composite color arrangement characterized by representing single data.

  (8) Further, the present invention provides an automatic recognition code based on a plurality of small color arrangements included in the automatic recognition code based on the composite color arrangement in the automatic recognition code based on the composite color arrangement described in (7) above. Is an automatic recognition code based on a composite color arrangement, characterized in that they are connected to each other via a connection cell.

  (9) Further, according to the present invention, in the automatic recognition code based on the composite type color array described in (7) above, at least one color cell representing a start point or an end point is arranged at at least one end. This is an automatic recognition code based on a composite color arrangement.

  (10) Further, the present invention provides an automatic recognition code based on a plurality of small color arrangements included in the automatic recognition code based on the composite color arrangement in the automatic recognition code based on the composite color arrangement described in (7) above. Further, at least one end portion is an automatic recognition code based on a composite color array, in which one or more color cells representing a start point or an end point are arranged.

  (11) Further, the present invention provides an automatic recognition code based on a plurality of small color arrangements included in the automatic recognition code based on the composite color arrangement in the automatic recognition code based on the composite color arrangement described in (7) above. Among the above, the automatic recognition code based on at least one small color array is a composite in which the rule regarding the number of color cells therein is different from the other automatic recognition codes based on the small color array. This is an automatic recognition code based on the color arrangement of the mold.

  (12) Further, the present invention provides an automatic recognition code based on a plurality of small color arrangements included in the automatic recognition code based on the composite color arrangement in the automatic recognition code based on the composite color arrangement described in (7) above. Is an automatic recognition code based on a composite color array, wherein the rule regarding the number of color cells in the color cell is different for each small automatic recognition code based on the color array.

  (13) Further, the present invention provides an automatic recognition code based on a plurality of small color arrangements included in the automatic recognition code based on the composite color arrangement in the automatic recognition code based on the composite color arrangement described in (7) above. Is an automatic recognition code based on a composite color array, characterized in that the data represented by each small color array automatic recognition code is composed of original data to be represented and correction data for error correction. .

  (14) Moreover, this invention is an article | item to which the automatic recognition code by the color arrangement | sequence of any one of said (1)-(13) was attached | subjected.

  As described above, according to the present invention, since a certain rule is provided for the number of color cells, an optical automatic recognition code that can be easily checked and an article with the same are obtained. In other words, error detection can be performed at the stage of color detection before performing conventional error detection / correction such as arithmetic operation of data, i.e. before decoding and restoring data, so there is no need to perform complicated calculations. Error checking is possible.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

Method by First Redundant Cell Addition The method described first is to add a redundant cell and apply an odd / even determination method or a modulus check method.

  As described above, as long as the color array has a three-color configuration, it is difficult to create many types of patterns in association with data. On the other hand, when the number of colors is increased, the number of patterns obtained is increased, but the risk of erroneous color recognition is greatly increased due to the influence of the light source, color fading, camera color balance, and the like during imaging.

  Therefore, attention is paid to the number of colors (the number of cells of the color) constituting the code (included in each code symbol), and a technique for checking this will be described. Or, it is ruled as one of the checking methods in the code system.

  For example, in a code system in which “0” is represented by a color transition in the direction of R → G → B → R →, and “1” is represented by a color transition in the direction of R → B → G → R →, the start is started. Consider the data and color arrangement for R.

In this case, 0 is represented by RG, and 1 is represented by RB. If an attempt is made to represent the data “1000011”, the resulting code symbol cell sequence is:
"R-G-R-B-G-B-R"
It becomes. As can be understood from this code symbol, the total number of cells is 7, of which R cell number Cr = 3, G cell number Cg = 2, and B cell number Cb = 2.

  For example, the number of cells 7 is assumed to be known. Then, the odd / even judgment of Cr and Cg is performed (even number: 0 odd number; 1), and an error in the color number can be detected.

  In the example shown below, the appropriate three cells are added to the end of the code symbol to ensure that Cr and Cg are even numbers, and when an error occurs, these are odd numbers to be detected. .

  For example, B-R-B is added to the above example "R-G-R-B-B-G-B-R", that is, "R-G-R-B-G-B-R-B-R-B". In this case, both Cr parity and Cg parity can be set to 0 (that is, an even number).

  By adding 3 cells to all combinations, both Cr parity and Cg parity can always be zero.

  Hereinafter, an example of three cells in which the parity can be set to 0 for all combinations of Cr parity and Cg parity is shown in a table.

[Table 1]
Cr Cg End color Additional color even number R G-B-G
Even number even G R-B-R
Even number even B BR-R, G-B-G
Odd Odd R BRG, BGR, etc.
Odd Odd G BRG, BGR, etc.
Odd Odd B R-B-G, R-G-B, etc.
Even Odd R B-G-B
Even odd G B-G-B
Even Odd B R-G-R
Odd number even number R B-R-B
Odd number Even G B-R-B
Odd number even B B G-R-G
In this case, the total number of cells is 10, and this number of cells can also be used for checking.

  If both Cr and Cg are even numbers, either GBG or RBR may be added. Which one depends on the color of the last cell of the code symbol to be added, and three cells starting from a color different from the last color may be selected.

  When both Cr and Cg are odd numbers, it is sufficient to add a column of three cells each including one R, G, and B. It is sufficient to start with a color different from the color at the end of the depth column code symbol.

  If Cr and Cg are even and odd, respectively, either BGB or RGR may be added. Which one is selected depends on the color of the last cell of the code symbol to be added, and three cells starting from a color different from the last color may be selected.

  If Cr and Cg are odd and even numbers, either BRB or GRG may be added. Which one depends on the color of the last cell of the code symbol to be added, and three cells starting from a color different from the last color may be selected.

  By the way, this example is an odd / even determination and mathematically corresponds to mod (2). Naturally, by increasing the number of redundant cells, mod (3) (check the remainder when dividing by 3), mod (4), etc. Other numbers of modulus determinations are possible. As the modulus value increases, the accuracy of error detection increases accordingly.

  The modulus determination is a determination as to whether or not the modulus expression is satisfied. This is also referred to as “modulo expression” or “residue”. This is generally expressed in the form mod (n). The classification based on the value of this expression may be called a remainder class.

Terminology Here, a code symbol is composed of a plurality of color cells. A color cell is given a certain color, and each code symbol is configured by arranging the color cells. A code symbol is an individual symbol constructed to represent predetermined data by a certain code system.

  The code has various meanings. In general, this means a “code system” consisting of code generation rules, decoding rules, colors to be used and a color space that is an allowable range of the colors, etc., but one symbol ( The code symbol) may also be referred to as XX code for convenience.

  The code symbol is configured by arranging a plurality of color cells based on a code rule. In the present embodiment, the color cell is a two-dimensional predetermined region to which a certain color is added.

  More specifically, the color cell means a predetermined color area (color area) on the article in this embodiment. The code symbol is sometimes simply referred to as a symbol. In this embodiment, the code symbol functions as an automatic recognition code based on the color arrangement, and represents data such as numerical values.

Redundant cells and data cells A code symbol is composed of a plurality of color cells. A color cell for representing data is called a data cell, and a redundant cell and a partition added to match the number of color cells with a rule. Separated. That is, the color cell is
Data cell: A color cell for expressing a color sequence, a combination of colors, and a color transition for representing data.

  Redundant cell: A color cell added to satisfy the rule of the number of color cells.

  These two types of color cells are included.

Second Color Cell Number Complete Matching Method Next, the color cell number perfect matching method will be described. This corresponds to a special condition of the modulus check, but the number of cells of a predetermined color is specified to be a specified number. For example, it is conceivable to set the number Cr of R cells such that mod3 becomes 0. For this purpose, it is also preferable to use the redundant cell as described in the above first and adjust so that mod3 becomes “0”.

  However, it is possible only by counting the number of colors without calculating the modulus. Further, the error detection can always be detected as long as errors in the canceling direction do not occur simultaneously (for example, changes such as R → G and G → R). Therefore, the following method can be considered.

2-1 ◆ Method to match the rules without using redundant cells (Excludes non-matching arrays from the beginning)
That is, a method of generating (using) only a code (color array) that matches the rule without using redundant cells is conceivable. For example, it is considered that the code symbol is correct only when the number of R cells is 0, 3, and 6, and when the number of R cells is 1, 2, 4, 5 (the code symbol) is unused from the beginning. is there.

  As described above, this method considers the color cell number perfect match method and the modulus method.

2-2 * Color cell number perfect match method As described above, the number of color cells is determined from the beginning, and it is possible to take the number of cells from the beginning without adding redundant cells to match the rule. This is a method of assigning and using data only for the color arrangement. Code symbols other than the number of cells are not used, and if such code symbols are detected, it is determined that an error has occurred.

  Here, the color cell number perfect match method that does not use redundant cells has been described. However, it is also possible to set a rule using a modulus method without using redundant cells, which is preferable. Similar to the color cell number matching method, data is allocated only to code symbols that match the modulus method, and code symbols that do not match are not used from the beginning. Similar effects can be obtained.

[Specific Example 1]
Now, a specific example in the case of the redundant cell absence and color cell number perfect match method will be described.

  FIG. 1 shows all combinations in the case where the number of cells is 6, R, G, and B are each 2 and the start cell color is R.

  In FIG. 1, this table shows an example in which numbers 0 to 9 are applied to each combination. In the example of FIG. 1, since there are 6 cells using 3 colors, there are 96 combinations. Of these, there are 32 types of start cells with R, and there are 10 types of RGB with 2 cells each. This is shown in FIG.

[Specific Example 2]
FIG. 2 shows an example in which the number of cells is 9, R, G, and B are 3 cells, and the start cell is R. In this case, since there are 58 combinations, not only numbers 0 to 9 but also numbers, alphabets, and other symbols are allocated and used.

  This assignment can be freely customized and set by the user. In particular, it is preferable that the allocation is performed in association with the regulation of the number of cells.

[Specific Example 3]
On the other hand, an example in which the number of cells of each color is not the same is shown below. FIG. 3 shows a combination of 7 cells, R: 3 cells, G: 2 cells, and B2 cells starting from R cells. There are 20 combinations of cells that satisfy this condition, as shown in FIG.

[Specific Example 4]
FIG. 4 shows a combination in the case where the total number of cells is 8 and R: 3 cells, G: 2 cells, and B3 cells start from R cells.

[Specific Example 5]
◆ Calculation of the number of applicable combinations,
Here, the number of cells will be further increased, and the case of 12 cells and 4 cells of each color will be examined, and a specific example of calculating the number of combinations will be shown.

  A combination number table for explaining the calculation is shown in FIGS. Since the number of combinations is large, FIGS. 5 and 6 show only the positions that can be taken by the R cell, and each right column column indicates the number of combinations that can be taken at that time (possible G and B that can enter the empty cell). The number of combinations) is shown.

  That is, in FIGS. 5 and 6, four G or B are arranged at the positions of the empty cells.

Empty space of even-numbered cells When the number of consecutive consecutive empty cells is an even number, there are clearly only two combinations of arranging G and B for that space.

  For example, when the number of continuous vacant squares is 2, there are only two ways of “GB” and “BG”. Further, for example, when the number of continuous vacant squares is 4, there are only two ways of “GBGB” and “BGBG”.

  Thus, considering only even spaces, the total number of combinations is 2 to the nth power, where n is the number of even spaces.

Odd square empty space If the number of consecutive empty squares is an odd number, G or B eventually becomes one extra in that space. This is because all of RGB are assumed to be four.

  For example, when the number of continuously empty cells is 1, G or B enters the cell.

  For example, when the number of continuously empty cells is 3, GBG or BGB enters the cell.

  Further, for example, when the number of continuously open cells is 5, GBGBG or BGBGB enters the cell.

  Therefore, the combination is the number of combinations for an odd number of spaces. That is, when there are an odd number of empty cells, there are two combinations as described above.

  In this specific example, B and G are the same number. Since the spaces other than the odd spaces are even spaces, the numbers of G and B arranged there are equal. Therefore, the quantity of G and B arranged in the odd space should also be equal.

  In conclusion, if half of the odd spaces are determined, the remaining half of the combinations are also determined. That is, for example, when there are two areas of three cells, if one area is determined to be “GBG”, the other area is determined to be “BGB”. This is determined because G and B are the same number.

  As described above, when attention is paid to an odd-numbered area, if the number of combinations of allocation to an area that is half the number of the areas is obtained, this becomes the total number of combinations of the odd-numbered areas.

For example,
・ If there are two odd spaces, as described above, the number of allocations for one half of the area can be obtained, so there are two as described above. ・ If there are four odd spaces, 4 × 3 / (2 × 1) = 6 ways ・ If there are 6 odd spaces, 6 × 5 × 4 / (3 × 2 × 1) = 20.

  In FIG. 6, the possible states of each R are shown in each row. For each row, that is, for each possible arrangement state of R, the number of combinations of assignments for the space status is shown in the rightmost column of FIG. Specifically, the number of combinations of the number of even-numbered spaces and the number of odd-numbered spaces multiplied by the number of combinations is the number of combinations for each R possible state (each row), and is written in the rightmost column. Yes.

For example, if there are 4 odd spaces and 1 even space,
6 (odd) x 2 (even) = 12

Also, if there are 4 even spaces,
2 ways × 2 ways × 2 ways × 2 ways = 16 ways.

Furthermore, the total number 1092 (bottom end of the table) is the total number of combinations in the case where RGB is 4 cells in this condition. Further, it can be seen that the number of combinations in which R stands first (exists at the left end in the table) is 1/3 of 364.

  Originally, the number of all combinations according to the color arrangement method when using 3 colors and allocating to 12 cells is 2 ^ 11 = 2048 when the tip color is fixed. Of course, adjacent cells always have different colors.

On the other hand, in this specific example, the number is 364 as described above. It can be easily understood that this is more efficient in using the code than when three check cells are added. That means
364x (2 ^ 3)> 2048. Therefore, it can be considered as a practical and efficient method as a check method.

  Here, the case where the total number of cells is 12 and each of RGB is 4 cells has been described as an example, but it goes without saying that efficiency is similarly applied to the distribution of the number of cells and the number of each color cell other than this specific example. Can be realized.

  Furthermore, in this specific example, an example in which the R cell is always the start (left end) has been shown, but it is also possible to assume a scene where this is not always necessary. In that case, the number of combinations in the above table increases three times, so that a more convenient check method can be realized.

  As described above, in the embodiments described so far, a plurality of color cells are regarded as a unit, and a predetermined regularity can be given to the cell array by setting conditions for the number of color cells. An error check can be performed by confirming this regularity. That is, when the regularity is broken, it is possible to detect an error as an error has occurred. In the example described above, it is shown that numbers and characters can be represented by setting correspondence with the data as shown in the above figure for combinations satisfying regularity.

  Further, according to the system described in the present embodiment, uneven color distribution can be eliminated. Therefore, the effect of reducing the bias of white balance during imaging can be expected. In order to obtain this effect, it is preferable to define the number of RGB color cells as the same number as described in the specific example. Of course, since it depends on the color to be used, it is possible to reduce the bias of white balance by appropriately selecting the number ratio of the colors to be used.

Although the second odd-even determination method and the modulus check method have already been mentioned above, a method of generating a code (color array) that matches the modulus check rule without using redundant cells is also conceivable.

For example, if the total number of cells is 12 cells, R≡3 mod (5), G≡2 mod (5), the number of R cells and G cells satisfying this is as follows:
・ Number of R cells = 3, 8, ...
・ Number of cells in G = 2, 7, ...
It is.

  That is, the number of R cells, G cells, and B cells is determined by using a so-called remainder class (modulus) instead of fixing the number of R cells = 4.

  By defining such a rule, a combination of color arrangements with a predetermined number of cells can be obtained in the same manner as in the above-described example. In this case, since there are a plurality of possible values for the number of cells of each color, it can be expected that the number of combinations in accordance with the rules increases as compared with the above example in which the number is completely fixed.

  Even if the modulus method is not necessarily used, it is also preferable to define the color number rule so that each cell can have a plurality of numbers, such as “the number of R cells is three or four”. Also in this case, it can be expected that the number of combinations that can be taken (as in the modulus method) increases compared to the case where the number of cells is fixed to one.

3 Specific examples of implementation of the invention in a practical situation (configuration by “unit”)
As described above, according to the concept of the present invention, it is possible to configure a “color column” that can perform self-checking by limiting the number of colors for data having a large number of digits. it can.

  In addition, as shown in Table 1 and FIG. 1, a relatively small number of cells are used as “codewords”, and by connecting them, numbers (columns), characters (sentences), etc. can be expressed directly. it can.

  Here, the connection between “units” in the case where the “units” constituting the plurality of code words and the like are connected to form one code will be considered.

  The unit is a code word as mentioned above in terms of content, which is “a relatively small number of cells linked together” as described above. Here, an example is shown in which this code word is used as a “unit” to express long data.

  This long code symbol will be referred to as an automatic recognition code with a composite color arrangement for convenience. In contrast to this, the “unit” included therein is called an automatic recognition code based on a small color arrangement. In particular, this is referred to in the claims.

  First, FIGS. 7, 8 and 9 show a state in which N units are connected in one cord. Here, N is a natural number.

  Here, the number of cells in each unit and the number of cells by color are known, and based on this, the self-check described so far can be performed. However, when connecting units, the colors of the start point and end point must be different. In addition, the start point and end point of the entire code must be clear.

3-1 Example of FIG. 7 FIG. 7 shows an example in which the start point of each unit is a determined color (R in this example) and the end point is not determined. Table 1 and FIGS. 1 to 6 described so far also show examples in which the R cell is the starting point. At this time, if R appears at the end of each unit, it overlaps with the start point of the next unit and the number of cells changes. Therefore, it is conceivable that the number of cells of each unit known from the start point is counted in anticipation of this. However, there is an idea that a constant total cell count is more stable in checking, so it should be determined on a case-by-case basis which one should be adopted.

In an example in which the total number of cells is constant, in that case, it is conceivable to insert connected cells C1 to Cn _-1 between the units as shown in FIG. When the starting point is R as in this example, when the end of the codeword is G, the connected cell is B. This is because adjacent cells always have different colors. When the terminal is B, the connected cell is G. Furthermore, when the terminal cell is R, G or B is assigned as a connected cell. Similarly, it is necessary to make the colors of adjacent cells different. Therefore, regardless of the color of the end point, by providing one connected cell C, the color condition between cells (the colors of adjacent cells are always different) can be satisfied. In other words, one connected cell is necessary and sufficient.

  Of course, the number of connected cells C is not only one, but two, three, etc., and the redundancy is further increased, and functions such as check cell, unit order, color cell number indication, etc. It is possible to add to a cell.

  Of course, it is possible to add redundancy to this part and add functions such as an instruction for the check cell, unit order, and number of color cells.

  In order to distinguish the start point and the end point in the entire code symbol formed by connecting the “units”, a terminal cell is added to make the end point cell non-R.

  In this case, if the cell is simply a non-R cell, it is sufficient to add one cell at the end, and it is possible to cope with it. Depending on the application, it may be necessary to explicitly indicate the end. In such an application, a predetermined color such as G or B may be terminated to clarify the termination. In this case, it is necessary to add two cells as shown in FIG. The E1 and E2 cells in FIG. 7 correspond to this.

  In general, in the automatic recognition code based on the color array in which the color cells are arranged in a line (straight line, curved line, broken line, etc.), it is preferable for the sake of decoding and other processing to clearly indicate which is the start point and which is the end point There are many. In such a case, it is preferable to express the end explicitly as shown in FIG.

3-2 Example of FIG. 8 FIG. 8 shows an example in which the start point and end point of each unit are both R cells. In the example of FIG. 8, the entire structure is simplified by positively integrating the start point and the end point cell. That is, the start point and end point of adjacent units are shared by one R cell.

3-3 Example of FIG. 9 FIG. 9 shows an example in which the colors of the end point start points of all units are not limited. In this case, in order to clarify the start point and end point of the entire code symbol, additional cells are required at the front end and the end. In the example of FIG. 9, the starting point is represented by two cells S1 and S2. Further, the termination is represented by two cells E1 and E2.

  In particular, when the color is limited to one (R or the like), it is necessary to add two cells. Further, when the number of colors is limited to two, such as non-R colors (that is, G or B), it is necessary to add at least one cell.

  As described in FIG. 7, the end and start points of each unit are the same color, and even if they are used repeatedly, the division of each unit can be determined. At least one connected cell C is required between them.

  Further, in order to make the start point or the end point predetermined for each unit, it is necessary to insert at least two color cells CC ′ as shown in FIG. In FIG. 9, it is written as C1, C'1, etc.

  In this way, if the start point or end point of each unit is clearly stated, it becomes easy to estimate the start point and reading direction of each unit even if the start point and end point of the entire code are unknown for some reason, and consequently the code symbol. It is expected that the start point and end point of the whole can be easily determined.

3-4 In changing the check specifications for each unit, an example in which a large code symbol is configured by combining units based on FIGS. 7, 8, and 9 has been described. The chromatic number (self-check specification) is determined in advance, and the fact that self-checking can be performed based on this is the same as the code symbols described in Table 1 and FIGS.

  However, by deliberately changing the self-check specifications of each unit, even if the entire code symbol cannot be read and can be read partially or fragmentally, it can be partially recognized by recognizing the unit of the read portion. Even if there is, the possibility that data can be restored increases.

  That is, the self-check specification for each unit is set to various values, and the unit is determined from the self-check specification of the read unit.

  In this way, by confirming the self-check specifications of the read unit, it can be expected that the probability that the unit number included in the fragment and the data it represents can be decoded even from the code fragment is increased. .

  When the self-check specification is changed for each unit as described above, it is preferable that the self-check specification for a plurality of units is changed with regularity. By defining in this way, if the read fragment contains multiple units, the possibility that the data can be restored more accurately with the clue that the self-check specification of the multiple units has regularity is improved. I think that.

  Furthermore, as the self-check specification, in addition to determining the number of RGB cells in advance, it is also preferable to adopt the modulus specification as described above. In this case, the configuration of each unit naturally adopts the configuration of data cell + redundant cell.

  The following is an example of changing the specifications for each unit.

Example: Unit 1 self-check specifications: n cells, R m, G k
Unit 2 self-check specifications: n cells, R m + 1, G k
Unit 3 self-check specifications: n cells, R m, G k + 1
Unit 4 self-check specification: n cells, R + 1 m, G + 1 k
Unit 5 self-check specification: number of cells n, number of R m, number of G k−1
Unit 6 self-check specifications: n cells, R m-1, G k
Unit 7 self-check specification: number of cells n, modulus specification A (R≡2 mod (3), G≡1 mod (3))
Unit 8 self-check specification: n number of cells, modulus specification B (R≡0 mod (3), G≡2 mod (3))
etc. . .
In the automatic recognition code based on the color arrangement, the number of color cells is one of the items to be checked whether an error has occurred. Different specifications may be undesirable because the reading operation becomes complicated.

  However, if changes are made according to certain rules as described above, the check work is relatively easy compared to the case where completely separate self-check specifications are adopted, and errors can be detected by checking the specifications of multiple units. It is relatively easy to determine whether or not a problem has occurred.

  In the above example, each unit has the same number of cells and the rules for the number of R cells and G cells have been changed. However, for the purpose of increasing the types of other self-check specifications, the colors of the start cell and the end cell are the same. It is preferable to change the specifications (color, color arrangement), etc. of the connected cells according to a certain rule.

3-5 Employment of error correction technology capable of correcting missing units . Each unit represents a single piece of data while having redundancy, and an error occurs in reading some units, or a unit. It is also preferable to adopt an error correction structure so that the final data can be reproduced even if the data disappears and reading is impossible.

  For example, a method of performing correction in byte units (for example) like the Reed-Solomon method is known. It is preferable to apply this method to the unit of this embodiment. In this case, for example, a code word represented by each unit may represent “byte” data, and a Reed-Solomon code may be applied as a whole.

3-6 Unit Address It is reasonable that the address of each unit is the order in which the codes are arranged in the code. Conversely, the address can be known from the order. However, in the example in which the self-check specification is changed as in the above example, if the self-check specification of each unit is associated with an address and the self-check specification specifies that the address represents the code, the code will be fragmented. Even when only the fragment can be read, the address of the unit included in the fragment can be known from the self-check specification, and it is expected that the original data can be easily decoded.

  For example, consider the case where the total number of cells is 11, and the number of RGB cells is 3, 4, and 4, respectively. FIG. 10 shows a combination number table corresponding to FIGS. 5 and 6 in this case.

  In this case, as shown in FIG. 10, there are a total of 477 combinations that can be used, and more combinations than 1 byte = 8 bits = 256 are obtained. Therefore, 1-byte data can be expressed with a margin, and it is easy to apply a Reed-Solomon code having a byte structure.

  Here, even in the same 11 cells, the setting of the number of cells can take various values.

For example, the number of R cells, G cells, and B cells is
Specification 1 (5, 4, 4)
Specification 2 (4, 5, 4)
Specification 3 (4, 4, 5)
Various settings can be made as follows. Here, these are referred to as specification 1, specification 2, and specification 3 for convenience.

  Then, assuming that a code symbol in which four units are arranged is created, a self-check specification adopted by each unit is selected from the above specifications 1, 2, and 3. Specifically, the specification is assigned as shown in FIG.

  For example, the code on the first line in FIG. 11 indicates that the self-check specification of each unit is specification 1−specification 1−specification 2−specification 1. The same applies to each line.

  In this case, FIG. 11 shows that nine code symbols of four units can be created.

  Here, in each code symbol in each row, even if there is a reading error in one unit out of four units and there is a reading error, it is assumed that there is an error from the remaining three units. It is possible.

  Further, as shown in FIG. 11 for all the code symbols, since the arrangement of specifications is different, each “unit” can be distinguished, and the 36 convenient units shown in FIG. 11 can be distinguished.

  Furthermore, as described above, since the number of data is larger than 1 byte per unit, a total of 36 bytes of Reed-Solomon data can be configured.

Since the fourth article , the automatic recognition code based on the color arrangement in which a predetermined rule is provided for the number of color cells has been described. If an automatic recognition code based on this optical color arrangement is attached to an article, errors can be easily checked and errors can be easily detected, thereby further reducing the possibility of misreading information about the article. Can do.

It is explanatory drawing which shows all the combinations in case the number of cells 6, each R, G, B cell number is 2 and the start cell color is R. It is explanatory drawing which shows the example of the number of cells being 9, 3 each for R, G, B, and R for the start cell. It is explanatory drawing which shows the combination when it is a total cell number 7 cell, R: 3 cell, G: 2 cell, B2 cell, and starts from the cell of R. FIG. It is explanatory drawing which shows the combination when it is a total cell number of 8 cells, and it is R: 3 cell, G: 2 cell, and B3 cell, and starts from the cell of R. FIG. It is a figure which shows the table of the combination about the case of a total cell number of 12 cells and 4 cells of each color. It is a figure which shows the table of the combination about the case of a total cell number of 12 cells and 4 cells of each color. It is explanatory drawing which shows the state where N units were connected in one code | cord | chord. It is explanatory drawing which shows the state where N units were connected in one code | cord | chord. It is explanatory drawing which shows the state where N units were connected in one code | cord | chord. It is a figure of the table of the number of combinations in case the total number of cells is 11 cells and the number of RGB cells is 3, 4 and 4, respectively. It is explanatory drawing explaining the self-check specification which each unit employ | adopts, when producing the code symbol which arranged 4 units.

Explanation of symbols

S1, S2 Cell representing the start point E1, E2 Cell representing the end point

Claims (14)

In an automatic recognition code by arranging a plurality of color cells with a predetermined color in a row and representing the data in one of the color cell color arrangement, color combination, and color transition,
The number of each of the color cells for each color is predetermined for at least one color,
An automatic recognition code based on a color arrangement, wherein an error can be detected by checking the number of each color when reading the automatic recognition code based on the color arrangement. In an automatic recognition code by arranging a plurality of color cells with a predetermined color in a row and representing the data in one of the color cell color arrangement, color combination, and color transition,
The number of each of the color cells for each color is predetermined in a modulus formula for at least one color,
An automatic recognition code based on a color array, wherein when detecting the automatic recognition code based on the color array, an error can be detected by checking whether or not the number of each color satisfies the modulus equation. . In the automatic recognition code by the color arrangement according to claim 1 or 2,
The color cells constituting the automatic recognition code based on the color array are: a data cell representing data; and one or more redundant cells colored to satisfy the predetermined rule of the number of color cells. An automatic recognition code based on a color arrangement characterized by including two types of color cells. In the automatic recognition code by the color arrangement according to claim 1 or 2,
The color cells constituting the automatic recognition code based on the color arrangement use only the code symbol of a combination of a data cell representing data and a color cell satisfying the predetermined rule of the number of color cells. An automatic recognition code based on a color arrangement, wherein predetermined data is assigned to each combination of code symbols.   5. The automatic recognition code according to claim 4, wherein the assigned data is a number, an alphabetic character, or a symbol. In the automatic recognition code by the color arrangement | sequence of Claim 4,
An automatic recognition code based on a color arrangement, wherein a user of an automatic recognition code based on a color arrangement can assign data associated with the rule to a code symbol of the combination used. An automatic recognition code based on a composite color array formed by connecting a plurality of automatic recognition codes based on the color array according to claim 1 or 2,
An automatic recognition code based on a composite color array, wherein the plurality of small automatic recognition codes based on the color array included in the automatic recognition code based on the composite color array represent a single data. In the automatic recognition code by the composite type color arrangement according to claim 7,
Automatic recognition by a composite color array, wherein a plurality of small automatic recognition codes by the color array included in the automatic recognition code by the composite color array are connected to each other via a connection cell code. In the automatic recognition code by the composite type color arrangement according to claim 7,
An automatic recognition code based on a composite color arrangement, wherein one or more color cells representing a start point or an end point are arranged at at least one end. In the automatic recognition code by the composite type color arrangement according to claim 7,
One or more color cells representing a start point or an end point are arranged at least at one end of a plurality of small-sized automatic recognition codes included in the composite type automatic arrangement code. A self-recognizing code based on a composite color array. In the automatic recognition code by the composite type color arrangement according to claim 7,
Among the plurality of small automatic recognition codes based on the color arrangement included in the complex type automatic arrangement code, the automatic recognition code based on at least one small color arrangement relates to the number of color cells therein. An automatic recognition code based on a composite color arrangement, wherein the rule is different from other small-sized automatic recognition codes based on the color arrangement. In the automatic recognition code by the composite type color arrangement according to claim 7,
A plurality of small-sized automatic recognition codes included in the complex-type automatic color recognition code include a rule for the number of color cells in each of the small-sized automatic color recognition codes. An automatic recognition code with a complex color arrangement characterized by being different. In the automatic recognition code by the composite type color arrangement according to claim 7,
A plurality of small-size automatic color recognition codes included in the complex-type color color automatic recognition code include data representing the original data to be represented, error correction data, and the like. And an automatic recognition code using a composite color arrangement characterized by comprising correction data for   An article to which an automatic recognition code by the color arrangement according to any one of claims 1 to 13 is attached.

Images